Sciweavers

144 search results - page 18 / 29
» Mining Incremental Association Rules with Generalized FP-Tre...
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 9 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
RAID
1999
Springer
14 years 25 days ago
Combining Knowledge Discovery and Knowledge Engineering to Build IDSs
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
Wenke Lee, Salvatore J. Stolfo
WWW
2007
ACM
14 years 9 months ago
Mirror site maintenance based on evolution associations of web directories
Mirroring Web sites is a well-known technique commonly used in the Web community. A mirror site should be updated frequently to ensure that it reflects the content of the original...
Ling Chen 0002, Sourav S. Bhowmick, Wolfgang Nejdl
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb