Sciweavers

489 search results - page 69 / 98
» Query Selectivity Estimation via Data Mining
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Exploring relevance for clicks
Mining feedback information from user click-through data is an important issue for modern Web retrieval systems in terms of architecture analysis, performance evaluation and algor...
Rongwei Cen, Yiqun Liu, Min Zhang, Bo Zhou, Liyun ...
89
Voted
KDD
2005
ACM
135views Data Mining» more  KDD 2005»
16 years 4 days ago
A hybrid unsupervised approach for document clustering
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
Mihai Surdeanu, Jordi Turmo, Alicia Ageno
DATAMINE
2006
127views more  DATAMINE 2006»
14 years 11 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
SIGMOD
2008
ACM
210views Database» more  SIGMOD 2008»
15 years 12 months ago
Private queries in location based services: anonymizers are not necessary
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, C...
CIKM
1999
Springer
15 years 4 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...