Sciweavers

28 search results - page 1 / 6
» A Fast Algorithm for Mining Share-Frequent Itemsets
Sort
View
APWEB
2005
Springer
13 years 10 months ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
13 years 10 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 5 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 5 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
13 years 11 months ago
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun ...