Clustering integrated fusion model based on the maximum matching problem

DOI10.61091/jcmcc120-21MaRDI QIDQ6586594zbMATH OpenFDO

Authors Huiling Li

Publication date 13 August 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/jcmcc120-21

zbMATH Keywords

feature extractiontext clusteringmaximum weight perfect matchingBert embeddingself-encoder

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• New lower bound on the modularity of Johnson graphs
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Multiple graphs clustering by gradient flow method
• Cluster analysis using triangulation

Cites work

• scientific article; zbMATH DE number 7306876 (Why is no real title available?)
• Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
• On learned operator correction in inverse problems
• Optimal transport driven CycleGAN for unsupervised learning in inverse problems
• Planar graph perfect matching is in NC
• Regularized ensemble Kalman methods for inverse problems

This page was built for publication: Clustering integrated fusion model based on the maximum matching problem

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