分群法调整排名计算范例-Academic-journalorg.DOC

以GAAC分群法提升 魏世杰 周建榮 淡江大學資訊管理學系助理教授 淡江大學資訊管理學系研究生 seke@.tw elvispresley40@ 摘要 傳統桌面檢索回傳往往仍使用者花費心思逐步過濾，才能取得真正所需。本研究利用群平均聚合分群法(Group-Average Agglomerative Clustering,GAAC)形成群集。挑出非單一群，以其最後結合相似度。挑出剩餘單一群，以其檢索回傳原始排名順序，調整排名。 本研究用中文文件集共49210篇。Google Desktop Search回傳原始文件排名結果，再透過雜訊過濾，斷詞、特徵詞選取、建立向量等處理重新排名，原始排名做比。 關鍵詞GAAC聚合法，特定查詢句分群， Google Desktop Search。 UsGAAC Clustering Method to Improve the Performance of Desktop Search Engines Abstract Traditional desktop search engines such as Google Desktop Search usually return a document ranking which still takes time to filter the desired documents. To improve the document ranking, this work adopts the query-specific clustering approach and proposes a two stage clustering scheme. Based on the returned snippets, the first stage divides the snippets 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 CIRB030 is used which consists of 49210 documents and 42 enquiry topics. An original document ranking is obtained from Google Desktop Search. 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