Sciweavers

1599 search results - page 128 / 320
» Theoretical Frameworks for Data Mining
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 7 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
KAIS
2007
75views more  KAIS 2007»
14 years 9 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
15 years 4 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
KDD
2005
ACM
171views Data Mining» more  KDD 2005»
15 years 10 months ago
Application of kernels to link analysis
Abstract. The application of kernel methods to link analysis is explored. We argue that a family of kernels on graphs provides a unified perspective on the three measures proposed ...
Takahiko Ito, Masashi Shimbo, Taku Kudo, Yuji Mats...