Content free clustering for search engine query log

Authors:
Mehdi Hosseini;Hassan Abolhassani;Mohsn Sayyadi Harikandeh
Affiliations:
Sharif University of Technology, Web Intelligence Research Laboratory, Tehran, Iran;Sharif University of Technology, Web Intelligence Research Laboratory, Tehran, Iran;Sharif University of Technology, Computer Engineering Departmen, Tehran, Iran
Venue:
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Year:
2007

Citing 9
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
Answering questions for an organization online

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Agglomerative clustering of a search engine query log

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic query expansion using query logs

Proceedings of the 11th international conference on World Wide Web
Introduction to Algorithms

Introduction to Algorithms
Evaluation of hierarchical clustering algorithms for document datasets

Proceedings of the eleventh international conference on Information and knowledge management
Accurately interpreting clickthrough data as implicit feedback

Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Personalized Search Based on User Search Histories

WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Query recommendation using query logs in search engines

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Web query clustering is widely used by web information systems. In this paper we present a new content free method for web query log clustering. Query clustering has many applications including page ranking in web search, personalizing search result and web query expansion. In our approach, we first construct a bipartite graph for queries and visited URLs of a query log. Most of the clusters of queries are connected together with noisy users selections. So some huge connected components are produced. To eliminate such noisy links all queries and related URLs are projected in reduced dimensional space by applying singular value decomposition. Finally, a clustering algorithm will be applied in each pruned connected component, in new space. The method has been evaluated using a real world data set and by comparing it to existing approaches, the results show promising improvements.