Sciweavers

166 search results - page 12 / 34
» Mining High Utility Itemsets in Big Data
Sort
View
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
15 years 3 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
KES
2008
Springer
14 years 10 months ago
Data Mining for Navigation Generating System with Unorganized Web Resources
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
Diana Purwitasari, Yasuhisa Okazaki, Kenzi Watanab...
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
15 years 10 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
89
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2008
ACM
163views Data Mining» more  KDD 2008»
15 years 10 months ago
The cost of privacy: destruction of data-mining utility in anonymized data publishing
Re-identification is a major privacy threat to public datasets containing individual records. Many privacy protection algorithms rely on generalization and suppression of "qu...
Justin Brickell, Vitaly Shmatikov