Sciweavers

13827 search results - page 2472 / 2766
» The state of artificial intelligence
Sort
View
182
Voted
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 8 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
207
Voted
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
205
Voted
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 8 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
« Prev « First page 2472 / 2766 Last » Next »