A Faster Subquadratic Algorithm for Finding Outlier Correlations

DOI10.1137/1.9781611974331.CH90MaRDI QIDQ4575671zbMATH OpenOpenAlexFDO

Authors Matti Karppa, Petteri Kaski, Jukka Kohonen

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

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

Recommendations

• A faster subquadratic algorithm for finding outlier correlations
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
• scientific article; zbMATH DE number 6846423
• Finding multivariate outliers with FastPCS
• Fast sketch-based recovery of correlation outliers
• scientific article; zbMATH DE number 1934540

Cited in

(9)

• Fast sketch-based recovery of correlation outliers
• scientific article; zbMATH DE number 6846423 (Why is no real title available?)
• A faster subquadratic algorithm for finding outlier correlations
• A new algorithm for finding closest pair of vectors (extended abstract)
• An illuminating algorithm for the light bulb problem
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
• scientific article; zbMATH DE number 7250154 (Why is no real title available?)
• A new coding-based algorithm for finding closest pair of vectors
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575671)