Sciweavers

399 search results - page 41 / 80
» Log Mining to Improve the Performance of Site Search
Sort
View
WWW
2001
ACM
16 years 6 months ago
Learning search engine specific query transformations for question answering
We introduce a method for learning query transformations that improves the ability to retrieve answers to questions from an information retrieval system. During the training stage...
Eugene Agichtein, Steve Lawrence, Luis Gravano
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
16 years 29 days ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
ICWE
2004
Springer
15 years 11 months ago
SIE - Intelligent Web Proxy Framework
In this paper we would like to present and describe SIE, a transparent, intelligent Web proxy framework. Its aim is to provide efficient and robust platform for implementing vari...
Grzegorz Andruszkiewicz, Krzysztof Ciebiera, Marci...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
16 years 3 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...