loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Lixin Fu and Jing Deng

Affiliation: University of North Carolina at Greensboro, United States

ISBN: 978-989-758-096-3

Keyword(s): Shortest Paths, Error Rate, Social Networks.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Data Mining ; Databases and Information Systems Integration ; Enterprise Information Systems ; Sensor Networks ; Signal Processing ; Society, e-Business and e-Government ; Soft Computing ; Software Agents and Internet Computing ; Web 2.0 and Social Networking Controls ; Web Information Systems and Technologies

Abstract: Scalable and efficient algorithms are needed to compute shortest paths between any pair of vertices in large social graphs. In this work, we propose a novel ROBE scheme to estimate the shortest distances. ROBE is based on a hub serving as the skeleton of the large graph. In order to stretch the hub into every corner in the network, we first choose representative nodes with highest degrees that are at least two hops away from each other. Then bridge nodes are selected to connect the representative nodes. Extension nodes are also added to the hub to ensure that the originally connected parts in the large graph are not separated in the hub graph. To improve performance, we compress the hub through chain collapsing, tentacle retracting, and clique compression techniques. A query evaluation algorithm based on the compressed hub is given. We compare our approach with other state-of-the-art techniques and evaluate their performance with respect to miss rate, error rate, as well as constructi on time through extensive simulations. ROBE is demonstrated to be two orders faster and has more accurate estimations than two recent algorithms, allowing it to scale very well in large social graphs. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.85.245.126

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Fu, L. and Deng, J. (2015). ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs.In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-096-3, pages 97-107. DOI: 10.5220/0005353500970107

@conference{iceis15,
author={Lixin Fu. and Jing Deng.},
title={ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2015},
pages={97-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005353500970107},
isbn={978-989-758-096-3},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - ROBE - Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs
SN - 978-989-758-096-3
AU - Fu, L.
AU - Deng, J.
PY - 2015
SP - 97
EP - 107
DO - 10.5220/0005353500970107

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.