Sciweavers

55 search results - page 3 / 11
» MAFIA: A Maximal Frequent Itemset Algorithm for Transactiona...
Sort
View
KAIS
2006
164views more  KAIS 2006»
13 years 6 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
DAWAK
2004
Springer
13 years 11 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
RCIS
2010
13 years 4 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
14 years 11 days ago
Two-Phase Algorithms for a Novel Utility-Frequent Mining Model
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
Jieh-Shan Yeh, Yu-Chiang Li, Chin-Chen Chang
ACTA
2007
85views more  ACTA 2007»
13 years 6 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders