Sciweavers

28 search results - page 4 / 6
» A Fast Algorithm for Mining Share-Frequent Itemsets
Sort
View
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
13 years 10 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
14 years 18 days ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
FLAIRS
2003
13 years 7 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 7 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
FIMI
2004
123views Data Mining» more  FIMI 2004»
13 years 7 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