Building an Expert Finding System by Using Google Distance Approach
碩士 === 國立臺北教育大學 === 數學暨資訊教育學系(含數學教育碩士班) === 103 === Expert finding have always gotten much attention at information retrieval for a long time. Many researches provide many better achievement than before, but it still have room for improvement. Query Expansion is a method to add the feedback results,...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/rq95dp |
id |
ndltd-TW-103NTPT0480002 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTPT04800022019-05-15T21:51:48Z http://ndltd.ncl.edu.tw/handle/rq95dp Building an Expert Finding System by Using Google Distance Approach 建置以Google距離技術為基礎之專家找尋系統 Yu-Li Lin 林侑立 碩士 國立臺北教育大學 數學暨資訊教育學系(含數學教育碩士班) 103 Expert finding have always gotten much attention at information retrieval for a long time. Many researches provide many better achievement than before, but it still have room for improvement. Query Expansion is a method to add the feedback results, and can promote the search precision effectively. In generally, this method had often involved the term frequency, and will generate the terms problem about noise in the process. Google platform have possessed a large number of web contents, each correlation between two terms is hidden in there. We can assess the semantic distance by analyzing the whole web content. Therefore, this research provides a NGD model to solve the problem about expert finding by sorting the expansion terms by Google. The experiment result shows that it do not really enhance the precision by using Google information, but when the expansion terms selected more, the precision will increase. On the other hands, the model also can solve the terms problem about noise. Kai-Hsiang Yang 楊凱翔 2015 學位論文 ; thesis 43 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北教育大學 === 數學暨資訊教育學系(含數學教育碩士班) === 103 === Expert finding have always gotten much attention at information retrieval for a long time. Many researches provide many better achievement than before, but it still have room for improvement. Query Expansion is a method to add the feedback results, and can promote the search precision effectively. In generally, this method had often involved the term frequency, and will generate the terms problem about noise in the process. Google platform have possessed a large number of web contents, each correlation between two terms is hidden in there. We can assess the semantic distance by analyzing the whole web content. Therefore, this research provides a NGD model to solve the problem about expert finding by sorting the expansion terms by Google. The experiment result shows that it do not really enhance the precision by using Google information, but when the expansion terms selected more, the precision will increase. On the other hands, the model also can solve the terms problem about noise.
|
author2 |
Kai-Hsiang Yang |
author_facet |
Kai-Hsiang Yang Yu-Li Lin 林侑立 |
author |
Yu-Li Lin 林侑立 |
spellingShingle |
Yu-Li Lin 林侑立 Building an Expert Finding System by Using Google Distance Approach |
author_sort |
Yu-Li Lin |
title |
Building an Expert Finding System by Using Google Distance Approach |
title_short |
Building an Expert Finding System by Using Google Distance Approach |
title_full |
Building an Expert Finding System by Using Google Distance Approach |
title_fullStr |
Building an Expert Finding System by Using Google Distance Approach |
title_full_unstemmed |
Building an Expert Finding System by Using Google Distance Approach |
title_sort |
building an expert finding system by using google distance approach |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/rq95dp |
work_keys_str_mv |
AT yulilin buildinganexpertfindingsystembyusinggoogledistanceapproach AT línyòulì buildinganexpertfindingsystembyusinggoogledistanceapproach AT yulilin jiànzhìyǐgooglejùlíjìshùwèijīchǔzhīzhuānjiāzhǎoxúnxìtǒng AT línyòulì jiànzhìyǐgooglejùlíjìshùwèijīchǔzhīzhuānjiāzhǎoxúnxìtǒng |
_version_ |
1719121558648127488 |