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)

Wednesday, 22 April 2015

C++ / Armadillo  multicore code for Probabilistic Classification Machine (PCVM) published
see PCVM code
Posted by promos at 05:40
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (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)
  • ▼  2015 (9)
    • ►  October (1)
    • ►  May (2)
    • ▼  April (4)
      • PCVM library code announced at MLOSS
      • PCVM C++/armadillo library 0.2
      • C++ / Armadillo  multicore code for Probabilistic...
      • The paper about Incremental Probabilistic Classif...
    • ►  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.