EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes

Details EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes

2003-08-29

arxiv.org/abs/cs/0308044v1

Computer Science

Data Structures and Algorithms

a kdd cup 2003 submission

Scientific paper

A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes they point to (or vertexes pointing to them) are equivalent. Iterative application of the partitioning yields a hierarchical clustering of graph vertexes. The method is applied to the citation graph of hep-th. The outcome is a two-level classification scheme for the subject field presented in hep-th, and indexing of the papers from hep-th in this scheme. A number of tests show that the classification obtained is adequate.

Affiliated with

Also associated with

No associations

Rating

EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257560