EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes

Simple item page
dc.creatorPivovarov, Grigorii
dc.creatorTrunov, Sergei
dc.date2003-08-29
dc.date.accessioned2026-07-07T03:20:16Z
dc.date.available2026-07-07T03:20:16Z
dc.descriptionA 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.
dc.descriptiona kdd cup 2003 submission
dc.identifierhttps://arxiv.org/abs/cs/0308044
dc.identifierhttp://arxiv.org/abs/cs/0308044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31766
dc.subjectData Structures and Algorithms
dc.subjectDigital Libraries
dc.subjectH.3.3
dc.titleEqRank: A Self-Consistent Equivalence Relation on Graph Vertexes
dc.typetext

Files

Collections

arXiv