Login / Signup

Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix.

Bartosz MakurackiAndrzej Mróz
Published in: Math. Comput. (2021)
Keyphrases
  • positive definite
  • learning algorithm
  • worst case
  • computational complexity
  • k means
  • training set
  • expectation maximization
  • distance metric