Sciweavers

4886 search results - page 88 / 978
» Approximate Data Exchange
Sort
View
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
15 years 6 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
RSCTC
2004
Springer
237views Fuzzy Logic» more  RSCTC 2004»
15 years 10 months ago
An Automated Multi-spectral MRI Segmentation Algorithm Using Approximate Reducts
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
Sebastian Widz, Kenneth Revett, Dominik Slezak
NPL
2006
100views more  NPL 2006»
15 years 4 months ago
Constrained Projection Approximation Algorithms for Principal Component Analysis
Abstract. In this paper we introduce a new error measure, integrated reconstruction error (IRE) and show that the minimization of IRE leads to principal eigenvectors (without rotat...
Seungjin Choi, Jong-Hoon Ahn, Andrzej Cichocki
JEA
2008
112views more  JEA 2008»
15 years 4 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