Multiple graphs clustering by gradient flow method

DOI10.1016/j.jfranklin.2017.07.001zbMath1395.62181OpenAlexW2734661132MaRDI QIDQ1661459

Chuan Chen, Hong Zhu, Li-Zhi Liao, Michael Kwok-Po Ng

Publication date: 16 August 2018

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2017.07.001

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths ⋮ Transductive semantic knowledge graph propagation for zero-shot learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Graph clustering
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Two-Point Step Size Gradient Methods
• Clustering With Multi-Layer Graphs: A Spectral Perspective
• Gradient algorithms for principal component analysis
• Block spectral clustering methods for multiple graphs
• On Clustering on Graphs with Multiple Edge Types

This page was built for publication: Multiple graphs clustering by gradient flow method