Volume 36 Issue 4
Apr.  2010
Turn off MathJax
Article Contents
Jia Rongfei, Jin Maozhong, Wang Xiaoboet al. Query clustering using user-query logs[J]. Journal of Beijing University of Aeronautics and Astronautics, 2010, 36(4): 500-503. (in Chinese)
Citation: Jia Rongfei, Jin Maozhong, Wang Xiaoboet al. Query clustering using user-query logs[J]. Journal of Beijing University of Aeronautics and Astronautics, 2010, 36(4): 500-503. (in Chinese)

Query clustering using user-query logs

  • Received Date: 10 Jul 2009
  • Publish Date: 30 Apr 2010
  • A new query clustering method on user-query log was presented. Traditional clustering techniques focused on queries and click-through logs, which are often sparse. The average cluster size is often small. In contrast, the user-query log is much denser as well as noisier. To reduce the influence of the noises and discover similar queries, queries visited by the same user at the same session were assumed to be mostly similar. Based on the assumption, a new similarity measure using query co-occurrence relations was calculated to create query neighbor vector space. The queries were represented by vectors consisting of their neighbors. The similarity function for clustering was calculated based on the query neighbor vectors. An adjusted clustering method of density-based spatial clustering of applications with noise(DBSCAN) was applied to generate the clusters. Experiments on a real dataset of 95262 queries show that 79.77% precision and 48.21% recall is achieved and the average cluster size achieves 51.

     

  • loading
  • [1] Wen Jirong,Nie Jianyun,Zhang Hongjiang.Query clustering using user logs[J].ACM Transactions on Information Systems,2002,20(1):59-81 [2] Fonseca B M,Golgher P B,De Moura E S,et al.Using association rules to discovery search engines related queries //1st Latin American Web Congress.Santiago:Citeseer,2003:66-71 [3] Beeferman D,Berger A L.Agglomerative clustering of a search engine query log //Proceedings of the 6th ACM SIGKDD International conference on Knowledge discovery and data mining.New York:ACM Press,2000:407-416 [4] Baeza-Yates R A,Tiberi A.Extracting semantic relations from query logs //Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM Press,2007:76-85 [5] Chan W,Leung W,Lee D.Clustering search engine query log containing noisy clickthroughs //Proceedings of SAINT Conference 2004.Tokyo:IEEE Computer Society,2004:305-308 [6] 张辉,谢科,庞斌,等.一种基于关键特征的搜索引擎结果聚类算法[J].北京航空航天大学学报,2007,33(6):739-742 Zhang Hui,Xie Ke,Pang Bin,et al.Key-feature-based clustering algorithm for search engine results[J].Journal of Beijing University of Aeronautics and Astronautics,2007,33(6):739-742(in Chinese)  [7] 张刚,刘悦,郭嘉丰,等.一种层次化的检索结果聚类方法[J].计算机研究与发展,2008,45(3):542-547 Zhang Gang,Liu Yue,Guo Jiafeng,et al.A hierarchical search result clustering method[J].Journal of Computer Research and Development,2008,45(3):542-547(in Chinese)  [8] Yi J,Maghoul F.Query clustering using click-through graph //Proceedings of the 18th International Conference on World Wide Web.Madrid:ACM Press,2009:1055-1056  [9] Deshpande M,Karypis G.Item-based top-n recommendation algorithms[J].ACM Transactions on Information Systems,2004,22(1):143-177 [10] Ester M,Kriegel H P,Sander J,et al.A density-based algorithm for discovering clusters in large spatial databases with noise //Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining.Portland:AAAI Press,1996:226-231
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(3567) PDF downloads(3040) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return