16 search results - page 1 / 4 » Theoretical Bounds on the Size of Condensed Representations |
KDID
2004
13 years 6 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
CINQ
2004
Springer
13 years 8 months ago
2004
Springer
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...
ECCV
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
KDID
2004
13 years 6 months ago
2004
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...