Igher density graphs tend to have more structural variation and therefore

De March of History
Révision de 28 mars 2018 à 08:36 par Quart5lathe (discussion | contributions) (Page créée avec « Both show pretty powerful correlation, indicating Iceberg-RoleSim's incredibly good [http://hs21.cn/comment/html/?296436.html Ollowing principle: "two nodes are related if... »)

(diff) ← Version précédente | Voir la version courante (diff) | Version suivante → (diff)
Aller à : navigation, rechercher

Both show pretty powerful correlation, indicating Iceberg-RoleSim's incredibly good Ollowing principle: "two nodes are related if they link to comparable accuracy at ranking role-similarity pairs. Subsequent we fixed at 0.9 and varied from 0 to 1.0 to view how sensitive would be the accuracy of Iceberg RoleSim with respect to . The outcomes from six scale-free graphs are shown in Figure 10. The labels title= journal.pone.0158471 describe the number of nodes and edges of every graph. Most graphs favor = 0, but some prefer a midrange worth. Any worth inside the reduce half seems acceptable. 6.six. Case Study: Coauthor SimilarityNIH-PA Author Manuscript NIH-PA Author Manuscript NIH-PA Author ManuscriptTo greater illustrate the role similarity ranking capability of RoleSim we performed the following case study. We generated the coauthor network by taking all publications for SIGMOD, VLDB, ICDE, KDD, ICDM, and SDM from 2006 to 2011, as extracted from the DBLP database [Ley et al. 2012]. The resulting network contains 7072 nodes with 18994 edges. We computed the node similarity for all pairs of nodes employing 4 algorithms (Iceberg RoleSim, SimRank, SimRank++, and PageSim). Case Study: Coauthor SimilarityNIH-PA Author Manuscript NIH-PA Author Manuscript NIH-PA Author ManuscriptTo superior illustrate the role similarity ranking capability of RoleSim we performed the following case study. We generated the coauthor network by taking all publications for SIGMOD, VLDB, ICDE, KDD, ICDM, and SDM from 2006 to 2011, as extracted from the DBLP database [Ley et al. 2012]. The resulting network consists of 7072 nodes with 18994 edges. We computed the node similarity for all pairs of nodes applying 4 algorithms (Iceberg RoleSim, SimRank, SimRank++, and PageSim). Then, to get a offered focal author, we found the 10 other authors that had been most equivalent. We then employed both G-index and H-index scores, obtained from the Microsoft Academic Search database [Microsoft Research 2012], as candidate measures of coauthorship role. If a particular similarity measure is often a superior role measure, then the ten other authors should really usually have roles similar to that from the focal author, as measured by G- and H-indices. For instance, we used Jaiwan Hei as our very first focal author, who includes a G-index score of 162. Our final results are summarized in Table VI. Iceberg RoleSim discovered other high G-index authors, such as Philip Yu and Christos Faloutos. All ten had high G-index and H-index scores. SimRank and SimRank++, on the other hand, discovered mainly low index authors. Since SimRank++ usually performed superior than SimRank, our tables show only the SimRank++ benefits. PageSim did a bit far better. Its list involves a couple of robust authors, but most of the top rated 10 had been also low G-index authors. We performed the same test for two other focal authors: Xifeng Yan, with G-index of 55 (Table VII), and Xiaolei Li, with G-index of 23 (Table VIII). Again, RoleSim was successful at obtaining title= oncotarget.11040 authors with title= ymj.2016.57.6.1427 equivalent prestige, whilst the other algorithms weren't.7. CONCLUSIONWe have created RoleSim, the very first real-valued part similarity measure that confirms automorphic equivalence. We have also presented a set of axioms which can test any future measure to determine if it truly is an admissible measure or metric.