Sciweavers

587 search results - page 45 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
AINA
2007
IEEE
15 years 6 months ago
A Semi-Automatic Framework for Mining ERP Patterns
Event-related potentials (ERP) are brain electrophysiological patterns created by averaging electroencephalographic (EEG) data, time-locking to events of interest (e.g., stimulus ...
Jiawei Rong, Dejing Dou, Gwen A. Frishkoff, Robert...
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 7 days 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
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 days ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 7 days ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
14 years 10 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...