A Random Walk Approach to Query Informative Constraints for Clustering

作者：Abin Ahmad Ali^*

来源：IEEE Transactions on Cybernetics, 2018, 48(8): 2272-2283.

DOI：10.1109/TCYB.2017.2731868

• Commute time
• constrained clustering
• constraint selection
• pairwise constraints
• random walk

This paper presents a random walk approach to the problem of querying informative constraints for clustering. The proposed method is based on the properties of the commute time, that is the expected time taken for a random walk to travel between two nodes and return, on the adjacency graph of data. Commute time has the nice property of that, the more short paths connect two given nodes in a graph, the more similar those nodes are. Since computing the commute time takes the Laplacian eigenspectrum into account, we use this property in a recursive fashion to query informative constraints for clustering. At each recursion, the proposed method constructs the adjacency graph of data and utilizes the spectral properties of the commute time matrix to bipartition the adjacency graph. Thereafter, the proposed method benefits from the commute times distance on graph to query informative constraints between partitions. This process iterates for each partition until the stop condition becomes true. Experiments on real-world data show the efficiency of the proposed method for constraints selection.

• 出版日期2018-8