A fuzzy Markovian model for graph-based clustering
by Parthajit Roy; J.K. Mandal
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 2, No. 2, 2015

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.

Online publication date: Mon, 20-Jun-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Systems Engineering (IJCSYSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com