Adaptive-order proximity learning for graph-based clustering

摘要

•This work firstly points out the mismatched problem between the first-order proximity matrix and the groundtruth.•This work introduce the high-order proximity to structured proximity matrix learning.•This work adaptively uses the proximity matrices of appropriate orders.•This work proposes an efficient algorithm to solve the models.•This work is extensible and can generate many models.