Sciweavers

62 search results - page 6 / 13
» On Nearest-Neighbor Graphs
Sort
View
ALT
2008
Springer
14 years 6 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
ICPR
2006
IEEE
14 years 11 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
CVPR
2006
IEEE
14 years 11 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
NPL
2008
68views more  NPL 2008»
13 years 9 months ago
On Nonparametric Residual Variance Estimation
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
Elia Liitiäinen, Francesco Corona, Amaury Len...