Machine learning for non-metric proximity data

This blog provides literature, algorithms and data sets for the analysis of (indefinite) proximity data. In machine learning kernels are given as proximity data. But if the proximity measure is non-metric most kernel approaches are inaccurate or fail. This blog shows ways how to deal with these so called indefinite, non-positive or non-psd proximity data, providing links to literature and algorithms. The final objective is to provide - Probabilistic Models in Pseudo-Euclidean Spaces (ProMoS)

Sunday, 28 May 2017

Accepted paper @ ICANN 2017

New paper proposing indefinite Support Vector Regression will be presented at ICANN 2017
Posted by promos at 07:57 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Featured post

SIAM - AN 22 - Indefinite Large Scale Kernel Approximation To Loose or to Preserve Information?

 Indefinite Large Scale Kernel Approximation To Loose or to Preserve Information? Abstract.   Matrix approximations are a key element in...

Pages

  • Indefinite Learning Overview
  • Benchmarks
  • Links
  • Home

Blog Archive

  • ►  2022 (3)
    • ►  July (3)
  • ►  2018 (1)
    • ►  January (1)
  • ▼  2017 (2)
    • ►  June (1)
    • ▼  May (1)
      • Accepted paper @ ICANN 2017
  • ►  2015 (9)
    • ►  October (1)
    • ►  May (2)
    • ►  April (4)
    • ►  February (1)
    • ►  January (1)
  • ►  2014 (10)
    • ►  December (1)
    • ►  November (1)
    • ►  September (2)
    • ►  June (3)
    • ►  February (3)

About Me

promos
View my complete profile
Simple theme. Powered by Blogger.