Sciweavers

296 search results - page 35 / 60
» Privacy-preserving algorithms for distributed mining of freq...
Sort
View
AAAI
2006
13 years 10 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 12 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
CIKM
2006
Springer
14 years 23 days ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 10 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 10 months ago
Scrutinizing Frequent Pattern Discovery Performance
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
Mohammad El-Hajj, Osmar R. Zaïane, Stella Luk...