Sciweavers

1314 search results - page 83 / 263
» Approximate data mining in very large relational data
Sort
View
ML
2006
ACM
15 years 1 months ago
Relational IBL in classical music
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
Asmir Tobudic, Gerhard Widmer
101
Voted
JEA
2008
112views more  JEA 2008»
15 years 1 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 2 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 4 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
KES
2008
Springer
15 years 1 months ago
An Algorithm to Assess the Reliability of Hierarchical Clusters in Gene Expression Data
The validation of clusters discovered in bio-molecular data is a central issue in bioinformatics. Recently, stability-based methods have been successfully applied to the analysis o...
Roberto Avogadri, Matteo Brioschi, Francesca Ruffi...