Sciweavers

4085 search results - page 766 / 817
» Benchmarking Data Mining Algorithms
Sort
View
WWW
2005
ACM
14 years 9 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
IUI
2005
ACM
14 years 2 months ago
Building intelligent shopping assistants using individual consumer models
This paper describes an Intelligent Shopping Assistant designed for a shopping cart mounted tablet PC that enables individual interactions with customers. We use machine learning ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
WWW
2002
ACM
14 years 9 months ago
Probabilistic query expansion using query logs
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma
CIKM
2005
Springer
14 years 2 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
SAC
2004
ACM
14 years 2 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo