Abstract

A new method of hierarchical clustering of graph vertexes is suggested. The method is motivated by applications to searches of scientific papers in electronic libraries (in these applications, the clustered graph is the citation graph). In the method, the graph partition is determined with an equivalence relation. Iterative application of the partitioning yields a hierarchical clustering of graph vertexes. The method is applied to the citation graph of hep-th, which is an electronic archive of papers on theoretical high energy physics at http://xxx.lanl.gov. 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call