214 search results - page 12 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
FIMI
2004
13 years 8 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
AUSAI
2003
Springer
14 years 19 days ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
CINQ
2004
Springer
14 years 24 days ago
2004
Springer
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
SIGMOD
2010
ACM
14 years 6 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
ADBIS
1998
Springer
13 years 11 months ago
1998
Springer
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...