Search results
1 – 10 of over 1000Qingqing Wu, Xianguan Zhao, Lihua Zhou, Yao Wang and Yudi Yang
With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides…
Abstract
Purpose
With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides convenience for life, it also brings many problems such as security risks and public opinion orientation. Various negative, malicious and false information spread across regions, which seriously affect social harmony and national security. Therefore, this paper aims to minimize negative information such as online rumors that has attracted extensive attention. The most existing algorithms for blocking rumors have prevented the spread of rumors to some extent, but these algorithms are designed based on entire social networks, mainly focusing on the microstructure of the network, i.e. the pairwise relationship or similarity between nodes. The blocking effect of these algorithms may be unsatisfactory in some networks because of the sparse data in the microstructure.
Design/methodology/approach
An algorithm for minimizing the influence of dynamic rumor based on community structure is proposed in this paper. The algorithm first divides the network into communities, and integrates the influence of each node within communities and rumor influence probability to measure the influence of each node in the entire network, and then selects key nodes and bridge nodes in communities as blocked nodes. After that, a dynamic blocking strategy is adopted to improve the blocking effect of rumors.
Findings
Community structure is one of the most prominent features of networks. It reveals the organizational structure and functional components of a network from a mesoscopic level. The utilization of community structure can provide effective and rich information to solve the problem of data sparsity in the microstructure, thus effectively improve the blocking effect. Extensive experiments on two real-world data sets have validated that the proposed algorithm has superior performance than the baseline algorithms.
Originality/value
As an important research direction of social network analysis, rumor minimization has a profound effect on the harmony and stability of society and the development of social media. However, because the rumor spread has the characteristics of multiple propagation paths, fast propagation speed, wide propagation area and time-varying, it is a huge challenge to improve the effectiveness of the rumor blocking algorithm.
Details
Keywords
Euodia Vermeulen and Sara Grobbelaar
In this article we aim to understand how the network formed by fitness tracking devices and associated apps as a subset of the broader health-related Internet of things is capable…
Abstract
Purpose
In this article we aim to understand how the network formed by fitness tracking devices and associated apps as a subset of the broader health-related Internet of things is capable of spreading information.
Design/methodology/approach
The authors used a combination of a content analysis, network analysis, community detection and simulation. A sample of 922 health-related apps (including manufacturers' apps and developers) were collected through snowball sampling after an initial content analysis from a Google search for fitness tracking devices.
Findings
The network of fitness apps is disassortative with high-degree nodes connecting to low-degree nodes, follow a power-law degree distribution and present with low community structure. Information spreads faster through the network than an artificial small-world network and fastest when nodes with high degree centrality are the seeds.
Practical implications
This capability to spread information holds implications for both intended and unintended data sharing.
Originality/value
The analysis confirms and supports evidence of widespread mobility of data between fitness and health apps that were initially reported in earlier work and in addition provides evidence for the dynamic diffusion capability of the network based on its structure. The structure of the network enables the duality of the purpose of data sharing.
Details
Keywords
Abeer A. Zaki, Nesma A. Saleh and Mahmoud A. Mahmoud
This study aims to assess the effect of updating the Phase I data – to enhance the parameters' estimates – on the control charts' detection power designed to monitor social…
Abstract
Purpose
This study aims to assess the effect of updating the Phase I data – to enhance the parameters' estimates – on the control charts' detection power designed to monitor social networks.
Design/methodology/approach
A dynamic version of the degree corrected stochastic block model (DCSBM) is used to model the network. Both the Shewhart and exponentially weighted moving average (EWMA) control charts are used to monitor the model parameters. A performance comparison is conducted for each chart when designed using both fixed and moving windows of networks.
Findings
Our results show that continuously updating the parameters' estimates during the monitoring phase delays the Shewhart chart's detection of networks' anomalies; as compared to the fixed window approach. While the EWMA chart performance is either indifferent or worse, based on the updating technique, as compared to the fixed window approach. Generally, the EWMA chart performs uniformly better than the Shewhart chart for all shift sizes. We recommend the use of the EWMA chart when monitoring networks modeled with the DCSBM, with sufficiently small to moderate fixed window size to estimate the unknown model parameters.
Originality/value
This study shows that the excessive recommendations in literature regarding the continuous updating of Phase I data during the monitoring phase to enhance the control chart performance cannot generally be extended to social network monitoring; especially when using the DCSBM. That is to say, the effect of continuously updating the parameters' estimates highly depends on the nature of the process being monitored.
Details
Keywords
In this research, the authors demonstrate the advantage of reinforcement learning (RL) based intrusion detection systems (IDS) to solve very complex problems (e.g. selecting input…
Abstract
Purpose
In this research, the authors demonstrate the advantage of reinforcement learning (RL) based intrusion detection systems (IDS) to solve very complex problems (e.g. selecting input features, considering scarce resources and constrains) that cannot be solved by classical machine learning. The authors include a comparative study to build intrusion detection based on statistical machine learning and representational learning, using knowledge discovery in databases (KDD) Cup99 and Installation Support Center of Expertise (ISCX) 2012.
Design/methodology/approach
The methodology applies a data analytics approach, consisting of data exploration and machine learning model training and evaluation. To build a network-based intrusion detection system, the authors apply dueling double deep Q-networks architecture enabled with costly features, k-nearest neighbors (K-NN), support-vector machines (SVM) and convolution neural networks (CNN).
Findings
Machine learning-based intrusion detection are trained on historical datasets which lead to model drift and lack of generalization whereas RL is trained with data collected through interactions. RL is bound to learn from its interactions with a stochastic environment in the absence of a training dataset whereas supervised learning simply learns from collected data and require less computational resources.
Research limitations/implications
All machine learning models have achieved high accuracy values and performance. One potential reason is that both datasets are simulated, and not realistic. It was not clear whether a validation was ever performed to show that data were collected from real network traffics.
Practical implications
The study provides guidelines to implement IDS with classical supervised learning, deep learning and RL.
Originality/value
The research applied the dueling double deep Q-networks architecture enabled with costly features to build network-based intrusion detection from network traffics. This research presents a comparative study of reinforcement-based instruction detection with counterparts built with statistical and representational machine learning.
Details
Keywords
Abstract
Purpose
Identifying the frontiers of a specific research field is one of the most basic tasks in bibliometrics and research published in leading conferences is crucial to the data mining research community, whereas few research studies have focused on it. The purpose of this study is to detect the intellectual structure of data mining based on conference papers.
Design/methodology/approach
This study takes the authoritative conference papers of the ranking 9 in the data mining field provided by Google Scholar Metrics as a sample. According to paper amount, this paper first detects the annual situation of the published documents and the distribution of the published conferences. Furthermore, from the research perspective of keywords, CiteSpace was used to dig into the conference papers to identify the frontiers of data mining, which focus on keywords term frequency, keywords betweenness centrality, keywords clustering and burst keywords.
Findings
Research showed that the research heat of data mining had experienced a linear upward trend during 2007 and 2016. The frontier identification based on the conference papers showed that there were five research hotspots in data mining, including clustering, classification, recommendation, social network analysis and community detection. The research contents embodied in the conference papers were also very rich.
Originality/value
This study detected the research frontier from leading data mining conference papers. Based on the keyword co-occurrence network, from four dimensions of keyword term frequency, betweeness centrality, clustering analysis and burst analysis, this paper identified and analyzed the research frontiers of data mining discipline from 2007 to 2016.
Details
Keywords
Behnam Farhoudi, SeyedAhmad SeyedAlinaghi, Omid Dadras, Mehrzad Tashakoriyan, Mohammad Nazari Pouya, Mohammad Mehdi Gouya and Kate Dolan
The aim of present study was to integrate vital noncommunicable diseases (coronary artery disease, hypertension, diabetes mellitus and mental health disorders) into Prison-Based…
Abstract
Purpose
The aim of present study was to integrate vital noncommunicable diseases (coronary artery disease, hypertension, diabetes mellitus and mental health disorders) into Prison-Based Active Health Services Provision (PAHSP).
Design/methodology/approach
On Jan 1, 2018, there were 230,000 prisoners in Iran. Timely and systematic detection and diagnosis of chronic health conditions among this population are imperative. The collaboration between healthcare providers in prison and members of the multidisciplinary team of the healthcare community outside prison initiated an active health service provision approach for HIV and tuberculosis (TB). Guidelines for the control of HIV and TB in prison were piloted, and the finalized version was named “Prison-based Active Health Services Provision” (PAHSP), which has been scaled up in 16 of 260 Iranian prisons.
Finding
The PAHSP approach emphasizes the importance of early identification of key symptoms and risk factors. This approach provides an opportunity for improved prevention and treatment, enabling prisoners identified at risk or those who have been diagnosed with a target disease to be followed up and receive the appropriate health care.
Originality/value
Initiatives such as screening for chronic health conditions coupled with treatment will reduce the burden of chronic illness among prisoners and the broader community, thereby saving on healthcare costs and lives.
Details
Keywords
Marcella De Martino, Alfonso Morvillo and Giuseppe Giordano
Arkaitz Zubiaga, Bahareh Heravi, Jisun An and Haewoon Kwak
Abstract
Details