Sciweavers

618 search results - page 82 / 124
» Aggregated Subset Mining
Sort
View
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
15 years 9 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
15 years 6 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
15 years 6 months ago
Evaluation Measures for Multi-class Subgroup Discovery
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been...
Tarek Abudawood, Peter Flach
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
15 years 6 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
ICDM
2007
IEEE
139views Data Mining» more  ICDM 2007»
15 years 6 months ago
Data Clustering with a Relational Push-Pull Model
We present a new generative model for relational data in which relations between objects can have either a binding or a separating effect. For example, in a group of students sep...
Adam Anthony, Marie desJardins