114 search results - page 9 / 23 » Nonlinear adaptive distance metric learning for clustering |
ICML
2007
IEEE
14 years 8 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...
NIPS
2004
13 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
ICANN
2001
Springer
13 years 12 months ago
2001
Springer
We introduce a simple asset pricing model with two types of adaptively learning traders, fundamentalists and technical traders. Traders update their beliefs according to past perfo...
BMCBI
2011
12 years 11 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
VLSISP
2010
13 years 5 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...