NDLI: Mining and generating large-scaled social networks via MapReduce

Content Provider	Springer Nature Link
Author	Lo, Yi Chen Lai, Hung Che Li, Cheng Te Lin, Shou De
Copyright Year	2013
Abstract	The computational efficiency is usually a concern when dealing with large-scale social network mining tasks containing billions of entities. Cloud computing is widely regarded as a feasible solution to this problem. In this work, we present an open-source graph mining library called the MapReduce Graph Mining Framework (MGMF) to be a robust and efficient MapReduce-based graph mining tool. We start from dividing graph mining algorithms into several categories and design a MapReduce framework for algorithms in each category. The experimental results show that MGMF is 3–20 times more efficient than PEGASUS, a state-of-the-art library for graph mining on MapReduce. Moreover, it provides broader coverage of a variety of graph mining algorithms. Furthermore, we designed a model to generate large-scale social networks capturing the power-law degree distribution property by parallelizing the mechanism of preferential attachment so that it is possible to produce billion-sized scale-free network in minutes. Our implemented open-source library can be downloaded from http://mslab.csie.ntu.edu.tw/~noahsark/MGMF/ .
Starting Page	1449
Ending Page	1469
Page Count	21
File Format	PDF
ISSN	18695450
Journal	Social Network Analysis and Mining
Volume Number	3
Issue Number	4
e-ISSN	18695469
Language	English
Publisher	Springer Vienna
Publisher Date	2013-07-12
Publisher Place	Vienna
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Graph mining Large-scaled social networks MapReduce Data Mining and Knowledge Discovery Complex Networks Game Theory, Economics, Social and Behav. Sciences Statistics for Social Science, Behavorial Science, Education, Public Policy, and Law Methodology of the Social Sciences
Content Type	Text
Resource Type	Article
Subject	Information Systems Human-Computer Interaction Communication Computer Science Applications Media Technology

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Scalable graph clustering with parallel approximate PageRank

Efficient community identification in complex networks

Mining half a billion topical experts across multiple social networks

Robustness of social and web graphs to node removal

Spectral embedding of directed networks

Deterministic graph exploration for efficient graph sampling

Rand-FaSE: fast approximate subgraph census

Social system as complex networks

Defining and predicting troll vulnerability in online social media

Mining and generating large-scaled social networks via MapReduce

Similar Documents

Scalable graph clustering with parallel approximate PageRank

Efficient community identification in complex networks

Mining half a billion topical experts across multiple social networks

Robustness of social and web graphs to node removal

Spectral embedding of directed networks

Deterministic graph exploration for efficient graph sampling

Rand-FaSE: fast approximate subgraph census

Social system as complex networks

Defining and predicting troll vulnerability in online social media

Mining and generating large-scaled social networks via MapReduce