Sciweavers

28 search results - page 3 / 6
» A Fast Algorithm for Mining Share-Frequent Itemsets
Sort
View
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
13 years 11 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
SAC
2006
ACM
13 years 11 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 9 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
CIVR
2006
Springer
104views Image Analysis» more  CIVR 2006»
13 years 9 months ago
Video Mining with Frequent Itemset Configurations
Abstract. We present a method for mining frequently occurring objects and scenes from videos. Object candidates are detected by finding recurring spatial arrangements of affine cov...
Till Quack, Vittorio Ferrari, Luc J. Van Gool
KES
2004
Springer
13 years 11 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran