Sciweavers

573 search results - page 17 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
DAWAK
2006
Springer
13 years 11 months ago
Two New Techniques for Hiding Sensitive Itemsets and Their Empirical Evaluation
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
Ahmed HajYasien, Vladimir Estivill-Castro
ADC
2006
Springer
169views Database» more  ADC 2006»
14 years 1 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
14 years 1 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
CIDM
2007
IEEE
14 years 2 months ago
Measuring the Validity of Document Relations Discovered from Frequent Itemset Mining
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
Kritsada Sriphaew, Thanaruk Theeramunkong
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
14 years 1 months ago
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. ...
Robert Jäschke, Andreas Hotho, Christoph Schm...