scientific article; zbMATH DE number 6846423

DOI10.4230/LIPICS.ESA.2016.52MaRDI QIDQ4606323zbMATH OpenFDO

Authors Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin

Publication date 2 March 2018

Full work available at URL https://arxiv.org/abs/1606.05608

zbMATH Keywords

correlationderandomizationexpander graphoutliersimilarity search

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20)

Recommendations

• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
• A Faster Subquadratic Algorithm for Finding Outlier Correlations
• A faster subquadratic algorithm for finding outlier correlations
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
• Fast sketch-based recovery of correlation outliers
• Approximation algorithm for min-max correlation clustering problem with outliers
• scientific article; zbMATH DE number 1934540
• Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling

Cited in

(6)

• An elementary analysis of the probability that a binomial random variable exceeds its expectation
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
• A new coding-based algorithm for finding closest pair of vectors
• A faster subquadratic algorithm for finding outlier correlations
• A Faster Subquadratic Algorithm for Finding Outlier Correlations
• A non-trivial algorithm enumerating relevant features over finite fields

This page was built for publication:

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