EqRank:图顶点上的自洽等价关系
EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes
摘要:
提出了一种新的图的层次聚类方法。在该方法中,图的划分是由满足递归定义的等价关系确定的,该递归定义规定,如果顶点指向的顶点(或指向它们的顶点)是等价的,则顶点是等价的。分区的迭代应用产生图顶点的层次聚类。并将该方法应用于hep-th的引文图。结果是一个两级分类方案的主题领域提出的hep-th,和索引的论文从hep-th在这个计划。一些测试表明,所获得的分类是足够的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。