Sciweavers

4560 search results - page 23 / 912
» Finding Data in the Neighborhood
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
A General Framework for Searching in Distributed Data Repositories
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital lib...
Spiridon Bakiras, Panos Kalnis, Thanasis Loukopoul...
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
13 years 11 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren
ISMIR
2004
Springer
106views Music» more  ISMIR 2004»
14 years 1 months ago
Finding Approximate Repeating Patterns from Sequence Data
In this paper, an application of feature extraction from music data is first introduced to motivate our research of finding approximate repeating patterns from sequence data. An a...
Jia-Lien Hsu, Arbee L. P. Chen, Hung-Chen Chen
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 9 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar