Sciweavers

352 search results - page 44 / 71
» Non-derivable itemset mining
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 10 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
ICCS
2004
Springer
14 years 28 days ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
FIMI
2004
123views Data Mining» more  FIMI 2004»
13 years 9 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
ICA3PP
2005
Springer
14 years 1 months ago
Mining Traces of Large Scale Systems
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Christophe Cérin, Michel Koskas
KDD
2002
ACM
214views Data Mining» more  KDD 2002»
14 years 8 months ago
Privacy preserving association rule mining in vertically partitioned data
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
Jaideep Vaidya, Chris Clifton