177 search results - page 2 / 36 » Distributed Discovery of Large Near-Cliques |
PAKDD
2000
ACM
13 years 8 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
ESANN
2000
13 years 6 months ago
2000
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
TSP
2008
13 years 5 months ago
2008
We propose a sequential Monte Carlo (SMC)-based motif discovery algorithm that can efficiently detect motifs in datasets containing a large number of sequences. The statistical di...
FGCS
2007
13 years 5 months ago
2007
The continuous increase of data volumes available from many sources raises new challenges for their effective understanding. Knowledge discovery in large data repositories involv...
FQAS
2004
Springer
13 years 9 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...