Fine-grained complexity analysis of some combinatorial data science problems

DOI10.14279/DEPOSITONCE-7123MaRDI QIDQ6631303zbMATH OpenFDO

Authors Vincent Froese

Publication date 1 November 2024

Published in Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-7123

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09) Analysis of algorithms (68W40)

Recommendations

• A parameterized complexity analysis of combinatorial feature selection problems
• Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets
• Parameterized Complexity of Feature Selection for Categorical Data Clustering.
• On the complexity of multi-parameterized cluster editing

Cited in

(2)

• Cluster editing parameterized above modification-disjoint P₃-packings
• Cluster editing parameterized above modification-disjoint P₃-Packings

This page was built for publication: Fine-grained complexity analysis of some combinatorial data science problems

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