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
CountryChina
CityHangzhou
Period6/21/136/21/13

Fingerprint

Path Analysis
Network Analysis
Social Networks
Data mining
Data Mining
Shortest path
Network Model
Optimise
Output
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Qiang, Y., Lu, J., Wu, W., Zhao, J., Zhang, X., Li, Y., & Wu, L. (2013). Social network path analysis based on HBase. In Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings (pp. 770-779). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7936 LNCS). https://doi.org/10.1007/978-3-642-38768-5_70
Qiang, Yan ; Lu, Junzuo ; Wu, Weili ; Zhao, Juanjuan ; Zhang, Xiaolong ; Li, Yue ; Wu, Lidong. / Social network path analysis based on HBase. Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. 2013. pp. 770-779 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4ec3ab1d7e734215a397c4b340d5fa3f,
title = "Social network path analysis based on HBase",
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.",
author = "Yan Qiang and Junzuo Lu and Weili Wu and Juanjuan Zhao and Xiaolong Zhang and Yue Li and Lidong Wu",
year = "2013",
month = "10",
day = "8",
doi = "10.1007/978-3-642-38768-5_70",
language = "English (US)",
isbn = "9783642387678",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "770--779",
booktitle = "Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings",

}

Qiang, Y, Lu, J, Wu, W, Zhao, J, Zhang, X, Li, Y & Wu, L 2013, Social network path analysis based on HBase. in Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7936 LNCS, pp. 770-779, 19th International Computing and Combinatorics Conference, COCOON 2013, Hangzhou, China, 6/21/13. https://doi.org/10.1007/978-3-642-38768-5_70

Social network path analysis based on HBase. / Qiang, Yan; Lu, Junzuo; Wu, Weili; Zhao, Juanjuan; Zhang, Xiaolong; Li, Yue; Wu, Lidong.

Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. 2013. p. 770-779 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7936 LNCS).

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

TY - GEN

T1 - Social network path analysis based on HBase

AU - Qiang, Yan

AU - Lu, Junzuo

AU - Wu, Weili

AU - Zhao, Juanjuan

AU - Zhang, Xiaolong

AU - Li, Yue

AU - Wu, Lidong

PY - 2013/10/8

Y1 - 2013/10/8

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-642-38768-5_70

DO - 10.1007/978-3-642-38768-5_70

M3 - Conference contribution

AN - SCOPUS:84884948164

SN - 9783642387678

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 770

EP - 779

BT - Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings

ER -

Qiang Y, Lu J, Wu W, Zhao J, Zhang X, Li Y et al. Social network path analysis based on HBase. In Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. 2013. p. 770-779. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-38768-5_70