Three-hop distance estimation in social graphs

Pascal Welke, Alexander Markowetz, Torsten Suel, Maria Christoforaki

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, we study a 3-hop approach to distance estimation that uses two intermediate landmarks, where each landmark only stores distances to vertices in its local neighborhood and to the other landmarks. We show how to suitably represent and compress the distance data stored for each landmark, for the 2-hop and 3-hop case. Overall, we find that 3-hop methods achieve modest but promising improvement in some cases, while being comparable or slightly worse than 2-hop methods in others. Furthermore, our light compression schemes improve the practical applicability of both the 2-hop and 3-hop methods.

    Original languageEnglish (US)
    Title of host publicationProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1048-1055
    Number of pages8
    ISBN (Electronic)9781467390040
    DOIs
    StatePublished - Feb 2 2017
    Event4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States
    Duration: Dec 5 2016Dec 8 2016

    Other

    Other4th IEEE International Conference on Big Data, Big Data 2016
    CountryUnited States
    CityWashington
    Period12/5/1612/8/16

    Keywords

    • distance estimation
    • landmarks
    • shortest paths

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Information Systems
    • Hardware and Architecture

    Cite this

    Welke, P., Markowetz, A., Suel, T., & Christoforaki, M. (2017). Three-hop distance estimation in social graphs. In Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 (pp. 1048-1055). [7840706] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigData.2016.7840706

    Three-hop distance estimation in social graphs. / Welke, Pascal; Markowetz, Alexander; Suel, Torsten; Christoforaki, Maria.

    Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1048-1055 7840706.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Welke, P, Markowetz, A, Suel, T & Christoforaki, M 2017, Three-hop distance estimation in social graphs. in Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016., 7840706, Institute of Electrical and Electronics Engineers Inc., pp. 1048-1055, 4th IEEE International Conference on Big Data, Big Data 2016, Washington, United States, 12/5/16. https://doi.org/10.1109/BigData.2016.7840706
    Welke P, Markowetz A, Suel T, Christoforaki M. Three-hop distance estimation in social graphs. In Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1048-1055. 7840706 https://doi.org/10.1109/BigData.2016.7840706
    Welke, Pascal ; Markowetz, Alexander ; Suel, Torsten ; Christoforaki, Maria. / Three-hop distance estimation in social graphs. Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 1048-1055
    @inproceedings{0d8b66eddc4c44ffa7ec1277c5c16916,
    title = "Three-hop distance estimation in social graphs",
    abstract = "In this paper, we study a 3-hop approach to distance estimation that uses two intermediate landmarks, where each landmark only stores distances to vertices in its local neighborhood and to the other landmarks. We show how to suitably represent and compress the distance data stored for each landmark, for the 2-hop and 3-hop case. Overall, we find that 3-hop methods achieve modest but promising improvement in some cases, while being comparable or slightly worse than 2-hop methods in others. Furthermore, our light compression schemes improve the practical applicability of both the 2-hop and 3-hop methods.",
    keywords = "distance estimation, landmarks, shortest paths",
    author = "Pascal Welke and Alexander Markowetz and Torsten Suel and Maria Christoforaki",
    year = "2017",
    month = "2",
    day = "2",
    doi = "10.1109/BigData.2016.7840706",
    language = "English (US)",
    pages = "1048--1055",
    booktitle = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    TY - GEN

    T1 - Three-hop distance estimation in social graphs

    AU - Welke, Pascal

    AU - Markowetz, Alexander

    AU - Suel, Torsten

    AU - Christoforaki, Maria

    PY - 2017/2/2

    Y1 - 2017/2/2

    N2 - In this paper, we study a 3-hop approach to distance estimation that uses two intermediate landmarks, where each landmark only stores distances to vertices in its local neighborhood and to the other landmarks. We show how to suitably represent and compress the distance data stored for each landmark, for the 2-hop and 3-hop case. Overall, we find that 3-hop methods achieve modest but promising improvement in some cases, while being comparable or slightly worse than 2-hop methods in others. Furthermore, our light compression schemes improve the practical applicability of both the 2-hop and 3-hop methods.

    AB - In this paper, we study a 3-hop approach to distance estimation that uses two intermediate landmarks, where each landmark only stores distances to vertices in its local neighborhood and to the other landmarks. We show how to suitably represent and compress the distance data stored for each landmark, for the 2-hop and 3-hop case. Overall, we find that 3-hop methods achieve modest but promising improvement in some cases, while being comparable or slightly worse than 2-hop methods in others. Furthermore, our light compression schemes improve the practical applicability of both the 2-hop and 3-hop methods.

    KW - distance estimation

    KW - landmarks

    KW - shortest paths

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

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

    U2 - 10.1109/BigData.2016.7840706

    DO - 10.1109/BigData.2016.7840706

    M3 - Conference contribution

    SP - 1048

    EP - 1055

    BT - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -