Clustering Web Search Results with Maximum Spanning Trees

被引：0

作者：

Di Marco, Antonio ^{[1
]}

Navigli, Roberto ^{[1
]}

机构：

[1] Univ Roma La Sapienza, Dipartimento Informat, I-00198 Rome, Italy

来源：

AI(STAR)IA 2011: ARTIFICIAL INTELLIGENCE AROUND MAN AND BEYOND | 2011年 / 6934卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present a novel method for clustering Web search results based on Word Sense Induction. First, we acquire the meanings of a query by means of a graph-based Clustering algorithm that calculates the maximum spanning tree of the co-occurrence graph of the query. Then we cluster the search results based on their semantic similarity to the induced word senses. We show that our approach improves classical search result clustering methods in terms of both clustering quality and degree of diversification.

引用

页码：201 / 212

页数：12

共 50 条

[41] An efficient user-oriented clustering of web search results
Cai, K
Bu, JJ
Chen, C
COMPUTATIONAL SCIENCE - ICCS 2005, PT 3, 2005, 3516 : 806 - 809
[42] Clustering Web Video Search Results with Convolutional Neural Networks
Phuc Quang Nguyen
Tien Do
Anh-Thu Nguyen-Thi
Thanh Duc Ngo
Le, Duy-Dinh
Tu-Anh Hoang Nguyen
2016 3RD NATIONAL FOUNDATION FOR SCIENCE AND TECHNOLOGY DEVELOPMENT CONFERENCE ON INFORMATION AND COMPUTER SCIENCE (NICS), 2016, : 135 - 140
[43] Related terms clustering for enhancing the comprehensibility of web search results
Yasukawa, Michiko
Yokoo, Hidetoshi
DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2007, 4653 : 359 - +
[44] Semantic Clustering of Russian Web Search Results: Possibilities and Problems
Kutuzov, Andrey
INFORMATION RETRIEVAL, RUSSIR 2014, 2015, 505 : 320 - 331
[45] DISAMBIGUATING WEB SEARCH RESULTS BY TOPIC AND TEMPORAL CLUSTERING A Proposal
Campos, Ricardo
Dias, Gael
Jorge, Alipio Mario
KDIR 2009: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND INFORMATION RETRIEVAL, 2009, : 292 - +
[46] Web search results clustering in Polish: Experimental evaluation of carrot
Weiss, D
Stefanowski, J
INTELLIGENT INFORMATION PROCESSING AND WEB MINING, 2003, : 209 - 218
[47] Online Clustering Algorithm for Restructuring User Web Search Results
Pavani, M.
Teja, G. Ravi
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON FRONTIERS OF INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2014, VOL 1, 2015, 327 : 27 - 36
[48] Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems
Brockbank, Simon
Pesant, Gilles
Rousseau, Louis-Martin
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 175 - 183
[49] Sharing the cost of maximum quality optimal spanning trees
Subiza, Begona
Peris, Josep E.
TOP, 2021, 29 (02) : 470 - 493
[50] Finding maximum-cost minimum spanning trees
Belal, Ahmed
Elmasry, Arnr
3RD ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, 2005, 2005,

← 1 2 3 4 5 →