Improvement of path analysis algorithm in social networks based on HBase

DOI10.1007/S10878-013-9675-ZzbMATH Open1314.90086OpenAlexW2042281813MaRDI QIDQ489703FDOQ489703

Authors: Yan Qiang, Bo Pei, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Lidong Wu, Yue Li 

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9675-z

Recommendations

• Social network path analysis based on HBase
• Distributed centrality analysis of social network data using MapReduce
• scientific article; zbMATH DE number 7295875
• A shortest path approximation algorithm for complex network analysis
• A community detection algorithm based on graph compression for large-scale social networks

zbMATH Keywords

social networksHBaseintermediary degreesK-shortest pathsparallel BFS

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Cites Work

• A note on two problems in connexion with graphs
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• A faster algorithm for betweenness centrality*
• The clustering coefficient and the diameter of small-world networks

Cited In (2)

• HBase
• Social network analysis and applications: A review of the broad research aspects of social network structure

Uses Software

• MapReduce
• Cassandra
• Bigtable

This page was built for publication: Improvement of path analysis algorithm in social networks based on HBase

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489703)