Sciweavers

1215 search results - page 54 / 243
» Numbers in Multi-relational Data Mining
Sort
View
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
15 years 5 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
DAWAK
2004
Springer
15 years 5 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
ISCI
2007
99views more  ISCI 2007»
14 years 11 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
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 6 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 4 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin