Honglei Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Honglei Zhu has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Ruichang Li
School of Information Technology, Henan University of Chinese Medicine, Zhengzhou, 450046 China
3 shared publications - Fan Liao
School of Information and Technology, Henan University of Chinese Medicine, Zhengzhou, 450000, China
2 shared publications - Xuekun Song
Institute of Information and Technology, Henan University of Chinese Medicine, Zhengzhou, China
2 shared publications Yingying Zhao
School of Information Technology, Henan University of Chinese Medicine, Zhengzhou 450046, China
2 shared publications- Yulong Xu
School of Information Technology, Henan University of Chinese Medicine, Zhengzhou, China
2 shared publications - Chunkai Wang
Post-Doctoral Research Center, China Reinsurance (Group) Corporation, Beijing, 100033, China
1 shared publication
Latest Publications
- Open Access
- 23 March 2023
- Published by Walter de Gruyter GmbH in Zeitschrift für Kristallographie - New Crystal Structures
- Vol. 238 (3) , 491-493
Crystal structure of bis(tetrapropylammonium) terephthalate – 1-(diaminomethylene)thiourea – water (1/2/4) C18H40N5O4S
C18H40N5O4S, monoclinic, P21/n (no. 14), a = 8.4254(9) Å, b = 8.4254(9) Å, c = 16.1470(17) Å, β = 98.302(2)°, V = 2411.9(4) Å3, Z = 4, R gt(F) = 0.0409, wR ref(F 2) = 0.1162, T = 296(2) K.
- 23 March 2023
- Published by Walter de Gruyter GmbH in Zeitschrift für Kristallographie - New Crystal Structures
- Vol. 238 (3) , 491-493
Open AccessCrystal structure of bis(tetrapropylammonium) terephthalate – 1-(diaminomethylene)thiourea – water (1/2/4) C18H40N5O4S
C18H40N5O4S, monoclinic, P21/n (no. 14), a = 8.4254(9) Å, b = 8.4254(9) Å, c = 16.1470(17) Å, β = 98.302(2)°, V = 2411.9(4) Å3, Z = 4, R gt(F) = 0.0409, wR ref(F 2) = 0.1162, T = 296(2) K.
- Open Access
- 30 August 2022
- Published by Wiley in Mobile Information Systems
- Vol. 2022, 1-9
Semantic Analysis of Public Health Medical Issues Based on Convolution Neural Networks
Text mining and semantic analysis of medical public health issues are the main points for intelligent medical interaction, but less relevant research has been done on them. This article conceives a convolutional neural network for the semantic classification of public health medical issues. The dual convolution layer is used to further reduce the dimension of the data, extract more in-depth information from the data, and map the features. Each convolution layer includes several convolution nuclei to extract semantic characteristics, and then, the complete connection layer is input to the classifier to obtain the results of the classification. To check the classification effect, the dictionary artificial construction and the double hidden-layers neuronal network are used for semantic classification, and the three methods are compared and tested on the six real datasets. The experimental results show that when the quality of the dataset is high, the convolution neural network method proposed in this paper exceeds the last two methods. The proposed method is higher than the construction of the artificial dictionary and the double hidden-layers neural network in the recall rate: 0.153 and 0.037, and greater than 0.07 and 0.01 for the F1 measure rate, respectively. When the quality of the dataset is general, the models of the three methods do not give good classification results. Finally, it is concluded that the convolutional neural network method conceived has a good semantic recognition performance in public health medical issues.
- 30 August 2022
- Published by Wiley in Mobile Information Systems
- Vol. 2022, 1-9
Open AccessSemantic Analysis of Public Health Medical Issues Based on Convolution Neural Networks
Text mining and semantic analysis of medical public health issues are the main points for intelligent medical interaction, but less relevant research has been done on them. This article conceives a convolutional neural network for the semantic classification of public health medical issues. The dual convolution layer is used to further reduce the dimension of the data, extract more in-depth information from the data, and map the features. Each convolution layer includes several convolution nuclei to extract semantic characteristics, and then, the complete connection layer is input to the classifier to obtain the results of the classification. To check the classification effect, the dictionary artificial construction and the double hidden-layers neuronal network are used for semantic classification, and the three methods are compared and tested on the six real datasets. The experimental results show that when the quality of the dataset is high, the convolution neural network method proposed in this paper exceeds the last two methods. The proposed method is higher than the construction of the artificial dictionary and the double hidden-layers neural network in the recall rate: 0.153 and 0.037, and greater than 0.07 and 0.01 for the F1 measure rate, respectively. When the quality of the dataset is general, the models of the three methods do not give good classification results. Finally, it is concluded that the convolutional neural network method conceived has a good semantic recognition performance in public health medical issues.
- Open Access
- 4 September 2021
- Published by Wiley in Journal of Healthcare Engineering
- Vol. 2021, 1-10
Research on Data Analysis of Traditional Chinese Medicine with Improved Differential Evolution Clustering Algorithm
Medical data analysis is an important part of intelligent medicine, and clustering analysis is a commonly used method for data analysis of Traditional Chinese Medicine (TCM); however, the classical K-Means algorithm is greatly affected by the selection of initial clustering center, which is easy to fall into the local optimal solution. To avoid this problem, an improved differential evolution clustering algorithm is proposed in this paper. The proposed algorithm selects the initial clustering center randomly, optimizes and locates the clustering center in the process of evolution iteration, and improves the mutation mode of differential evolution to enhance the overall optimization ability, so that the clustering effect can reach the global optimization as far as possible. Three University of California, Irvine (UCI), data sets are selected to compare the clustering effect of the classical K-Means algorithm, the standard DE-K-Means algorithm, the K-Means++ algorithm, and the proposed algorithm. The experimental results show that, in terms of global optimization, the proposed algorithm is obviously superior to the other three algorithms, and in terms of convergence speed, the proposed algorithm is better than DE-K-Means algorithm. Finally, the proposed algorithm is applied to analyze the drug data of Traditional Chinese Medicine in the treatment of pulmonary diseases, and the analysis results are consistent with the theory of Traditional Chinese Medicine.
- 4 September 2021
- Published by Wiley in Journal of Healthcare Engineering
- Vol. 2021, 1-10
Open AccessResearch on Data Analysis of Traditional Chinese Medicine with Improved Differential Evolution Clustering Algorithm
Medical data analysis is an important part of intelligent medicine, and clustering analysis is a commonly used method for data analysis of Traditional Chinese Medicine (TCM); however, the classical K-Means algorithm is greatly affected by the selection of initial clustering center, which is easy to fall into the local optimal solution. To avoid this problem, an improved differential evolution clustering algorithm is proposed in this paper. The proposed algorithm selects the initial clustering center randomly, optimizes and locates the clustering center in the process of evolution iteration, and improves the mutation mode of differential evolution to enhance the overall optimization ability, so that the clustering effect can reach the global optimization as far as possible. Three University of California, Irvine (UCI), data sets are selected to compare the clustering effect of the classical K-Means algorithm, the standard DE-K-Means algorithm, the K-Means++ algorithm, and the proposed algorithm. The experimental results show that, in terms of global optimization, the proposed algorithm is obviously superior to the other three algorithms, and in terms of convergence speed, the proposed algorithm is better than DE-K-Means algorithm. Finally, the proposed algorithm is applied to analyze the drug data of Traditional Chinese Medicine in the treatment of pulmonary diseases, and the analysis results are consistent with the theory of Traditional Chinese Medicine.
- Open Access
- 26 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 214050-214060
Spatial-Temporal Topic Model for Cold-Start Event Recommendation
Event recommendation has attracted an increasing attention with the popularity of event-based social networks (EBSNs). The previous studies mainly focus on exploiting various contextual information to alleviate the cold-start problem in event recommendation. However, the interactions between different contextual factors, such as time, location and content, have not been modeled jointly. In this paper, we investigate the relationships among time, location and organizer in EBSNs, and propose a Spatial-Temporal Topic Model (STTM) for cold-start event recommendation. STTM can capture user’s interests on content and geographical space changing over time, and users have different event and venue topic distributions at different times in STTM. We perform an experimental evaluation on the real-world EBSNs dataset. The experimental results show the significant improvements of our method over other comparison methods, especially when dataset is more sparse.
- 26 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 214050-214060
Open AccessSpatial-Temporal Topic Model for Cold-Start Event Recommendation
Event recommendation has attracted an increasing attention with the popularity of event-based social networks (EBSNs). The previous studies mainly focus on exploiting various contextual information to alleviate the cold-start problem in event recommendation. However, the interactions between different contextual factors, such as time, location and content, have not been modeled jointly. In this paper, we investigate the relationships among time, location and organizer in EBSNs, and propose a Spatial-Temporal Topic Model (STTM) for cold-start event recommendation. STTM can capture user’s interests on content and geographical space changing over time, and users have different event and venue topic distributions at different times in STTM. We perform an experimental evaluation on the real-world EBSNs dataset. The experimental results show the significant improvements of our method over other comparison methods, especially when dataset is more sparse.
- Open Access
- 13 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 52517-52527
RCD+: A Partitioning Method for Data Streams Based on Multiple Queries
Big data stream management systems often must transform a query application into multiple query tasks, simultaneously and dynamically partitioning data streams based on attribute values or partitioning keys. However, due to different partitioning orders or strategies of partitioning keys, the redundant and repetitive transmission of data streams at different nodes leads to system performance degradation. In addition, with the change of data skewness, the problem of unbalanced data stream partitioning still exists between different processing units within the same node. This paper presents the partitioning framework RCD+ (Runtime Correlation Discovery) according to runtime correlation discovery. RCD+ implements the full granularity partitioning strategy, which includes runtime positive correlation partitioning (RPC-partitioning) and clustering partitioning (Clu-partitioning). First, in the process of RPC-partitioning, we introduce the mini-batch scheme to reduce the number of output stream caches and partition data streams using the relevance of partitioning keys. Furthermore, in the process of Clu-partitioning, we re-partition data streams by clustering of skewed data streams between the inter-node and the intra-node. Then, we construct the routing table to manage partition states in order to ensure the correctness of multiple query tasks. Finally, we have implemented this framework on Apache Storm. Experiments with synthetic data and real data show that our proposed framework exhibits better query performance.
- 13 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 52517-52527
Open AccessRCD+: A Partitioning Method for Data Streams Based on Multiple Queries
Big data stream management systems often must transform a query application into multiple query tasks, simultaneously and dynamically partitioning data streams based on attribute values or partitioning keys. However, due to different partitioning orders or strategies of partitioning keys, the redundant and repetitive transmission of data streams at different nodes leads to system performance degradation. In addition, with the change of data skewness, the problem of unbalanced data stream partitioning still exists between different processing units within the same node. This paper presents the partitioning framework RCD+ (Runtime Correlation Discovery) according to runtime correlation discovery. RCD+ implements the full granularity partitioning strategy, which includes runtime positive correlation partitioning (RPC-partitioning) and clustering partitioning (Clu-partitioning). First, in the process of RPC-partitioning, we introduce the mini-batch scheme to reduce the number of output stream caches and partition data streams using the relevance of partitioning keys. Furthermore, in the process of Clu-partitioning, we re-partition data streams by clustering of skewed data streams between the inter-node and the intra-node. Then, we construct the routing table to manage partition states in order to ensure the correctness of multiple query tasks. Finally, we have implemented this framework on Apache Storm. Experiments with synthetic data and real data show that our proposed framework exhibits better query performance.
- Open Access
- 27 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 4775-4784
Hybrid Deep Framework for Group Event Recommendation
Group recommender systems suggesting items for a group of users have received many attentions recently. Some aggregation-based and model-based group recommendation methods have been proposed. However, the cold-start problem in group recommendation has not been well studied, which limits the application of group recommendation in many important domains, such as recommending offline events for a group of users. In this paper, we propose a new hybrid deep framework to solve cold-start problem of group event recommendation. Our framework incorporates multiple Restricted Boltzmann Machines (RBM) and conditional RBM. The former extracts high latent group preference from user feedback and group feedback. The latter obtains latent event features based on contextual information, such as location and organizer of events. Thus, the hybrid deep framework can utilize user feedback and contextual information of events to overcome cold-start problem. We conduct exhaustive experiments on two real-world datasets and the results show that our proposed framework outperforms the baseline group recommendation methods and alleviates the cold-start problem of group event recommendation effectively.
- 27 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 4775-4784
Open AccessHybrid Deep Framework for Group Event Recommendation
Group recommender systems suggesting items for a group of users have received many attentions recently. Some aggregation-based and model-based group recommendation methods have been proposed. However, the cold-start problem in group recommendation has not been well studied, which limits the application of group recommendation in many important domains, such as recommending offline events for a group of users. In this paper, we propose a new hybrid deep framework to solve cold-start problem of group event recommendation. Our framework incorporates multiple Restricted Boltzmann Machines (RBM) and conditional RBM. The former extracts high latent group preference from user feedback and group feedback. The latter obtains latent event features based on contextual information, such as location and organizer of events. Thus, the hybrid deep framework can utilize user feedback and contextual information of events to overcome cold-start problem. We conduct exhaustive experiments on two real-world datasets and the results show that our proposed framework outperforms the baseline group recommendation methods and alleviates the cold-start problem of group event recommendation effectively.
- Open Access
- 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 15040-15055
Detecting Interprocedural Infeasible Paths Based on Unsatisfiable Path Constraint Patterns
The static analysis plays an important role in many software engineering activities. However, the existence of infeasible paths, which causes lower program test coverage and several false positives in the results of the static analysis, has become one of the biggest challenges for the static analysis. In this paper, based on unsatisfiable path constraint patterns, we present a new approach to detect interprocedural infeasible paths. In our approach, we first discover nine unsatisfiable path constraint patterns by mining the common path constraint features of a large number of infeasible paths. Then, we detect the interprocedural infeasible paths; a detected path is deemed to be an interprocedural infeasible path if its simplified constraint conditions match one of the nine unsatisfiable path constraint patterns. To illustrate and verify the approach, an experimental study is performed on five open source C projects. The results show that compared with the existing approach, our approach requires less time on average and detects more interprocedural infeasible paths among the given paths.
- 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 15040-15055
Open AccessDetecting Interprocedural Infeasible Paths Based on Unsatisfiable Path Constraint Patterns
The static analysis plays an important role in many software engineering activities. However, the existence of infeasible paths, which causes lower program test coverage and several false positives in the results of the static analysis, has become one of the biggest challenges for the static analysis. In this paper, based on unsatisfiable path constraint patterns, we present a new approach to detect interprocedural infeasible paths. In our approach, we first discover nine unsatisfiable path constraint patterns by mining the common path constraint features of a large number of infeasible paths. Then, we detect the interprocedural infeasible paths; a detected path is deemed to be an interprocedural infeasible path if its simplified constraint conditions match one of the nine unsatisfiable path constraint patterns. To illustrate and verify the approach, an experimental study is performed on five open source C projects. The results show that compared with the existing approach, our approach requires less time on average and detects more interprocedural infeasible paths among the given paths.