博碩士論文 100423042 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:8 、訪客IP:13.59.166.87
姓名 謝沛翰(Pei-Han Hsieh)  查詢紙本館藏   畢業系所 資訊管理學系
論文名稱 查詢與相關回饋之語詞連結關係的應用
(The application of the semantic linking between the user query and relevance feedback)
相關論文
★ 信用卡盜刷防治簡訊規則製作之決策支援系統★ 不同檢索策略之效果比較
★ 知識分享過程之影響因子探討★ 兼具分享功能之檢索代理人系統建構與評估
★ 犯罪青少年電腦態度與學習自我效能之研究★ 使用AHP分析法在軟體度量議題之研究
★ 優化入侵規則庫★ 商務資訊擷取效率與品質促進之研究
★ 以分析層級程序法衡量銀行業導入企業應用整合系統(EAI)之關鍵因素★ 應用基因演算法於叢集電腦機房強迫對流裝置佈局最佳近似解之研究
★ The Development of a CASE Tool with Knowledge Management Functions★ 以PAT tree 為基礎發展之快速搜尋索引樹
★ 以複合名詞為基礎之文件概念建立方式★ 利用使用者興趣檔探討形容詞所處位置對評論分類的重要性
★ 透過半結構資訊及使用者回饋資訊以協助使用者過濾網頁文件搜尋結果★ 利用feature-opinion pair建立向量空間模型以進行使用者評論分類之研究
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 ( 永不開放)
摘要(中) 過去在資訊檢索 (Information Retrieval) 領域中,往往都是利用字詞出現頻率來衡量使用者下達之查詢字詞與系統中文件間之關聯性,此方式存在一個問題便是系統的檢索效能決定於使用者組成的查詢字詞品質,後來有研究者提出了以相關回饋(Relevance feedback)來解決此問題,相關回饋領域在向量空間回饋模型中又以Rocchio演算法為其指標,Rocchio演算法在運作時需要正相關文件與負相關文件來達成回饋動作,本研究提出一套方法利用原始查詢字詞所隱含之語意連結關係過濾回饋回來之正相關文件,達成語意式的負相關回饋,擷取出Rocchio演算法所忽略之語意資訊。本研究方法可使回饋文件所隱含之正相關資訊更精確,並於實驗結果證實,本方法不管是在MAP、P@N、PR Curve上等等評估指標都可以與Rocchio演算法不分軒輊,並且在某些情況上甚至更佳。
摘要(英) In the past, Information retrieval system often uses term frequency to measure the correlation between user query and corpus. The main problem is that quality of the user query can affect the retrieval efficiency. Recently, researchers have proposed the using of relevance feedback in the solving of this problem. One of the popular method is Rocchio algorithm. In the relevance feedback process, Rocchio algorithm uses positive and negative document to modify the user query. Our research proposes a method to retrieve the original query’s semantic information that Rocchio algorithm was ignored to filter irrelevant terms from positive relevance feedback. The performance of our method has been evaluated in experiment. In MAP, P@N and PR Curve show that our method is as good as Rocchio algorithm, in some case even better.
關鍵字(中) ★ 相關回饋
★ 向量空間模型
★ 資訊檢索
★ NGD
★ 搜尋引擎
關鍵字(英) ★ Relevance Feedback
★ Vector Space Model
★ Information Retrieval
★ NGD
★ Search Engine
論文目次 中文摘要 i
英文摘要 ii
銘謝 iii
目錄 iv
圖目錄 vi
表目錄 viii
一、 緒論 1
1-1 研究背景與動機 1
1-2 研究目的 2
1-3 研究範圍與限制 2
1-4 論文架構 2
二、 文獻探討 3
2-1 相關回饋 (Relevance Feedback) 3
2-1-2 向量空間模型 (Vector Space Model) 4
2-1-3 Rocchio演算法 (Rocchio algorithm) 6
2-2 查詢擴展(Query Expansion) 7
2-3 知識本體(Ontology) 8
2-3-1 語意網路(Semantic Network) 8
2-3-2 基於知識本體的查詢擴展(Query expansion base on Ontology) 9
2-3-3 正規化Google距離 (Normalized Google Distance) 11
三、 研究方法 13
3-1 系統架構與演算法 13
3-1-1 概念字詞過濾 14
3-1-2 文件重排序 16
3-1-3 小結 16
四、 實驗驗證 20
4-1 實驗資料 20
4-2 實驗評估指標 25
4-3 實驗參數設定 29
4-3-1 目標演算法 29
4-3-2 前測 29
4-4 實驗設計與流程 30
4-4-1 實驗一 30
4-4-2 實驗二 34
4-4-3 綜合比較與討論 37
五、 結論 40
5-1 結論與貢獻 40
5-2 未來研究方向 40
參考文獻 41
參考文獻 [1] G. Furnas, T. Landauer, L. Gomez et al., “The vocabulary problem in human-system communication”, Commun. ACM, vol. 30, no. 11, pp. 964-971, 1987.
[2] J. Rocchio, “Relevance feedback in information retrieval”, The SMART Retrieval System: Experiments in Automatic Document Processing, G. Salton, ed., pp. 313-323: Prentice-Hall, Englewood Cliffs NJ, 1971.
[3] E. Eckard, C. Chappelier, “Free Software for research in Information Retrieval and Textual Clustering”. Technical report, Ecole Polytechnique Federale de Lausannel, 2007.
[4] L. P. Group, "Lemur Project,"; http://www.lemurproject.org/
[5] P. Ogilvie, P. Callan, “Experiments Using the Lemur Toolkit,” InTREC, Vol. 10, pp. 103-108, 2001.
[6] M. Porter, “An algorithm for suffix stripping,” In Program,14(3), pp. 130-137, July 1980.
[7] W. Lancaster, “MEDLARS: Report on the Evaluation of Its Operating Efficiency”, American Documentation, 20(2) pp. 119-48. 1969.
[8] C.j. Van Rijsbergen, “A New Theoretical Fremework For Information Retrieval,” Paper presented at ACM Confernece on Research and Development in Information Retrieval. Pisa, Italy, 1986.
[9] G. Salton, “The SMART retrieval system; experiments in automatic document processing”, Englewood Cliffs, N.J., Prentice-Hall, 1971.
[10] E. Robertson, S. Jones, “Relevance weighting of search terms”, Journal of the American Society for Information science, 27(3), pp.129-146, 1976.
[11] B. Croft, T. S. Townsend, V. Lavrenko. “Relevance Feedback and Personalization: A Language Modeling Perspective”, In DELOS Workshop: Personalisation and Recommender Systems in Digital Libraries, June, 2001.
[12] G. Cao. , Y. Nie. J, J. Gao, S. Robertson. “Selecting good expansion terms for pseudo-relevance feedback”, In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval pp. 243-250. ACM.
[13] Wang, X., Fang, H., & Zhai, C, “A study of methods for negative relevance feedback”, In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval pp. 219-226. ACM, 2008.
[14] G. Salton and M. Lesk, “Computer evaluation of indexing and text processing”, Journal of the ACM, 15(1). pp. 8-36, january 1968.
[15] R. Krovetz, B. Croft, “Lexical ambiguity in information retrieval”, ACM Transactions on Information Systems, 10(2), pp. 115–141. 1992.
[16] D. Harman, “Relevance feedback revisited”, In Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval. pp. 1-10. ACM. June, 1992.
[17] A. Sihvonen, P. Vakkari, “Subject knowledge improves interactive query expansion assisted by a thesaurus”, Journal of Documentation 60(6), pp. 673-690.
[18] R. Robertson, P. Willett, “A comparison of spelling-correction methods for the identification of word forms in historical text databases”, Literary and Linguistic Computing, 8, pp. 143-152, 1993.
[19] C. Buckley et al, “Automatic query expansion using SMART: TREC 3”, In Proceedings of the third text retrieval conference, NIST Special Publication, 500-225, pp. 69–80, 1995.
[20] B. Billerbeck, J. Zobel, “Questioning query expansion: an examination of behaviour and parameters”, In Proceedings of the fifteenth australasian database conference, ADC 2004, CRPIT 18–22 January 2004, Australian Computer Society.
[21] F . Arvidsson, A . Flycht-Eriksson, "Ontologies", Retrieved 26 November 2008.
[22] R. Gruber, “A translation approach to portable ontology specifications”, Knowledge acquisition, 5(2), pp. 199-220. 1993.
[23] M. Bates, “After the dot-bomb: Getting web information retrieval right this time”, First Monday, 7(7).
[24] M . Eric M, L. Stephen. "Concepts", Stanford Encyclopedia of Philosophy. Metaphysics Research Lab at Stanford University. Retrieved 6 November 2012.
[25] J . Russell, P. Norvig, “Artificial intelligence : a modern approach (3rd ed.)”, Upper Saddle River, N.J.: Prentice Hall. pp. 454. ISBN 978-0-13-604259-4.
[26] S. Robert . "Synthetic language behavior", Data Processing Management 5 (12): pp.11–18. 1963.
[27] R. Quillian. “A notation for representing conceptual information: An application to semantics and mechanical English para- phrasing”, SP-1395, System Development Corporation, Santa Monica, 1963.
[28] M . Collins, M.R. Quillian, "Retrieval time from semantic memory", Journal of verbal learning and verbal behavior 8 (2): pp. 240–247, 1969.
[29] M . Collins, M.R. Quillian, “Does category size affect categorization time?”, Journal of verbal learning and verbal behavior 9 (4): 432–438. 1970.
[30] M. Collins, L. Elizabeth, “A spreading-activation theory of semantic processing,” Psychological Review 8, 1975.
[31] M. R. Quillian, “Word concepts: A theory and simulation of some basic semantic capabilities”, Behavioral Science, 12(5), pp. 410-430. 1967.
[32] M. R. Quillian, “Semantic memory”, Semantic information processing, pp. 227–270, 1968.
[33] M. R. Quillian, “The teachable language comprehender: a simulation program and theory of language”, Communications of the ACM, 12(8), pp. 459-476. 1969.
[34] M. R. Quillian, “Semantic Memory. Unpublished doctoral dissertation”, Carnegie Institute of Technology, 1966.
[35] J . Bhogal, J, A. MacFarlane, P. Smith, “A review of ontology based query expansion”, Information processing & management, 43(4), 866-886. 2007.
[36] E. Voorhees, ”Query expansion using lexical-semantic relations”, SIGIR ’94 In Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 61 – 69, Springer, 1994.
[37] G. Varelas, E. Voutsakis, “Semantic Similarity Methods in WordNet and their Application to Information Retrieval on the Web”, Web Information and Data Management (WIDM 2005), pp. 10 - 16, ACM Press, 2005.
[38] K . Collins, J. Callan, “Query expansion using random walk models”, In Proceedings of the 14th ACM international conference on Information and knowledge management. pp. 704-711. ACM, 2005.
[39] A. Miller, “WordNet: A Lexical Database for English”, Communications of the ACM , Vol. 38, No. 11: pp. 39-41,1995.
[40] E. Lipscomb, “Medical subject headings (MeSH)”, Bulletin of the Medical Library Association, 88(3), pp. 265.
[41] R. Cilibrasi, P. Vitanyi, “The Google Similarity Distance”, IEEE Trans. Knowledge and Data Engineering, vol. 19, pp.370 - 383, 2007.
[42] L. Page, S. Brin, R. Motwani, T. Winograd, ”The PageRank citation ranking: bringing order to the web”, 1999.
[43] X.-G. Wang, Y. Li, “Web Personalization Method Based on Relevance Feedback on Keyword Space”, Management and Engineering, SSME ’09, 2009. IITA International Conference on, pp. 34-37. 2009.
[44] M. de Kunder, “Geschatte grootte van het geïndexeerde World Wide Web”, Tilburg University, 63, 2008.
[45] M. Voorhees, and D. Harman, “Overview of the sixth text retrieval conference (TREC-6)”, Information Processing & Management, 36(1), pp. 3-35, 2002.
[46] G. Salton and C. Buckley, “Improving retrieval performance by relevance feedback”, Readings in information retrieval, J. Karen Sparck and W. Peter, eds, pp. 355-364: Morgan Kaufmann Publishers Inc, 1997.
[47] G. Salton and M. McGill. Introduction to Modern Information Retrieval. McGraw-Hill Book Co., New York, 1983.
指導教授 周世傑(Shih-Chieh Chou) 審核日期 2013-7-22
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明