Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/www2009/paper/108> ?p ?o. }
Showing items 1 to 8 of
8
with 100 items per page.
- 108 type InProceedings.
- 108 label "Query Clustering using Click-Through Graph".
- 108 sameAs 108.
- 108 abstract "In this p aper w e describe a problem of d iscovering query clusters from a click -through graph of w eb search logs. The graph consists of a set of web search queries, a set of pag es selected for the queries, and a set of d irected edges that connects a query node and a page node click ed by a user for the query. The proposed method extracts all m axim al b ipartite cliques (b icliques) from a click-through graph and compute an equiv alence set of queries (i.e., a query cluster) from the m axim al bicliques. A cluster of queries is form ed from th e queries in a biclique. We present a scalable algorithm that enumerates all maximal bicliques from the click-through graph. We h ave conducted experim ents on Yahoo web search queries and the result is p romising.".
- 108 hasAuthorList authorList.
- 108 isPartOf proceedings.
- 108 keyword "Poster Session".
- 108 title "Query Clustering using Click-Through Graph".