Social network path analysis based on HBase

Yan Qiang, Junzuo Lu, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Yue Li, Lidong Wu

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

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.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings
Pages770-779
Number of pages10
DOIs
StatePublished - Oct 8 2013
Event19th International Computing and Combinatorics Conference, COCOON 2013 - Hangzhou, China
Duration: Jun 21 2013Jun 21 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7936 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Computing and Combinatorics Conference, COCOON 2013
Country/TerritoryChina
CityHangzhou
Period6/21/136/21/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Social network path analysis based on HBase'. Together they form a unique fingerprint.

Cite this