ASCOS++: An asymmetric similarity measure for weighted networks to address the problem of SimRank

Hung Hsuan Chen, C. Lee Giles

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this article, we explore the relationships among digital objects in terms of their similarity based on vertex similarity measures. We argue that SimRank-a famous similarity measure-and its families, such as P-Rank and SimRank++, fail to capture similar node pairs in certain conditions, especially when two nodes can only reach each other through paths of odd lengths. We present new similarity measures ASCOS and ASCOS++ to address the problem. ASCOS outputs a more complete similarity score than SimRank and SimRank's families. ASCOS++ enriches ASCOS to include edge weight into the measure, giving all edges and network weights an opportunity to make their contribution. We show that both ASCOS++ and ASCOS can be reformulated and applied on a distributed environment for parallel contribution. Experimental results show that ASCOS++ reports a better score than SimRank and several famous similarity measures. Finally, we re-examine previous use cases of SimRank, and explain appropriate and inappropriate use cases. We suggest future SimRank users following the rules proposed here before na�vely applying it. We also discuss the relationship between ASCOS++ and PageRank.

Original languageEnglish (US)
Article number15
JournalACM Transactions on Knowledge Discovery from Data
Volume10
Issue number2
DOIs
StatePublished - Oct 1 2015

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{2bf273f2ce93432987dbb1f3f411b9a9,
title = "ASCOS++: An asymmetric similarity measure for weighted networks to address the problem of SimRank",
abstract = "In this article, we explore the relationships among digital objects in terms of their similarity based on vertex similarity measures. We argue that SimRank-a famous similarity measure-and its families, such as P-Rank and SimRank++, fail to capture similar node pairs in certain conditions, especially when two nodes can only reach each other through paths of odd lengths. We present new similarity measures ASCOS and ASCOS++ to address the problem. ASCOS outputs a more complete similarity score than SimRank and SimRank's families. ASCOS++ enriches ASCOS to include edge weight into the measure, giving all edges and network weights an opportunity to make their contribution. We show that both ASCOS++ and ASCOS can be reformulated and applied on a distributed environment for parallel contribution. Experimental results show that ASCOS++ reports a better score than SimRank and several famous similarity measures. Finally, we re-examine previous use cases of SimRank, and explain appropriate and inappropriate use cases. We suggest future SimRank users following the rules proposed here before na{\"i}¿½vely applying it. We also discuss the relationship between ASCOS++ and PageRank.",
author = "Chen, {Hung Hsuan} and Giles, {C. Lee}",
year = "2015",
month = "10",
day = "1",
doi = "10.1145/2776894",
language = "English (US)",
volume = "10",
journal = "ACM Transactions on Knowledge Discovery from Data",
issn = "1556-4681",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

ASCOS++ : An asymmetric similarity measure for weighted networks to address the problem of SimRank. / Chen, Hung Hsuan; Giles, C. Lee.

In: ACM Transactions on Knowledge Discovery from Data, Vol. 10, No. 2, 15, 01.10.2015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - ASCOS++

T2 - An asymmetric similarity measure for weighted networks to address the problem of SimRank

AU - Chen, Hung Hsuan

AU - Giles, C. Lee

PY - 2015/10/1

Y1 - 2015/10/1

N2 - In this article, we explore the relationships among digital objects in terms of their similarity based on vertex similarity measures. We argue that SimRank-a famous similarity measure-and its families, such as P-Rank and SimRank++, fail to capture similar node pairs in certain conditions, especially when two nodes can only reach each other through paths of odd lengths. We present new similarity measures ASCOS and ASCOS++ to address the problem. ASCOS outputs a more complete similarity score than SimRank and SimRank's families. ASCOS++ enriches ASCOS to include edge weight into the measure, giving all edges and network weights an opportunity to make their contribution. We show that both ASCOS++ and ASCOS can be reformulated and applied on a distributed environment for parallel contribution. Experimental results show that ASCOS++ reports a better score than SimRank and several famous similarity measures. Finally, we re-examine previous use cases of SimRank, and explain appropriate and inappropriate use cases. We suggest future SimRank users following the rules proposed here before na�vely applying it. We also discuss the relationship between ASCOS++ and PageRank.

AB - In this article, we explore the relationships among digital objects in terms of their similarity based on vertex similarity measures. We argue that SimRank-a famous similarity measure-and its families, such as P-Rank and SimRank++, fail to capture similar node pairs in certain conditions, especially when two nodes can only reach each other through paths of odd lengths. We present new similarity measures ASCOS and ASCOS++ to address the problem. ASCOS outputs a more complete similarity score than SimRank and SimRank's families. ASCOS++ enriches ASCOS to include edge weight into the measure, giving all edges and network weights an opportunity to make their contribution. We show that both ASCOS++ and ASCOS can be reformulated and applied on a distributed environment for parallel contribution. Experimental results show that ASCOS++ reports a better score than SimRank and several famous similarity measures. Finally, we re-examine previous use cases of SimRank, and explain appropriate and inappropriate use cases. We suggest future SimRank users following the rules proposed here before na�vely applying it. We also discuss the relationship between ASCOS++ and PageRank.

UR - http://www.scopus.com/inward/record.url?scp=84945178846&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945178846&partnerID=8YFLogxK

U2 - 10.1145/2776894

DO - 10.1145/2776894

M3 - Article

AN - SCOPUS:84945178846

VL - 10

JO - ACM Transactions on Knowledge Discovery from Data

JF - ACM Transactions on Knowledge Discovery from Data

SN - 1556-4681

IS - 2

M1 - 15

ER -