Sciweavers

58 search results - page 11 / 12
» Pushing Tougher Constraints in Frequent Pattern Mining
Sort
View
KDD
1998
ACM
170views Data Mining» more  KDD 1998»
13 years 9 months ago
Mining Audit Data to Build Intrusion Detection Models
In this paper we discuss a data mining framework for constructing intrusion detection models. The key ideas are to mine system audit data for consistent and useful patterns of pro...
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
CINQ
2004
Springer
182views Database» more  CINQ 2004»
13 years 9 months 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, ...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 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...
ICDE
2008
IEEE
154views Database» more  ICDE 2008»
14 years 6 months ago
Butterfly: Protecting Output Privacy in Stream Mining
Abstract-- Privacy preservation in data mining demands protecting both input and output privacy. The former refers to sanitizing the raw data itself before performing mining. The l...
Ting Wang, Ling Liu
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
13 years 11 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...