{ "eprintid": "108", "rev_number": "4", "eprint_status": "archive", "dir": "disk0/00/00/01/08", "datestamp": "2009-04-06 19:11:51", "lastmod": "2009-04-07 14:02:45", "status_changed": "2009-04-06 19:11:51", "type": "conference_item", "metadata_visibility": "show", "item_issues_count": "0", "creators": { "item": { "name": { "family": "Yi", "given": "Jeonghee" }, "id": "", "country": "", "affiliation": "Yahoo! Inc." }, "item": { "name": { "family": "Maghoul", "given": "Farzin" }, "id": "", "country": "", "affiliation": "Yahoo! Inc." } }, "track": "Poster Session", "title": "Query Clustering using Click-Through Graph", "ispublished": "pub", "full_text_status": "public", "pres_type": "poster", "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.", "date": "2009-04", "pagerange": "1055-1055", "event_title": "18th International World Wide Web Conference", "event_location": "Madrid, Spain", "event_dates": "April 20th-24th, 2009", "event_type": "conference", "refereed": "TRUE", "documents": { "document": { "docid": "108", "rev_number": "4", "eprintid": "108", "pos": "1", "format": "application/pdf", "language": "en", "security": "public", "main": "p1055.pdf", "content": "published", "files": { "file": { "filename": "p1055.pdf", "filesize": "770104", "url": "http://www2009.eprints.org/108/1/p1055.pdf" } } } } }