Xuekun Song
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
Xuekun Song has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Guozhi Li
School of Information Technology, Henan University of Chinese Medicine, Zhengzhou 450046, China
3 shared publications - Honglei Zhu
School of Information Technology , Henan University of Chinese Medicine , Zhengzhou 450046 , China
2 shared publications - Juntao Li
College of Mathematics and Information Science, Henan Normal University, Xinxiang, China
2 shared publications - Ruichang Li
School of Information Technology, Henan University of Chinese Medicine, Zhengzhou, 450046 China
2 shared publications - Fan Liao
School of Information and Technology, Henan University of Chinese Medicine, Zhengzhou, 450000, China
1 shared publication - Huimin Xiao
School of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou 450046, China
1 shared publication
Latest Publications
- Open Access
- 22 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 79986-79998
Edge Blockchain Construction Efficiency Maximization for COVID-19 Detection in a Body Area Network
Detecting traces of patients with novel coronavirus pneumonia (COVID-19) is a prerequisite for avoiding the virus’s rapid spread. However, too much patient privacy data uploaded to the cloud centre will overwhelm the network and cause user information security not to be guaranteed. In this paper, we propose a personal prediction method for COVID-19 infections by perceiving the information of worn biosensors and monitoring equipment in a body area network (BAN). Edge computing and blockchain technology are introduced to solve the problems of user privacy protection and perceptual data transmission and storage. We first construct an edge body area network (EBAN) and characterize the edge blockchain cost’s maximization function by considering the bandwidth, storage space, and energy consumption constraints. Then we build a blockchain without redundant perception information and select effective transmission paths by using the edge blockchain construction efficiency maximization (EBCEM) algorithm. Finally, we use the network simulator (NS-2) to simulate the performance of the EBCEM algorithm and compare it with the excellent assignment game algorithm (AGA) in terms of the effective requester ratio (ERR), effective provider ratio (EPR), edge blockchain construction success ratio (EBCSR), and average storage usage ratio (ASUR) in the EBAN.
- 22 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 79986-79998
Open AccessEdge Blockchain Construction Efficiency Maximization for COVID-19 Detection in a Body Area Network
Detecting traces of patients with novel coronavirus pneumonia (COVID-19) is a prerequisite for avoiding the virus’s rapid spread. However, too much patient privacy data uploaded to the cloud centre will overwhelm the network and cause user information security not to be guaranteed. In this paper, we propose a personal prediction method for COVID-19 infections by perceiving the information of worn biosensors and monitoring equipment in a body area network (BAN). Edge computing and blockchain technology are introduced to solve the problems of user privacy protection and perceptual data transmission and storage. We first construct an edge body area network (EBAN) and characterize the edge blockchain cost’s maximization function by considering the bandwidth, storage space, and energy consumption constraints. Then we build a blockchain without redundant perception information and select effective transmission paths by using the edge blockchain construction efficiency maximization (EBCEM) algorithm. Finally, we use the network simulator (NS-2) to simulate the performance of the EBCEM algorithm and compare it with the excellent assignment game algorithm (AGA) in terms of the effective requester ratio (ERR), effective provider ratio (EPR), edge blockchain construction success ratio (EBCSR), and average storage usage ratio (ASUR) in the EBAN.
- Open Access
- 1 May 2022
- Published by Elsevier in Future Generation Computer Systems
- Vol. 130, 19-32
Strategy for dynamic blockchain construction and transmission in novel edge computing networks
- 1 May 2022
- Published by Elsevier in Future Generation Computer Systems
- Vol. 130, 19-32
Open AccessStrategy for dynamic blockchain construction and transmission in novel edge computing networks
- 1 February 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 141, 105154
Logistic regression with adaptive sparse group lasso penalty and its application in acute leukemia diagnosis
- 1 February 2022
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 141, 105154
Logistic regression with adaptive sparse group lasso penalty and its application in acute leukemia diagnosis
- Open Access
- 30 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 214332-214345
Data Distribution Optimization Strategy in Wireless Sensor Networks With Edge Computing
Resource-constrained wireless sensor networks (WSNs) impose a substantial challenge to the transmission and processing of non-redundant perceptual data. Moreover, breakthroughs in this area have opened up a new dimension that integrates edge computing technology in wireless sensor networks. However, achieving reliable data distribution in wireless sensor networks with edge computing (EWSN) and balancing the link bandwidth and node energy resources have become challenging problems. In this article, we propose a joint bandwidth allocation and energy consumption (JBAEC) algorithm for distributing different perceptual data to different sensor nodes of the EWSN by considering the available transmission links between the source sensor and destination nodes under the condition of early perceived energy. Therefore, we first establish the model of different data packet types and energy detection costs. Second, we describe the problem of effective bandwidth allocation and prove its NP-hard feature. In addition, we formulate the bandwidth allocation problem as an optimization problem that is divided into the two states of sufficient energy and lack of energy. Afterwards, we present an available node selection (ANS) algorithm for sorting the available relay nodes under the condition of different energy-sufficient nodes. The effective transmission network construction (ETNC) algorithm selects the available transmission links based on the set of available nodes. Finally, we implement the JBAEC algorithm by using the NS-2 simulator and present extensive simulation results to verify the data distribution efficiency of the JBAEC algorithm in the EWSN.
- 30 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 214332-214345
Open AccessData Distribution Optimization Strategy in Wireless Sensor Networks With Edge Computing
Resource-constrained wireless sensor networks (WSNs) impose a substantial challenge to the transmission and processing of non-redundant perceptual data. Moreover, breakthroughs in this area have opened up a new dimension that integrates edge computing technology in wireless sensor networks. However, achieving reliable data distribution in wireless sensor networks with edge computing (EWSN) and balancing the link bandwidth and node energy resources have become challenging problems. In this article, we propose a joint bandwidth allocation and energy consumption (JBAEC) algorithm for distributing different perceptual data to different sensor nodes of the EWSN by considering the available transmission links between the source sensor and destination nodes under the condition of early perceived energy. Therefore, we first establish the model of different data packet types and energy detection costs. Second, we describe the problem of effective bandwidth allocation and prove its NP-hard feature. In addition, we formulate the bandwidth allocation problem as an optimization problem that is divided into the two states of sufficient energy and lack of energy. Afterwards, we present an available node selection (ANS) algorithm for sorting the available relay nodes under the condition of different energy-sufficient nodes. The effective transmission network construction (ETNC) algorithm selects the available transmission links based on the set of available nodes. Finally, we implement the JBAEC algorithm by using the NS-2 simulator and present extensive simulation results to verify the data distribution efficiency of the JBAEC algorithm in the EWSN.
- 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
- 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.
- 1 September 2018
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 100, 1-9
Adaptive multinomial regression with overlapping groups for multi-class classification of lung cancer
- 1 September 2018
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 100, 1-9
Adaptive multinomial regression with overlapping groups for multi-class classification of lung cancer