Sciweavers

728 search results - page 113 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
PKDD
2007
Springer
95views Data Mining» more  PKDD 2007»
14 years 1 months ago
Pruning Relations for Substructure Discovery of Multi-relational Databases
Multirelational data mining methods discover patterns across multiple interlinked tables (relations) in a relational database. In many large organizations, such a multi-relational ...
Hongyu Guo, Herna L. Viktor, Eric Paquet
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
ICDM
2009
IEEE
102views Data Mining» more  ICDM 2009»
13 years 5 months ago
Global Slope Change Synopses for Measurement Maps
Quality control using scalar quality measures is standard practice in manufacturing. However, there are also quality measures that are determined at a large number of positions on ...
Frank Rosenthal, Ulrike Fischer, Peter Benjamin Vo...
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 7 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...