Sciweavers

91 search results - page 14 / 19
» Mining frequent item sets by opportunistic projection
Sort
View
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
KDD
1998
ACM
170views Data Mining» more  KDD 1998»
13 years 12 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
ICSE
2004
IEEE-ACM
14 years 7 months ago
Mining Version Histories to Guide Software Changes
We apply data mining to version histories in order to guide programmers along related changes: "Programmers who changed these functions also changed...." Given a set of e...
Andreas Zeller, Peter Weißgerber, Stephan Di...
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 29 days ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri