Title: A fuzzy Markovian model for graph-based clustering

Authors: Parthajit Roy; J.K. Mandal

Addresses: Department of Computer Science, The University of Burdwan, Burdwan, West Bengal, 713104, India ' Department of Computer Science and Engineering, University of Kalyani, Nadia, West Bengal, 741235, India

Abstract: Graph works well as a random walk model which is a key concept in clustering. The Markov chain model mainly simulates flow in a graph. This paper proposes a random walk-based Markov chain clustering model on bipartite graph. A randomly generated point-based bipartite graph from the spatial data points has been created for this purpose. Proximity among data points has been computed based on the novel fuzzy correlation method and dense subgraphs are formed for random walk to work. Standard Markov flow-based clustering has been applied on the final similarity matrix. The model has been tested with standard datasets and the result has been compared with that of other benchmark models.

Keywords: Markov chain; graph clustering; fuzzy measures; random walk; bipartite graphs; modelling.

DOI: 10.1504/IJCSYSE.2015.077055

International Journal of Computational Systems Engineering, 2015 Vol.2 No.2, pp.98 - 106

Received: 05 Aug 2015
Accepted: 03 Nov 2015
Published online: 20 Jun 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article