skip to main content
10.1145/1999676.1999722acmconferencesArticle/Chapter ViewAbstractPublication Pagesk-capConference Proceedingsconference-collections
demonstration

Capturing missing edges in social networks using vertex similarity

Published: 26 June 2011 Publication History

Abstract

We introduce the graph vertex similarity measure, Relation Strength Similarity (RSS), that utilizes a network's topology to discover and capture similar vertices. The RSS has the advantage that it is asymmetric; can be used in a weighted network; and has an adjustable "discovery range" parameter that enables exploration of friend of friend connections in a social network. To evaluate RSS we perform experiments on a coauthorship network from the CiteSeerX database. Our method significantly outperforms other vertex similarity measures in terms of the ability to predict future coauthoring behavior among authors in the CiteSeerX database for the near future 0 to 4 years out and reasonably so for 4 to 6 years out.

References

[1]
L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211--230, 2003.
[2]
H.-H. Chen, L. Gou, X. Zhang, and C. L. Giles. Collabseer: A search engine for collaboration discovery. In Proceedings of the 11th ACM/IEEE-CS Joint Conference on Digital Libraries. ACM, 2011.
[3]
G. Jeh and J. Widom. SimRank: A measure of structural-context similarity. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 538--543. ACM, 2002.
[4]
P. Tan, M. Steinbach, V. Kumar, et al. Introduction to data mining. Pearson Addison Wesley Boston, 2006.

Cited By

View all
  • (2023)On Spatial Crowdsourcing Query under Pandemics2023 24th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM58254.2023.00027(106-115)Online publication date: Jul-2023
  • (2022)On Epidemic-aware Socio Spatial POI Recommendation2022 23rd IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM55031.2022.00044(169-178)Online publication date: Jun-2022
  • (2021)Community Detection in Partially Observable Social NetworksACM Transactions on Knowledge Discovery from Data10.1145/346133916:2(1-24)Online publication date: 21-Jul-2021
  • Show More Cited By

Index Terms

  1. Capturing missing edges in social networks using vertex similarity

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    K-CAP '11: Proceedings of the sixth international conference on Knowledge capture
    June 2011
    212 pages
    ISBN:9781450303965
    DOI:10.1145/1999676

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 June 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. coauthor network
    2. information retrieval
    3. link analysis
    4. link prediction
    5. vertex similarity
    6. web of linked data

    Qualifiers

    • Demonstration

    Conference

    K-CAP '2011
    Sponsor:
    K-CAP '2011: Knowledge Capture Conference
    June 26 - 29, 2011
    Alberta, Banff, Canada

    Acceptance Rates

    Overall Acceptance Rate 55 of 198 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 13 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)On Spatial Crowdsourcing Query under Pandemics2023 24th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM58254.2023.00027(106-115)Online publication date: Jul-2023
    • (2022)On Epidemic-aware Socio Spatial POI Recommendation2022 23rd IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM55031.2022.00044(169-178)Online publication date: Jun-2022
    • (2021)Community Detection in Partially Observable Social NetworksACM Transactions on Knowledge Discovery from Data10.1145/346133916:2(1-24)Online publication date: 21-Jul-2021
    • (2019)Predicting Friendship Using a Unified Probability ModelBig Data10.1007/978-981-15-1899-7_5(57-72)Online publication date: 28-Nov-2019
    • (2013)ASCOSProceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining10.1145/2492517.2492539(442-449)Online publication date: 25-Aug-2013
    • (2013)Towards the Lexicon-Based Sentiment Analysis of Polish TextsProceedings of the 5th International Conference on Computational Collective Intelligence. Technologies and Applications - Volume 808310.1007/978-3-642-40495-5_29(286-295)Online publication date: 11-Sep-2013
    • (2013)Trend Based Vertex Similarity for Academic Collaboration RecommendationProceedings of the 5th International Conference on Computational Collective Intelligence. Technologies and Applications - Volume 808310.1007/978-3-642-40495-5_2(11-20)Online publication date: 11-Sep-2013
    • (2012)Taxonomy-based query-dependent schemes for profile similarity measurementProceedings of the 1st Joint International Workshop on Entity-Oriented and Semantic Search10.1145/2379307.2379315(1-6)Online publication date: 12-Aug-2012
    • (2012)Discovering missing links in networks using vertex similarity measuresProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2245305(138-143)Online publication date: 26-Mar-2012
    • (2012)Predicting recent links in FOAF networksProceedings of the 5th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction10.1007/978-3-642-29047-3_19(156-163)Online publication date: 3-Apr-2012

    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