1
|
Baghersad M, Emadikhiav M, Huang CD, Behara RS. Modularity maximization to design contiguous policy zones for pandemic response. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023; 304:99-112. [PMID: 35039709 PMCID: PMC8755430 DOI: 10.1016/j.ejor.2022.01.012] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/05/2021] [Accepted: 01/05/2022] [Indexed: 05/05/2023]
Abstract
The health and economic devastation caused by the COVID-19 pandemic has created a significant global humanitarian disaster. Pandemic response policies guided by geospatial approaches are appropriate additions to traditional epidemiological responses when addressing this disaster. However, little is known about finding the optimal set of locations or jurisdictions to create policy coordination zones. In this study, we propose optimization models and algorithms to identify coordination communities based on the natural movement of people. To do so, we develop a mixed-integer quadratic-programming model to maximize the modularity of detected communities while ensuring that the jurisdictions within each community are contiguous. To solve the problem, we present a heuristic and a column-generation algorithm. Our computational experiments highlight the effectiveness of the models and algorithms in various instances. We also apply the proposed optimization-based solutions to identify coordination zones within North Carolina and South Carolina, two highly interconnected states in the U.S. Results of our case study show that the proposed model detects communities that are significantly better for coordinating pandemic related policies than the existing geopolitical boundaries.
Collapse
Affiliation(s)
- Milad Baghersad
- Department of Information Technology & Operations Management, College of Business, Florida Atlantic University, Boca Raton, FL 33431-0991, USA
| | - Mohsen Emadikhiav
- Department of Information Technology & Operations Management, College of Business, Florida Atlantic University, Boca Raton, FL 33431-0991, USA
| | - C Derrick Huang
- Department of Information Technology & Operations Management, College of Business, Florida Atlantic University, Boca Raton, FL 33431-0991, USA
| | - Ravi S Behara
- Department of Information Technology & Operations Management, College of Business, Florida Atlantic University, Boca Raton, FL 33431-0991, USA
| |
Collapse
|
2
|
Liu M, Yang J, Guo J, Chen J, Zhang Y. An improved two-stage label propagation algorithm based on LeaderRank. PeerJ Comput Sci 2022; 8:e981. [PMID: 36091993 PMCID: PMC9454888 DOI: 10.7717/peerj-cs.981] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/11/2021] [Accepted: 04/25/2022] [Indexed: 06/15/2023]
Abstract
To solve the problems of poor stability and low modularity (Q) of community division results caused by the randomness of node selection and label update in the traditional label propagation algorithm, an improved two-stage label propagation algorithm based on LeaderRank was proposed in this study. In the first stage, the order of node updating was determined by the participation coefficient (PC). Then, a new similarity measure was defined to improve the label selection mechanism so as to solve the problem of label oscillation caused by multiple labels of the node with the most similarity to the node. Moreover, the influence of the nodes was comprehensively used to find the initial community structure. In the second stage, the rough communities obtained in the first stage were regarded as nodes, and their merging sequence was determined by the PC. Next, the non-weak community and the community with the largest number of connected edges were combined. Finally, the community structure was further optimized to improve the modularity so as to obtain the final partition result. Experiments were performed on nine classic realistic networks and 19 artificial datasets with different scales, complexities, and densities. The modularity and normalized mutual information (NMI) were used as evaluation indexes for comparing the improved algorithm with dozens of relevant classic algorithms. The results showed that the proposed algorithm yields superior performance, and the results of community partitioning obtained using the improved algorithm were stable and more accurate than those obtained using other algorithms. In addition, the proposed algorithm always performs well in nine large-scale artificial data sets with 6,000 to 50,000 nodes and three large realistic network datasets, which verifies its computational performance and utility in community detection for large-scale networks.
Collapse
Affiliation(s)
- Miaomiao Liu
- School of Computer and Information Technology, Northeast Petroleum University, Daqing, Heilongjiang, China
- Key Laboratory of Petroleum Big Data and Intelligent Analysis of Heilongjiang Province, Northeast Petroleum University, Daqing, Heilongjiang, China
| | - Jinyun Yang
- School of Computer and Information Technology, Northeast Petroleum University, Daqing, Heilongjiang, China
| | - Jingfeng Guo
- College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei, China
| | - Jing Chen
- College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei, China
| | - Yongsheng Zhang
- School of Computer and Information Technology, Northeast Petroleum University, Daqing, Heilongjiang, China
| |
Collapse
|
3
|
Li C, Tang Y, Tang Z, Cao J, Zhang Y. Motif‐based embedding label propagation algorithm for community detection. INT J INTELL SYST 2021. [DOI: 10.1002/int.22759] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/11/2022]
Affiliation(s)
- Chunying Li
- School of Computer Science GuangDong Polytechnic Normal University Guangzhou China
| | - Yong Tang
- School of Computer South China Normal University Guangzhou China
| | - Zhikang Tang
- School of Computer Science GuangDong Polytechnic Normal University Guangzhou China
| | - Jinli Cao
- School of Engineering and Mathematical Sciences LA TROBE University Melbourne Victoria Australia
| | - Yanchun Zhang
- Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China
- Oujiang Laboratory (Zhejiang Lab for Regenerative Medicine, Vision and Brain Health) Wenzhou China
| |
Collapse
|
4
|
He T, Ong YS, Hu P. Multi-source propagation aware network clustering☆. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.04.064] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
5
|
A Core Drug Discovery Framework from Large-Scale Literature for Cold Pathogenic Disease Treatment in Traditional Chinese Medicine. JOURNAL OF HEALTHCARE ENGINEERING 2021; 2021:9930543. [PMID: 34394900 PMCID: PMC8360722 DOI: 10.1155/2021/9930543] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/03/2021] [Accepted: 07/18/2021] [Indexed: 11/18/2022]
Abstract
Cold pathogenic disease is a widespread disease in traditional Chinese medicine, which includes influenza and respiratory infection associated with high incidence and mortality. Discovering effective core drugs in Chinese medicine prescriptions for treating the disease and reducing patients' symptoms has attracted great interest. In this paper, we explore the core drugs for curing various syndromes of cold pathogenic disease from large-scale literature. We propose a core drug discovery framework incorporating word embedding and community detection algorithms, which contains three parts: disease corpus construction, drug network generation, and core drug discovery. First, disease corpus is established by collecting and preprocessing large-scale literature about the Chinese medicine treatment of cold pathogenic disease from China National Knowledge Infrastructure. Second, we adopt the Chinese word embedding model SSP2VEC for mining the drug implication implied in the literature; then, a drug network is established by the semantic similarity among drugs. Third, the community detection method COPRA based on label propagation is adopted to reveal drug communities and identify core drugs in the drug network. We compute the community size, closeness centrality, and degree distributions of the drug network to analyse the patterns of core drugs. We acquire 4681 literature from China national knowledge infrastructure. Twelve significant drug communities are discovered, in which the top-10 drugs in every drug community are recognized as core drugs with high accuracy, and four classical prescriptions for treating different syndromes of cold pathogenic disease are discovered. The proposed framework can identify effective core drugs for curing cold pathogenic disease, and the research can help doctors to verify the compatibility laws of Chinese medicine prescriptions.
Collapse
|
6
|
A survey about community detection over On-line Social and Heterogeneous Information Networks. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107112] [Citation(s) in RCA: 15] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/02/2023]
|
7
|
Tang M, Pan Q, Qian Y, Tian Y, Al-Nabhan N, Wang X. Parallel label propagation algorithm based on weight and random walk. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2021; 18:1609-1628. [PMID: 33757201 DOI: 10.3934/mbe.2021083] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Community detection is a complex and meaningful process, which plays an important role in studying the characteristics of complex networks. In recent years, the discovery and analysis of community structures in complex networks has attracted the attention of many scholars, and many community discovery algorithms have been proposed. Many existing algorithms are only suitable for small-scale data, not for large-scale data, so it is necessary to establish a stable and efficient label propagation algorithm to deal with massive data and complex social networks. In this paper, we propose a novel label propagation algorithm, called WRWPLPA (Parallel Label Propagation Algorithm based on Weight and Random Walk). WRWPLPA proposes a new similarity calculation method combining weights and random walks. It uses weights and similarities to update labels in the process of label propagation, improving the accuracy and stability of community detection. First, weight is calculated by combining the neighborhood index and the position index, and the weight is used to distinguish the importance of the nodes in the network. Then, use random walk strategy to describe the similarity between nodes, and the label of nodes are updated by combining the weight and similarity. Finally, parallel propagation is comprehensively proposed to utilize label probability efficiently. Experiment results on artificial network datasets and real network datasets show that our algorithm has improved accuracy and stability compared with other label propagation algorithms.
Collapse
Affiliation(s)
- Meili Tang
- Nanjing University of information science Technology, Jiangsu, Nanjing 210044, China
| | - Qian Pan
- Nanjing University of information science Technology, Jiangsu, Nanjing 210044, China
| | | | - Yuan Tian
- Nanjing Institute of Technology, Nanjing 211167, China
| | - Najla Al-Nabhan
- Department of Computer Science, KingSaud University, Riyadh 11362, Saudi Arabia
| | - Xin Wang
- Huafeng Meteorological Media Group, Beijing 100080, China
| |
Collapse
|
8
|
A Semantic Analysis and Community Detection-Based Artificial Intelligence Model for Core Herb Discovery from the Literature: Taking Chronic Glomerulonephritis Treatment as a Case Study. COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2020; 2020:1862168. [PMID: 32952598 PMCID: PMC7481937 DOI: 10.1155/2020/1862168] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/11/2020] [Revised: 07/14/2020] [Accepted: 08/14/2020] [Indexed: 12/22/2022]
Abstract
The Traditional Chinese Medicine (TCM) formula is the main treatment method of TCM. A formula often contains multiple herbs where core herbs play a critical therapeutic effect for treating diseases. It is of great significance to find out the core herbs in formulae for providing evidences and references for the clinical application of Chinese herbs and formulae. In this paper, we propose a core herb discovery model CHDSC based on semantic analysis and community detection to discover the core herbs for treating a certain disease from large-scale literature, which includes three stages: corpus construction, herb network establishment, and core herb discovery. In CHDSC, two artificial intelligence modules are used, where the Chinese word embedding algorithm ESSP2VEC is designed to analyse the semantics of herbs in Chinese literature based on the stroke, structure, and pinyin features of Chinese characters, and the label propagation-based algorithm LILPA is adopted to detect herb communities and core herbs in the herbal semantic network constructed from large-scale literature. To validate the proposed model, we choose chronic glomerulonephritis (CGN) as an example, search 1126 articles about how to treat CGN in TCM from the China National Knowledge Infrastructure (CNKI), and apply CHDSC to analyse the collected literature. Experimental results reveal that CHDSC discovers three major herb communities and eighteen core herbs for treating different CGN syndromes with high accuracy. The community size, degree, and closeness centrality distributions of the herb network are analysed to mine the laws of core herbs. As a result, we can observe that core herbs mainly exist in the communities with more than 25 herbs. The degree and closeness centrality of core herb nodes concentrate on the range of [15, 40] and [0.25, 0.45], respectively. Thus, semantic analysis and community detection are helpful for mining effective core herbs for treating a certain disease from large-scale literature.
Collapse
|