97 search results - page 1 / 20 » Learning to combine distances for complex representations |
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
MCS
2001
Springer
13 years 8 months ago
2001
Springer
For learning purposes, representations of real world objects can be built by using the concept of dissimilarity (distance). In such a case, an object is characterized in a relative...
MCS
2000
Springer
13 years 7 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
AMR
2007
Springer
13 years 10 months ago
2007
Springer
This paper gives an overview of recent approaches towards image representation and image similarity computation for content-based image retrieval and automatic image annotation (ca...