Sciweavers

87 search results - page 6 / 18
» Mining Frequent Generalized Itemsets and Generalized Associa...
Sort
View
DAWAK
2010
Springer
13 years 8 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
DEXA
2006
Springer
102views Database» more  DEXA 2006»
13 years 11 months ago
Mining RDF Metadata for Generalized Association Rules
In this paper, we present a novel frequent generalized pattern mining algorithm, called GP-Close, for mining generalized associations from RDF metadata. To solve the overgeneraliz...
Tao Jiang, Ah-Hwee Tan
RCIS
2010
13 years 6 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
JIS
2006
105views more  JIS 2006»
13 years 7 months ago
Automated support specification for efficient mining of interesting association rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules ...
Wen-Yang Lin, Ming-Cheng Tseng
ISCI
2007
99views more  ISCI 2007»
13 years 7 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong