Sciweavers

87 search results - page 1 / 18
» Mining Frequent Generalized Itemsets and Generalized Associa...
Sort
View
JCST
2008
119views more  JCST 2008»
13 years 5 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
13 years 10 months ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
DEXA
2004
Springer
153views Database» more  DEXA 2004»
13 years 10 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
ICEIS
2009
IEEE
13 years 11 months 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...