A Faster Subquadratic Algorithm for Finding Outlier Correlations

DOI10.1137/1.9781611974331.ch90zbMath1410.68371OpenAlexW2892390787MaRDI QIDQ4575671

Petteri Kaski, Jukka Kohonen, Matti Karppa

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch90

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Measures of association (correlation, canonical correlation, etc.) (62H20) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (4)

Unnamed Item ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Unnamed Item

This page was built for publication: A Faster Subquadratic Algorithm for Finding Outlier Correlations