Abstract
Online social network services have become indispensable in people’s daily life. The analysis of data in social network services often involves data mining techniques. However, the quick increase of users in such services posts challenges to develop effective data mining algorithms to deal with large social network data. In this paper, we propose a data-mining algorithm to get the shortest path between nodes in a social network. Based on HBase[1], this algorithm analyzes the social network model, and uses the intermediary degrees and degree central algorithm to optimize the output from cloud platform. With a simulated social network, we validate the efficiency of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
HBase Homepage, http://hbase.apache.org
Lakshman, A., Malik, P.: Cassandra: A Decentralized Structured Storage System. SIGOPS (2010)
Chang, F., et al.: Bigtable: A Distributed Storage System for Structured Data. In: OSDI (2006)
Hadoop, http://hadoop.apache.org
Missen, M.M.S.: The small world of web network graphs. In: International Multi Topic Conference on Wireless Networks, Information Processing and Systems, IMTIC (2008)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440 (1998)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999); Barabási, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 272, 173 (1999)
Hoque, I., Gupta, I.: Disk Layout Techniques for Online Social Network Data. In: IEEE Internet Computing (2012)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik, 269–271 (1959)
The Apache Software Foundation. The Hadoop Distributed File System:Architecture and Design, http://hadoop.apache.org/
Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)
Lin, J., Dyer, C.: Data-Intensive Text Processing with MapReduce. Synthesis Lectures on Human Language Technologies. Morgan & Claypool Publishers (2010)
McCubbin, C., Perozzi, B.: Finding the ‘Needle’: Locating Interesting Nodes Using the K-Shortest Paths Algorithm in MapReduce. In: 2011 11th IEEE International Conference on Data Mining Workshops (2011)
Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163–177 (2001)
Qin, L., Li, H.: Centrality analysis of BBS reply networks. In: 2011 International Conference on Information Technology, Computer Engineering and Management Sciences, ICM 2011, September 24-25 (2011)
Holme, P., Kim, B.J.: Growing scale free networks with tunable clustering. Physical Review E 65 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiang, Y. et al. (2013). Social Network Path Analysis Based on HBase. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)