Sciweavers

1301 search results - page 37 / 261
» Default Clustering from Sparse Data Sets
Sort
View
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 8 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
ICANN
2003
Springer
14 years 1 months ago
Sparse Coding with Invariance Constraints
We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set...
Heiko Wersing, Julian Eggert, Edgar Körner
ICDM
2006
IEEE
86views Data Mining» more  ICDM 2006»
14 years 2 months ago
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuiti...
Byron J. Gao, Martin Ester
BMCBI
2011
13 years 3 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
CVPR
2011
IEEE
13 years 4 months ago
Sparse Image Representation with Epitomes
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
Louise Benoit, Julien Mairal, Francis Bach, Jean P...