Sciweavers

4560 search results - page 168 / 912
» Finding Data in the Neighborhood
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
DAGSTUHL
2004
13 years 9 months ago
Learning with Local Models
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
Stefan Rüping
ESANN
2004
13 years 9 months ago
Using Andrews Curves for Clustering and Sub-clustering Self-Organizing Maps
Abstract. The use of self-organizing maps to analyze data often depends on finding effective methods to visualize the SOM's structure. In this paper we propose a new way to pe...
Cesar García-Osorio, Jesús Maudes, C...
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
14 years 8 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
CVPR
2006
IEEE
14 years 10 months ago
An Integrated Segmentation and Classification Approach Applied to Multiple Sclerosis Analysis
We present a novel multiscale approach that combines segmentation with classification to detect abnormal brain structures in medical imagery, and demonstrate its utility in detect...
Ayelet Akselrod-Ballin, Meirav Galun, Ronen Basri,...