Sciweavers

618 search results - page 98 / 124
» Aggregated Subset Mining
Sort
View
KDD
1999
ACM
166views Data Mining» more  KDD 1999»
14 years 23 days ago
CACTUS - Clustering Categorical Data Using Summaries
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
14 years 21 days ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
14 years 11 days ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
BMCBI
2005
163views more  BMCBI 2005»
13 years 8 months ago
Alkahest NuclearBLAST: a user-friendly BLAST management and analysis system
Background -: Sequencing of EST and BAC end datasets is no longer limited to large research groups. Drops in per-base pricing have made high throughput sequencing accessible to in...
Stephen E. Diener, Thomas D. Houfek, Sam E. Kalat,...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 7 hour ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...