ActiveDBC: learning Knowledge-based Information propagation in mobile social networks

Jiho Park, Jegwang Ryu, Sung-Bong Yang

Research output: Contribution to journalArticle

Abstract

Due to fast-growing mobile devices usage such as smartphones and wearable devices, the rapid information propagation in the Mobile Social Networks environment is very important. In particular, information transmission of people with repeated daily patterns in complex areas such as big cities requires a very meaningful analysis. We address the problem of identifying a key player who can quickly propagate the information to the whole network. This problem, in other words, often refer as the information propagation problem. In this research, we selected the top-k influential nodes to learn the knowledge-based movements of people by using a Markov chain process in a real-life environment. Subsequently, their movement probabilities according to virtual regions were used to ensure appropriate clustering based on the Density-based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Since moving patterns in a university campus data have a dense collection of people, the DBSCAN algorithm was useful for producing very dense groupings. After clustering, we also elected the top-k influential nodes based on the results learned from the score of each node according to groups. We determined the rate at which information spreads by using trace data from a real network. Our experiments were conducted in the Opportunistic Network Environment simulator. The results showed that the proposed method has outstanding performance for the level of spreading time in comparison to other methods such as Naïve, Degree, and K-means. Furthermore, we compared the performance of RandomDBC with that of ActiveDBC, proving that the latter method was important to extract the influential top-k nodes, and showed superior performance.

Original languageEnglish
Pages (from-to)1519-1531
Number of pages13
JournalWireless Networks
Volume25
Issue number4
DOIs
Publication statusPublished - 2019 May 1

Fingerprint

Smartphones
Mobile devices
Markov processes
Simulators
Experiments

All Science Journal Classification (ASJC) codes

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

Cite this

@article{27477141ac3841e3afc88e14773dee76,
title = "ActiveDBC: learning Knowledge-based Information propagation in mobile social networks",
abstract = "Due to fast-growing mobile devices usage such as smartphones and wearable devices, the rapid information propagation in the Mobile Social Networks environment is very important. In particular, information transmission of people with repeated daily patterns in complex areas such as big cities requires a very meaningful analysis. We address the problem of identifying a key player who can quickly propagate the information to the whole network. This problem, in other words, often refer as the information propagation problem. In this research, we selected the top-k influential nodes to learn the knowledge-based movements of people by using a Markov chain process in a real-life environment. Subsequently, their movement probabilities according to virtual regions were used to ensure appropriate clustering based on the Density-based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Since moving patterns in a university campus data have a dense collection of people, the DBSCAN algorithm was useful for producing very dense groupings. After clustering, we also elected the top-k influential nodes based on the results learned from the score of each node according to groups. We determined the rate at which information spreads by using trace data from a real network. Our experiments were conducted in the Opportunistic Network Environment simulator. The results showed that the proposed method has outstanding performance for the level of spreading time in comparison to other methods such as Na{\"i}ve, Degree, and K-means. Furthermore, we compared the performance of RandomDBC with that of ActiveDBC, proving that the latter method was important to extract the influential top-k nodes, and showed superior performance.",
author = "Jiho Park and Jegwang Ryu and Sung-Bong Yang",
year = "2019",
month = "5",
day = "1",
doi = "10.1007/s11276-017-1608-9",
language = "English",
volume = "25",
pages = "1519--1531",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "4",

}

ActiveDBC : learning Knowledge-based Information propagation in mobile social networks. / Park, Jiho; Ryu, Jegwang; Yang, Sung-Bong.

In: Wireless Networks, Vol. 25, No. 4, 01.05.2019, p. 1519-1531.

Research output: Contribution to journalArticle

TY - JOUR

T1 - ActiveDBC

T2 - learning Knowledge-based Information propagation in mobile social networks

AU - Park, Jiho

AU - Ryu, Jegwang

AU - Yang, Sung-Bong

PY - 2019/5/1

Y1 - 2019/5/1

N2 - Due to fast-growing mobile devices usage such as smartphones and wearable devices, the rapid information propagation in the Mobile Social Networks environment is very important. In particular, information transmission of people with repeated daily patterns in complex areas such as big cities requires a very meaningful analysis. We address the problem of identifying a key player who can quickly propagate the information to the whole network. This problem, in other words, often refer as the information propagation problem. In this research, we selected the top-k influential nodes to learn the knowledge-based movements of people by using a Markov chain process in a real-life environment. Subsequently, their movement probabilities according to virtual regions were used to ensure appropriate clustering based on the Density-based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Since moving patterns in a university campus data have a dense collection of people, the DBSCAN algorithm was useful for producing very dense groupings. After clustering, we also elected the top-k influential nodes based on the results learned from the score of each node according to groups. We determined the rate at which information spreads by using trace data from a real network. Our experiments were conducted in the Opportunistic Network Environment simulator. The results showed that the proposed method has outstanding performance for the level of spreading time in comparison to other methods such as Naïve, Degree, and K-means. Furthermore, we compared the performance of RandomDBC with that of ActiveDBC, proving that the latter method was important to extract the influential top-k nodes, and showed superior performance.

AB - Due to fast-growing mobile devices usage such as smartphones and wearable devices, the rapid information propagation in the Mobile Social Networks environment is very important. In particular, information transmission of people with repeated daily patterns in complex areas such as big cities requires a very meaningful analysis. We address the problem of identifying a key player who can quickly propagate the information to the whole network. This problem, in other words, often refer as the information propagation problem. In this research, we selected the top-k influential nodes to learn the knowledge-based movements of people by using a Markov chain process in a real-life environment. Subsequently, their movement probabilities according to virtual regions were used to ensure appropriate clustering based on the Density-based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Since moving patterns in a university campus data have a dense collection of people, the DBSCAN algorithm was useful for producing very dense groupings. After clustering, we also elected the top-k influential nodes based on the results learned from the score of each node according to groups. We determined the rate at which information spreads by using trace data from a real network. Our experiments were conducted in the Opportunistic Network Environment simulator. The results showed that the proposed method has outstanding performance for the level of spreading time in comparison to other methods such as Naïve, Degree, and K-means. Furthermore, we compared the performance of RandomDBC with that of ActiveDBC, proving that the latter method was important to extract the influential top-k nodes, and showed superior performance.

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

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

U2 - 10.1007/s11276-017-1608-9

DO - 10.1007/s11276-017-1608-9

M3 - Article

AN - SCOPUS:85033503418

VL - 25

SP - 1519

EP - 1531

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 4

ER -