Community-based diffusion scheme using Markov chain and spectral clustering for mobile social networks

Jegwang Ryu, Jiho Park, Junyeop Lee, Sung-Bong Yang

Research output: Contribution to journalArticle

Abstract

With the increase in the number of mobile devices such as tablets and smart watches, mobile social networks (MSNs) provide great opportunities for people to exchange information. As a result, information diffusion has become a critical issue in the emerging MSNs. In this paper, we address the problem of finding the top-k influential users who can effectively spread information in a network, which is referred to as the diffusion minimization problem. In order to minimize the spreading period, we can utilize the k-center problem, but which has a time complexity of NP-hard. We propose a community-based diffusion scheme using Markov chain and spectral clustering (CDMS) to minimize the spreading time by adopting a community concept based on the geographic regularity of human mobility in the MSNs. We exploit the Markov chain to predict a node’s mobility patterns and cluster the predicted patterns using the spectral graph theory. Finally, we select the top-k influential nodes in each community. Simulations are performed using the NS-2, based on the home-cell community-based mobility model, to show that the proposed scheme results in MSNs. In addition, we demonstrate that CDMS outperforms the noncommunity-based algorithms in terms of the number of nodes and ratio of k influential nodes.

Original languageEnglish
Pages (from-to)875-887
Number of pages13
JournalWireless Networks
Volume25
Issue number2
DOIs
Publication statusPublished - 2019 Feb 15

Fingerprint

Markov processes
Watches
Graph theory
Mobile devices

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{c5ebd06c4cd04eaebc8f24f7bf8e1126,
title = "Community-based diffusion scheme using Markov chain and spectral clustering for mobile social networks",
abstract = "With the increase in the number of mobile devices such as tablets and smart watches, mobile social networks (MSNs) provide great opportunities for people to exchange information. As a result, information diffusion has become a critical issue in the emerging MSNs. In this paper, we address the problem of finding the top-k influential users who can effectively spread information in a network, which is referred to as the diffusion minimization problem. In order to minimize the spreading period, we can utilize the k-center problem, but which has a time complexity of NP-hard. We propose a community-based diffusion scheme using Markov chain and spectral clustering (CDMS) to minimize the spreading time by adopting a community concept based on the geographic regularity of human mobility in the MSNs. We exploit the Markov chain to predict a node’s mobility patterns and cluster the predicted patterns using the spectral graph theory. Finally, we select the top-k influential nodes in each community. Simulations are performed using the NS-2, based on the home-cell community-based mobility model, to show that the proposed scheme results in MSNs. In addition, we demonstrate that CDMS outperforms the noncommunity-based algorithms in terms of the number of nodes and ratio of k influential nodes.",
author = "Jegwang Ryu and Jiho Park and Junyeop Lee and Sung-Bong Yang",
year = "2019",
month = "2",
day = "15",
doi = "10.1007/s11276-017-1599-6",
language = "English",
volume = "25",
pages = "875--887",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "2",

}

Community-based diffusion scheme using Markov chain and spectral clustering for mobile social networks. / Ryu, Jegwang; Park, Jiho; Lee, Junyeop; Yang, Sung-Bong.

In: Wireless Networks, Vol. 25, No. 2, 15.02.2019, p. 875-887.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Community-based diffusion scheme using Markov chain and spectral clustering for mobile social networks

AU - Ryu, Jegwang

AU - Park, Jiho

AU - Lee, Junyeop

AU - Yang, Sung-Bong

PY - 2019/2/15

Y1 - 2019/2/15

N2 - With the increase in the number of mobile devices such as tablets and smart watches, mobile social networks (MSNs) provide great opportunities for people to exchange information. As a result, information diffusion has become a critical issue in the emerging MSNs. In this paper, we address the problem of finding the top-k influential users who can effectively spread information in a network, which is referred to as the diffusion minimization problem. In order to minimize the spreading period, we can utilize the k-center problem, but which has a time complexity of NP-hard. We propose a community-based diffusion scheme using Markov chain and spectral clustering (CDMS) to minimize the spreading time by adopting a community concept based on the geographic regularity of human mobility in the MSNs. We exploit the Markov chain to predict a node’s mobility patterns and cluster the predicted patterns using the spectral graph theory. Finally, we select the top-k influential nodes in each community. Simulations are performed using the NS-2, based on the home-cell community-based mobility model, to show that the proposed scheme results in MSNs. In addition, we demonstrate that CDMS outperforms the noncommunity-based algorithms in terms of the number of nodes and ratio of k influential nodes.

AB - With the increase in the number of mobile devices such as tablets and smart watches, mobile social networks (MSNs) provide great opportunities for people to exchange information. As a result, information diffusion has become a critical issue in the emerging MSNs. In this paper, we address the problem of finding the top-k influential users who can effectively spread information in a network, which is referred to as the diffusion minimization problem. In order to minimize the spreading period, we can utilize the k-center problem, but which has a time complexity of NP-hard. We propose a community-based diffusion scheme using Markov chain and spectral clustering (CDMS) to minimize the spreading time by adopting a community concept based on the geographic regularity of human mobility in the MSNs. We exploit the Markov chain to predict a node’s mobility patterns and cluster the predicted patterns using the spectral graph theory. Finally, we select the top-k influential nodes in each community. Simulations are performed using the NS-2, based on the home-cell community-based mobility model, to show that the proposed scheme results in MSNs. In addition, we demonstrate that CDMS outperforms the noncommunity-based algorithms in terms of the number of nodes and ratio of k influential nodes.

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

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

U2 - 10.1007/s11276-017-1599-6

DO - 10.1007/s11276-017-1599-6

M3 - Article

VL - 25

SP - 875

EP - 887

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 2

ER -