Sciweavers

165 search results - page 16 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 9 months 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...
CINQ
2004
Springer
182views Database» more  CINQ 2004»
14 years 25 days ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
DEXAW
2005
IEEE
96views Database» more  DEXAW 2005»
14 years 2 months ago
Mining Complex Patterns from Protein Surfaces
In the domain of bioinformatics, the role played in the biological process by proteins, that act as transmitters and receivers of information thus ruling the mechanisms that deter...
Lorenzo Baldacci, Matteo Golfarelli
DAWAK
2010
Springer
13 years 10 months ago
Frequent Sub-graph Mining on Edge Weighted Graphs
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
Chuntao Jiang, Frans Coenen, Michele Zito
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 10 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin