Sciweavers

148 search results - page 7 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 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
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
14 years 1 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
RCIS
2010
13 years 7 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
AUSDM
2007
Springer
131views Data Mining» more  AUSDM 2007»
14 years 2 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
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
14 years 9 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang