Sciweavers

262 search results - page 4 / 53
» Generalized Closed Itemsets for Association Rule Mining
Sort
View
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
13 years 12 months 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
CORR
2010
Springer
279views Education» more  CORR 2010»
13 years 5 months ago
Mining Frequent Itemsets Using Genetic Algorithm
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
Soumadip Ghosh, Sushanta Biswas, Debasree Sarkar, ...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
13 years 11 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 7 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...
ICEIS
2009
IEEE
14 years 12 days ago
NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
Rafael Garcia Miani, Cristiane A. Yaguinuma, Maril...