Work

Using Clustering and Blade Clusters in the TeraByte task

Year: 2004
Type: conference-paper
Abstract: Web search engines exploit conjunctive queries and special ranking criteria which differ from the disjunctive queries typically used for ad-hoc retrieval.We wanted to asses the effectiveness of those techniques in the TeraByte task, in particular scoring criteria like: link popularity, proximity boosting, home page score, descriptions and anchor text.Since conjunctive queries sometimes produce low recall, we tested a new approach to query expansion, which extracts additional query terms from a clustering of the snippets from the first query.The technique proved effective, almost doubling the Mean Average Precision.However, the improvement was just enough to compensate for the drop that was introduced, contrary to our expectations, by the proximity boost.For example, a class for describing a Web page may look like this: class Page {
Authors: Giuseppe Attardi, Andrea Esuli, Chirag Patel
Language: English
Open Access status: green
OpenAlex ID: W1505223651
FWCI: 0.491
Cites: 11
Cited by: 2
Related to: 10