Sciweavers

155 search results - page 19 / 31
» An efficient algorithm for mining closed inter-transaction i...
Sort
View
FIMI
2004
123views Data Mining» more  FIMI 2004»
14 years 11 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
FIMI
2004
172views Data Mining» more  FIMI 2004»
14 years 11 months ago
AIM2: Improved implementation of AIM
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
Sagi Shporer
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
15 years 3 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
ICCS
2003
Springer
15 years 2 months ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
15 years 1 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...