Query clustering using click-through graph

WWW'09 - Proceedings of the 18th International World Wide Web Conference

Volumn , Issue , 2009, Pages 1055-1056

  Yi, Jeonghee ^a   Maghoul, Farzin ^a  

^a YAHOO INC   (United States)

Author keywords

Algorithms; Experimentation

Indexed keywords

BICLIQUE; EQUIVALENCE SET; EXPERIMENTATION; QUERY CLUSTERING; QUERY NODES; SCALABLE ALGORITHMS; WEB SEARCH LOGS; WEB SEARCH QUERIES;

ALGORITHMS; DIRECTED GRAPHS; EXPERIMENTS;

WORLD WIDE WEB;

EID: 72249122084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1526709.1526853     Document Type: Conference Paper

References (5)

1. J. J. Carrasco, D. C. Fain, K. J. Lang, and L. Zhukov. Clustering of bipartite advertiser-keywork grdaph. Workshop on Large Scale Clustering, ICDM 2003.
2. th Int. World Wide Web Conference, 1999.
3. th Scandinavian Workshop on Algorithm Theory, 2004.
4. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 363(1), pp.28-42, 2006.
5. J. Wen, J. Nie, H. Zhang. Query clustering using user logs. ACM Transactions on Information Systems, 20(1), pp. 59-31, 2002.