Mu Zhu
Research Subjects
Research Interests
Mu Zhu has a total of 100 co-authors. Here are the top co-authors by number of shared publications:
- Guan Yuan
China University of Mining and Technology
6 shared publications Fanrong Meng
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu 221116, China
3 shared publicationsYong Zhou
School of Computer Science and Technology
3 shared publications- Shaojie Qiao
School of Software Engineering, Chengdu University of Information Technology, Chengdu, China
2 shared publications - Yanmei Zhang
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, China
2 shared publications - Yong Zhou
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China
2 shared publications
Latest Publications
- 15 November 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (03)
Community detection: Concepts, algorithms, evaluation and challenges
Recently, research on complex networks has become a hot topic. Community detection, as a main task in social network analysis, plays an important role in complex networks. In this paper, we survey and summarize the development and trend of community detection and analyze typical algorithms presented in recent years. We first discuss the algorithms from algorithmic thinking, key technology and the advantages and disadvantages. Second, evaluation metrics and datasets are introduced. Finally, some application scenarios are pointed out for the potential application in the future. It is hoped that this review will serve as the steppingstone for those interested in community detection.
- 15 November 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (03)
Community detection: Concepts, algorithms, evaluation and challenges
Recently, research on complex networks has become a hot topic. Community detection, as a main task in social network analysis, plays an important role in complex networks. In this paper, we survey and summarize the development and trend of community detection and analyze typical algorithms presented in recent years. We first discuss the algorithms from algorithmic thinking, key technology and the advantages and disadvantages. Second, evaluation metrics and datasets are introduced. Finally, some application scenarios are pointed out for the potential application in the future. It is hoped that this review will serve as the steppingstone for those interested in community detection.
- 12 September 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (10) , 29239-29260
A lightweight attention-based network for micro-expression recognition
- 12 September 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (10) , 29239-29260
A lightweight attention-based network for micro-expression recognition
- 1 July 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 3183-3206
Adaptive self-propagation graph convolutional network for recommendation
- 1 July 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 3183-3206
Adaptive self-propagation graph convolutional network for recommendation
- Open Access
- 28 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 13 (1) , 375
Entity Recognition for Chinese Hazardous Chemical Accident Data Based on Rules and a Pre-Trained Model
Due to the fragile physicochemical properties of hazardous chemicals, the chances of leakage and explosion during production, transportation, and storage are quite high. In recent years, hazardous chemical accidents have occurred frequently, posing a great threat to people’s lives and property. Hence, it is crucial to analyze hazardous chemical accidents and establish corresponding warning mechanisms and safeguard measures. At present, most hazardous-chemical-accident data exist in text format. However, named entity recognition (NER), as a method to extract useful information from text data, has not been fully utilized in the field of Chinese hazardous-chemical handling. The challenge is that Chinese NER is more difficult than English NER, because the boundaries of Chinese are fuzzy. In addition, the descriptions of hazardous chemical accidents are colloquial and lacks relevant labeling data. Further, most current models do not consider identifying the entities related to accident scenarios, losses, and causes. To tackle these issues, we propose a model based on a rule template and Bert-BiLSTM-CRF (RT-BBC) to recognize named entities from unstructured Chinese hazardous chemical accident reports. Comprehensive experiments on real-world datasets show the effectiveness of the proposed method. Specifically, RT-BBC outperformed the most competitive method by 6.6% and 3.6% in terms of accuracy and F1.
- 28 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 13 (1) , 375
Open AccessEntity Recognition for Chinese Hazardous Chemical Accident Data Based on Rules and a Pre-Trained Model
Due to the fragile physicochemical properties of hazardous chemicals, the chances of leakage and explosion during production, transportation, and storage are quite high. In recent years, hazardous chemical accidents have occurred frequently, posing a great threat to people’s lives and property. Hence, it is crucial to analyze hazardous chemical accidents and establish corresponding warning mechanisms and safeguard measures. At present, most hazardous-chemical-accident data exist in text format. However, named entity recognition (NER), as a method to extract useful information from text data, has not been fully utilized in the field of Chinese hazardous-chemical handling. The challenge is that Chinese NER is more difficult than English NER, because the boundaries of Chinese are fuzzy. In addition, the descriptions of hazardous chemical accidents are colloquial and lacks relevant labeling data. Further, most current models do not consider identifying the entities related to accident scenarios, losses, and causes. To tackle these issues, we propose a model based on a rule template and Bert-BiLSTM-CRF (RT-BBC) to recognize named entities from unstructured Chinese hazardous chemical accident reports. Comprehensive experiments on real-world datasets show the effectiveness of the proposed method. Specifically, RT-BBC outperformed the most competitive method by 6.6% and 3.6% in terms of accuracy and F1.
- Top Cited Papers
- 21 December 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (8) , 8003-8042
Heterogeneous graph neural networks analysis: a survey of techniques, evaluations and applications
- 21 December 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (8) , 8003-8042
Top Cited PapersHeterogeneous graph neural networks analysis: a survey of techniques, evaluations and applications
- Open Access
- 11 November 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (22) , 11464
Dynamic Community Detection Based on Evolutionary DeepWalk
To fully characterize the evolution process of the topological structure of dynamic communities, we propose a dynamic community detection based on Evolutionary DeepWalk (DEDW) for the high-dimensional data and dynamic characteristics. First, DEDW solves the problem of data sparseness in the process of dynamic network data representation through graph embedding. Then, DEDW uses the DeepWalk algorithm to generate node embedding feature vectors based on the characteristics of the stable change of the community structure; finally, DEDW integrates historical network structure information to generate evolutionary graph features and implements dynamic community detection with the K-means algorithm. Experiments show that DEDW can mine the time-smooth change characteristics of dynamic communities, solve the problem of data sparseness in the process of node embedding, fully consider historical structure information, and improve the accuracy and stability of dynamic community detection.
- 11 November 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (22) , 11464
Open AccessDynamic Community Detection Based on Evolutionary DeepWalk
To fully characterize the evolution process of the topological structure of dynamic communities, we propose a dynamic community detection based on Evolutionary DeepWalk (DEDW) for the high-dimensional data and dynamic characteristics. First, DEDW solves the problem of data sparseness in the process of dynamic network data representation through graph embedding. Then, DEDW uses the DeepWalk algorithm to generate node embedding feature vectors based on the characteristics of the stable change of the community structure; finally, DEDW integrates historical network structure information to generate evolutionary graph features and implements dynamic community detection with the K-means algorithm. Experiments show that DEDW can mine the time-smooth change characteristics of dynamic communities, solve the problem of data sparseness in the process of node embedding, fully consider historical structure information, and improve the accuracy and stability of dynamic community detection.
- Open Access
Dependence model assessment and selection with DecoupleNets
Neural networks are suggested for learning a map from $d$-dimensional samples with any underlying dependence structure to multivariate uniformity in $d'$ dimensions. This map, termed DecoupleNet, is used for dependence model assessment and selection. If the data-generating dependence model was known, and if it was among the few analytically tractable ones, one such transformation for $d'=d$ is Rosenblatt's transform. DecoupleNets have multiple advantages. For example, they only require an available sample and are applicable to $d'<d$, in particular $d'=2$. This allows for simpler model assessment and selection, both numerically and, because $d'=2$, especially graphically. A graphical assessment method has the advantage of being able to identify why, or in which region of the domain, a candidate model does not provide an adequate fit, thus leading to model selection in particular regions of interest or improved model building strategies in such regions. Through simulation studies with data from various copulas, the feasibility and validity of this novel DecoupleNet approach is demonstrated. Applications to real world data illustrate its usefulness for model assessment and selection.Open AccessDependence model assessment and selection with DecoupleNets
Neural networks are suggested for learning a map from $d$-dimensional samples with any underlying dependence structure to multivariate uniformity in $d'$ dimensions. This map, termed DecoupleNet, is used for dependence model assessment and selection. If the data-generating dependence model was known, and if it was among the few analytically tractable ones, one such transformation for $d'=d$ is Rosenblatt's transform. DecoupleNets have multiple advantages. For example, they only require an available sample and are applicable to $d'<d$, in particular $d'=2$. This allows for simpler model assessment and selection, both numerically and, because $d'=2$, especially graphically. A graphical assessment method has the advantage of being able to identify why, or in which region of the domain, a candidate model does not provide an adequate fit, thus leading to model selection in particular regions of interest or improved model building strategies in such regions. Through simulation studies with data from various copulas, the feasibility and validity of this novel DecoupleNet approach is demonstrated. Applications to real world data illustrate its usefulness for model assessment and selection. - Open Access
- 26 September 2019
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 12 (5) , 355-358
Issue Information
- 26 September 2019
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 12 (5) , 355-358
Open AccessIssue Information
- Open Access
- 12 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
An Improved Local Community Detection Algorithm Using Selection Probability
In order to find the structure of local community more effectively, we propose an improved local community detection algorithm ILCDSP, which improves the node selection strategy, and sets selection probability value for every candidate node. ILCDSP assigns nodes with different selection probability values, which are equal to the degree of the nodes to be chosen. By this kind of strategy, the proposed algorithm can detect the local communities effectively, since it can ensure the best search direction and avoid the local optimal solution. Various experimental results on both synthetic and real networks demonstrate that the quality of the local communities detected by our algorithm is significantly superior to the state‐of‐the‐art methods.
- 12 January 2014
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2014 (1)
Open AccessAn Improved Local Community Detection Algorithm Using Selection Probability
In order to find the structure of local community more effectively, we propose an improved local community detection algorithm ILCDSP, which improves the node selection strategy, and sets selection probability value for every candidate node. ILCDSP assigns nodes with different selection probability values, which are equal to the degree of the nodes to be chosen. By this kind of strategy, the proposed algorithm can detect the local communities effectively, since it can ensure the best search direction and avoid the local optimal solution. Various experimental results on both synthetic and real networks demonstrate that the quality of the local communities detected by our algorithm is significantly superior to the state‐of‐the‐art methods.
- Open Access
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-13
A Node Influence Based Label Propagation Algorithm for Community Detection in Networks
Label propagation algorithm (LPA) is an extremely fast community detection method and is widely used in large scale networks. In spite of the advantages of LPA, the issue of its poor stability has not yet been well addressed. We propose a novel node influence based label propagation algorithm for community detection (NIBLPA), which improves the performance of LPA by improving the node orders of label updating and the mechanism of label choosing when more than one label is contained by the maximum number of nodes. NIBLPA can get more stable results than LPA since it avoids the complete randomness of LPA. The experimental results on both synthetic and real networks demonstrate that NIBLPA maintains the efficiency of the traditional LPA algorithm, and, at the same time, it has a superior performance to some representative methods.
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-13
Open AccessA Node Influence Based Label Propagation Algorithm for Community Detection in Networks
Label propagation algorithm (LPA) is an extremely fast community detection method and is widely used in large scale networks. In spite of the advantages of LPA, the issue of its poor stability has not yet been well addressed. We propose a novel node influence based label propagation algorithm for community detection (NIBLPA), which improves the performance of LPA by improving the node orders of label updating and the mechanism of label choosing when more than one label is contained by the maximum number of nodes. NIBLPA can get more stable results than LPA since it avoids the complete randomness of LPA. The experimental results on both synthetic and real networks demonstrate that NIBLPA maintains the efficiency of the traditional LPA algorithm, and, at the same time, it has a superior performance to some representative methods.