2512 search results - page 2 / 503 » Learning from Highly Structured Data by Decomposition |
EMMCVPR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which on...
SGAI
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents the results of an investigation into the use of machine learning methods for the identification of narcotics from Raman spectra. The classification of spectr...
ML
2006
ACM
13 years 5 months ago
2006
ACM
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...
DAGSTUHL
2009
13 years 6 months ago
2009
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...