Sciweavers

1314 search results - page 64 / 263
» Approximate data mining in very large relational data
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 4 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
ICDM
2005
IEEE
272views Data Mining» more  ICDM 2005»
15 years 7 months ago
Mining Patterns of Change in Remote Sensing Image Databases
Remote sensing image databases are the fastest growing archives of spatial information. However, we still have a limited capacity for extracting information from large remote sens...
Marcelino Pereira dos Santos Silva, Gilberto C&aci...
PKDD
2007
Springer
95views Data Mining» more  PKDD 2007»
15 years 7 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
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 2 months ago
Cluster-based concept invention for statistical relational learning
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
Alexandrin Popescul, Lyle H. Ungar
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
15 years 10 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