Jeonghee Yi
ABSTRACT
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages selected for the queries, and a set of directed edges that connects a query node and a page node clicked by a user for the query. The proposed method extracts all maximal bipartite cliques (bicliques) from a click-through graph and compute an equivalence set of queries (i.e., a query cluster) from the maximal bicliques. A cluster of queries is formed from the queries in a biclique. We present a scalable algorithm that enumerates all maximal bicliques from the click-through graph. We have conducted experiments on Yahoo web search queries and the result is promising.
- 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.Google Scholar
- R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities. The 8th Int. World Wide Web Conference, 1999. Google ScholarDigital Library
- K. Makino, and T. Uno, New algorithms for enumerating all maximal cliques, The 9th Scandinavian Workshop on Algorithm Theory, 2004.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- J. Wen, J. Nie, H. Zhang. Query clustering using user logs. ACM Transactions on Information Systems, 20(1), pp. 59--31, 2002. Google ScholarDigital Library
Index Terms
- Query clustering using click-through graph
Recommendations
Degeneracy of P t -free and C ⩾t -free graphs with no large complete bipartite subgraphs
AbstractA hereditary class of graphs G is χ-bounded if there exists a function f such that every graph G ∈ G satisfies χ ( G ) ⩽ f ( ω ( G ) ), where χ ( G ) and ω ( G ) are the chromatic number and the clique number of G, respectively. As one ...
On the generation of bicliques of a graph
An independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipartite set B is a subset of vertices admitting a bipartition B=X∪Y, such that both X and Y are independent sets, and all vertices of X are adjacent to those of Y. If ...
On edge-sets of bicliques in graphs
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the ...
Comments