Explainable graph clustering via expanders in the massively parallel computation model

DOI10.1016/J.INS.2024.120897MaRDI QIDQ6564936zbMATH OpenFDO

Authors Sepideh Aghamolaei, Mohammad Ghodsi

Publication date 1 July 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.120897

zbMATH Keywords

fixed-parameter algorithmsexpander graphsmassively parallel computationDBSCANexplainable clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems
• Near-optimal clustering in the \(k\)-machine model
• scientific article; zbMATH DE number 2089226
• Partitioning well-clustered graphs: spectral clustering works!
• On clustering and interpreting with rules by means of mathematical optimization

Cites work

• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A 1.5-approximation for path TSP
• Communication steps for parallel query processing
• On the computational complexity of MapReduce
• Parameterized algorithms

This page was built for publication: Explainable graph clustering via expanders in the massively parallel computation model

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