淡江大學機構典藏:Item 987654321/34190
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62830/95882 (66%)
造訪人次 : 4046357      線上人數 : 978
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/34190


    題名: 以GAAC分群法提升中文檢索排名之研究
    其他題名: Using the GAAC clustering method to improve the ranking of Chinese retrieval systems
    作者: 周建榮;Chou, Chien-jung
    貢獻者: 淡江大學資訊管理學系碩士班
    魏世杰;Wei, Shih-chieh
    關鍵詞: GAAC聚合法;TFIDF向量空間檢索系統;Google Desktop Search;Group Average Agglomerative Clustering;TFIDF Vector Space Retrieval System;Google Desktop Search
    日期: 2009
    上傳時間: 2010-01-11 05:00:55 (UTC+8)
    摘要: 傳統桌面檢索引擎，包括Google Desktop Search、TFIDF向量空間檢索系統等，回傳文章的排名往往仍須使用者花費心思逐步過濾，才能取得真正所需求的文章。為改善文章排名，本研究採用兩階段分群方式。第一階段將底層檢索引擎回傳文章的Snippet分成兩群，一群排名在前，包含所有查詢句字詞；一群排名在後，包含部分或不包含查詢句字詞。第二階段就包含所有查詢句的Snippet群，利用群平均聚合分群法(Group-Average Agglomerative Clustering,GAAC)形成群集。先挑出非單一Snippet群，以其最後結合相似度由高到低決定群間排名。而針對群內排名，則以最終結合子群之最後結合相似度由高到低決定排名。最後，再挑出剩餘單一Snippet群，以其底層檢索系統回傳原始排名順序，遞補於前述分群結果之後，即為重新調整Snippet排名。
    本研究採用中文標準新聞文件集共49210篇，經由Google Desktop Search及TFIDF向量空間檢索系統回傳原始排名結果，再透過雜訊過濾，斷詞、特徵詞選取、建立Snippet向量、兩階段分群等處理重新排名，最後與原始排名做比較。結果顯示經由上述分群調整作法，確實有改善原始檢索系統之排名且速度不慢。
    Traditional desktop search engines such as Google desktop search or the TFIDF vector space retrieval system usually return a document ranking which still takes time to filter the desired documents. To improve the document ranking, this work proposes a two stage clustering scheme. Based on the returned snippets, the first stage divides the documents into two groups. The first group contains all keywords in the query and the second group contains partial or no query keywords. The ranking of the first group will be ahead of the second group. In the second stage, the first group is further applied the Group-Average Agglomerative Clustering (GACC) to form hierarchical clusters that all have a combination similarity above a given threshold. Based on the GAAC result, non-singleton clusters are ordered from high to low by their last combination similarity. Within each cluster, the two last combining subclusters are also ordered from high to low by their last combination similarity. Having a combination similarity of 0, singleton clusters will be located behind following their initial snippet order.
    As test dataset, a standard Chinese news dataset is used which consists of 49210 documents and 42 enquiry topics. An original document ranking is obtained from Google Desktop Search and a TFIDF vector space retrieval system respectively. Then the snippets are tokenized and filtered to extract the representative keywords and form the snippet vectors. The snippets then go through the two stage clustering scheme to adjust their ranking. The result shows that the two stage clustering scheme can improve the document ranking and the processing time is short.
    顯示於類別:[資訊管理學系暨研究所] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    0KbUnknown306檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋