Sciweavers

Share
28 search results - page 2 / 6
» A Fast Algorithm for Mining Share-Frequent Itemsets
Sort
View
APPINF
2003
13 years 1 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 2 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satis´Čüability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
DAWAK
2010
Springer
12 years 9 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey
KAIS
2006
164views more  KAIS 2006»
12 years 11 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
IDEAL
2004
Springer
13 years 5 months ago
PRICES: An Efficient Algorithm for Mining Association Rules
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
Chuan Wang, Christos Tjortjis
books