Sciweavers

16844 search results - page 3238 / 3369
» How to Design Programs
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 6 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 6 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 6 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
16 years 6 months ago
Detection of emerging space-time clusters
We propose a new class of spatio-temporal cluster detection methods designed for the rapid detection of emerging space-time clusters. We focus on the motivating application of pro...
Daniel B. Neill, Andrew W. Moore, Maheshkumar Sabh...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 6 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
« Prev « First page 3238 / 3369 Last » Next »