Sciweavers

262 search results - page 22 / 53
» Generalized Closed Itemsets for Association Rule Mining
Sort
View
141
Voted
ISI
2007
Springer
15 years 8 months ago
Mining Higher-Order Association Rules from Distributed Named Entity Databases
The burgeoning amount of textual data in distributed sources combined with the obstacles involved in creating and maintaining central repositories motivates the need for effective ...
Shenzhi Li, Christopher D. Janneck, Aditya P. Bela...
122
Voted
ISCI
2007
99views more  ISCI 2007»
15 years 1 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
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
13 years 4 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
DKE
2002
218views more  DKE 2002»
15 years 1 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
15 years 7 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