skip to main content
10.1145/2554850.2554906acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Reachability vectors: features for link-based similarity measures

Published: 24 March 2014 Publication History

Abstract

In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not suffer from these problems. In the proposed approach, each target object is represented by a vector. The elements of the vector denote all the objects in the given data set, and the value of each element indicates the weight of the corresponding object with respect to the target object. As for this weight value, we propose to utilize the probability of reaching from the target object to the specific object, computed using the "Random Walk with Restart" strategy. Then, we define the similarity between two objects as the cosine similarity of the two vectors representing the two objects. We also evaluate the performance of the proposed approach in comparison with existing link-based measures using two kinds of data sets. Our experimental results show that the proposed approach significantly outperform the existing measures.

References

[1]
P. Zhao, J. Han, and Y. Sun, "P-Rank: A Comprehensive Structural Similarity Measure over Information Networks," In Proc. of ACM Int'l Conf. on Information and Knowledge Management, pp. 553--562, 2009.
[2]
F. Menczer, "Combining Link and Content Analysis to Estimate Semantic Similarity," In Proc. of Int'l World Wide Web Conf., pp. 452--453, 2004.
[3]
R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, Addison Wesley, 1999.
[4]
G. Jeh and J. Widom, "SimRank: A Measure of Structural-Context Similarity," In Proc. of ACM Int'l Conf. on Special Interest Group on Knowledge Discovery and Data, pp. 538--543, 2002.
[5]
H. Small, "CoCitation in the Scientific Literature: A New Measure of the Relationship between Two Documents," Journal of the American Society for Information Science, Vol. 24, No. 4, pp. 265--269, 1973.
[6]
M. Kessler, "Bibliographic Coupling between Scientific Papers," Journal of the American Documentation, Vol. 14, No. 1, pp. 10--25, 1963.
[7]
J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2006.
[8]
J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos, "Neighborhood Formation and Anomaly Detection in Bipartite Graphs," In Proc. of the IEEE Int'l Conf. on Data Mining, pp. 418--425, 2005.

Index Terms

  1. Reachability vectors: features for link-based similarity measures

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing
    March 2014
    1890 pages
    ISBN:9781450324694
    DOI:10.1145/2554850
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 24 March 2014

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. link-based similarity measure
    2. reachability vector

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SAC 2014
    Sponsor:
    SAC 2014: Symposium on Applied Computing
    March 24 - 28, 2014
    Gyeongju, Republic of Korea

    Acceptance Rates

    SAC '14 Paper Acceptance Rate 218 of 939 submissions, 23%;
    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 82
      Total Downloads
    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media