55 search results - page 2 / 11 » MAFIA: A Maximal Frequent Itemset Algorithm for Transactiona... |
170
click to vote
IEAAIE
2009
Springer
15 years 9 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
144
click to vote
DIS
2006
Springer
15 years 7 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
119
click to vote
ICTAI
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
136
click to vote
FIMI
2004
15 years 4 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 ...
115
click to vote
PODS
2004
ACM
16 years 3 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...