Sciweavers

1215 search results - page 190 / 243
» Numbers in Multi-relational Data Mining
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 days ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
15 years 9 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
15 years 5 months ago
How Bayesians Debug
Manual debugging is expensive. And the high cost has motivated extensive research on automated fault localization in both software engineering and data mining communities. Fault l...
Chao Liu 0001, Zeng Lian, Jiawei Han
CIDM
2009
IEEE
15 years 3 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
CIKM
2008
Springer
15 years 1 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao