EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes

G. Pivovarov and S. Trunov. Eqrank: A self-consistent equivalence relation on graph vertexes. ACM SIGKDD Explorations, 5(2):185–190, 2003. [url]


This paper presents a new method for hierarchical clustering of directed graph. The authors tried to answer the following research question: do there exist nontrivial hierarchical graph clustering that would be uniquely determined by the graph structure?

They answer the question proposing a new algorithm, called EqRank that is tested to cluster scientific papers. Results seems to confirm the idea that graph based method can be used concurrently to canonical LSI methods, reducing drammatically the computational load required to achieve the clustering.

Tags: ,

Leave a Reply