Sciweavers

110 search results - page 3 / 22
» A Foundational Approach to Mining Itemset Utilities from Dat...
Sort
View
VLDB
2000
ACM
130views Database» more  VLDB 2000»
13 years 8 months ago
Mining Frequent Itemsets Using Support Constraints
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
Ke Wang, Yu He, Jiawei Han
ISDA
2008
IEEE
13 years 11 months ago
Novel Algorithms for Privacy Preserving Utility Mining
Privacy Preserving Data Mining (PPDM) has become a popular topic in the research community. How to strike a balance between privacy protection and knowledge discovery in the shari...
Jieh-Shan Yeh, Po-Chiang Hsu, Ming-Hsun Wen
RCIS
2010
13 years 3 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 5 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 5 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho