Sciweavers

680 search results - page 2 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
APPINF
2003
13 years 8 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
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 1 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 8 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 7 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 1 months ago
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
Alva Erwin, Raj P. Gopalan, N. R. Achuthan