Theory and Algorithm for Learning with Dissimilarity Functions

DOI10.1162/neco.2008.08-06-805zbMath1178.68476OpenAlexW2130553489WikidataQ51796947 ScholiaQ51796947MaRDI QIDQ3628019

Kohei Hatano, Masashi Sugiyama, Jufu Feng, Cheng Yang, Liwei Wang

Publication date: 19 May 2009

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2008.08-06-805

zbMATH Keywords

DBoostDBoost algorithmdissimilarity-based boosting

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items

Indefinite Proximity Learning: A Review, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels as features: on kernels, margins, and low-dimensional mappings
• A theory of learning with similarity functions
• Improving predictive inference under covariate shift by weighting the log-likelihood function
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Improved boosting algorithms using confidence-rated predictions
• Handbook of Fingerprint Recognition
• Dissimilarity representations allow for building good classifiers
• How Good Is a Kernel When Used as a Similarity Measure?
• Nearest neighbor pattern classification