Multiple graphs clustering by gradient flow method

DOI10.1016/J.JFRANKLIN.2017.07.001MaRDI QIDQ1661459zbMATH OpenOpenAlexFDO

Authors Hong Zhu, Chuan Chen, Li-Zhi Liao, Michael 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)

Recommendations

• Block spectral clustering methods for multiple graphs.
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
• Latent Clustering on Graphs with Multiple Edge Types
• Implicit consensus clustering from multiple graphs
• On clustering on graphs with multiple edge types

Cites work

• scientific article; zbMATH DE number 53595 (Why is no real title available?)
• scientific article; zbMATH DE number 1324524 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• scientific article; zbMATH DE number 3189460 (Why is no real title available?)
• A feasible method for optimization with orthogonality constraints
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• A tensor approach to learning mixed membership community models
• Block spectral clustering methods for multiple graphs.
• Clustering With Multi-Layer Graphs: A Spectral Perspective
• Gradient algorithms for principal component analysis
• Graph clustering
• On clustering on graphs with multiple edge types
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Two-Point Step Size Gradient Methods

Cited in

(8)

• Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths
• Dynamic graph clustering combining modularity and smoothness
• Clustering integrated fusion model based on the maximum matching problem
• Moving Up the Cluster Tree with the Gradient Flow
• Transductive semantic knowledge graph propagation for zero-shot learning
• Latent Clustering on Graphs with Multiple Edge Types
• Block spectral clustering methods for multiple graphs.
• Implicit consensus clustering from multiple graphs

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

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