✦ LIBER ✦

Improving search engines by query clustering

✍ Scribed by Ricardo Baeza-Yates; Carlos Hurtado; Marcelo Mendoza

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 380 KB
Volume: 58
Category: Article
ISSN: 1532-2882
DOI: 10.1002/asi.20627

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mining Web search engines for query sugg

Mining Web search engines for query suggestion

✍ Zheng Xu; Xiangfeng Luo; Jie Yu; Weimin Xu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

On caching search engine query results

✍ E.P Markatos 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 150 KB

In this paper we explore the problem of Caching of Search Engine Query Results in order to reduce the computing and I/O requirements needed to support the functionality of a search engine of the World Wide Web. We study query traces from the EXCITE search engine and show that they have a significan

Mining search engine query logs for soci

Mining search engine query logs for social filtering-based query recommendation

✍ Zhiyong Zhang; Olfa Nasraoui 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Using clustering methods to improve onto

Using clustering methods to improve ontology-based query term disambiguation

✍ Ernesto William De Luca; Andreas Nürnberger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

In this article we describe results of our research on the disambiguation of user queries using ontologies for categorization. We present an approach to cluster search results by using classes or "Sense Folders" ~prototype categories! derived from the concepts of an assigned ontology, in our case Wo

Analysis of the query logs of a Web site

Analysis of the query logs of a Web site search engine

✍ Michael Chau; Xiao Fang; Olivia R. Liu Sheng 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB 👁 2 views

## Abstract A large number of studies have investigated the transaction log of general‐purpose search engines such as Excite and AltaVista, but few studies have reported on the analysis of search logs for search engines that are limited to particular Web sites, namely, Web site search engines. In t

Improving Greedy Algorithms by Lookahead

Improving Greedy Algorithms by Lookahead-Search

✍ U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. Desarkar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 967 KB

This paper shows that repeated application of a greedy approximation algorithm on some suitably selected subproblems of a problem often leads to a solution which is better than the solution produced by the greedy algorithm applied to the original problem. The lookahead search technique, a polynomial