Sciweavers

160 search results - page 10 / 32
» Mining frequent geographic patterns with knowledge constrain...
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 7 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
DAWAK
2006
Springer
13 years 10 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 6 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 8 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...
DAWAK
2003
Springer
13 years 12 months ago
Comprehensive Log Compression with Frequent Patterns
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
Kimmo Hätönen, Jean-François Boul...