Parameterized complexity of feature selection for categorical data clustering

DOI10.1145/3604797MaRDI QIDQ7022852zbMATH OpenFDO

Authors Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov

Publication date 24 February 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3604797

zbMATH Keywords

hypergraph enumerationlow-rank approximationPCArobust clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Parameterized complexity, tractability and kernelization (68Q27) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A PTAS for ℓ_p-Low Rank Approximation
• Approximation Schemes for Low-rank Binary Matrix Approximation Problems
• Closest Substring Problems with Small Distances
• Color-coding
• Dimensionality reduction for k-means clustering and low rank approximation
• Fundamentals of parameterized complexity
• Generalized principal component analysis
• Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
• scientific article; zbMATH DE number 2101402 (Why is no real title available?)
• Low rank approximation in the presence of outliers
• Matrix Rigidity from the Viewpoint of Parameterized Complexity
• Parameterized \(k\)-clustering: tractability island
• Parameterized algorithms
• Parameterized Intractability of Even Set and Shortest Vector Problem
• Parameterized low-rank binary matrix approximation
• Polynomial-time approximation schemes for geometric min-sum median clustering
• Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
• Robust principal component analysis?
• Which problems have strongly exponential complexity?

This page was built for publication: Parameterized complexity of feature selection for categorical data clustering

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