Sciweavers

CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 8 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
13 years 9 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
CINQ
2004
Springer
131views Database» more  CINQ 2004»
13 years 10 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ICDM
2006
IEEE
113views Data Mining» more  ICDM 2006»
13 years 10 months ago
Mining Maximal Generalized Frequent Geographic Patterns with Knowledge Constraints
In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without assoc...
Vania Bogorny, João Francisco Valiati, Sand...