Sciweavers

5463 search results - page 325 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
IDEAL
2005
Springer
16 years 2 days ago
Probabilistic Data Generation for Deduplication and Data Linkage
Abstract. In many data mining projects the data to be analysed contains personal information, like names and addresses. Cleaning and preprocessing of such data likely involves dedu...
Peter Christen
SMC
2010
IEEE
139views Control Systems» more  SMC 2010»
15 years 4 months ago
Pin-pointing concept descriptions
In this study, the task of obtaining accurate and comprehensible concept descriptions of a specific set of production instances has been investigated. The suggested method, inspire...
Cecilia Sönströd, Ulf Johansson, Henrik ...
ECML
2006
Springer
15 years 10 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
ILP
2003
Springer
15 years 11 months ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer