Junpeng Bao

Prof. Dr. Junpeng Bao


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 September 2014 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
JBJunpeng Bao
Junpeng Bao
RYRuiyu Yuan
Ruiyu Yuan
ZBZhe Bao
Zhe Bao
DNA Clustering is an important technology to automatically find the inherent relationships on a large scale of DNA sequences. But the DNA clustering quality can still be improved greatly. The DNA sequences similarity metric is one of the key points of clustering. The alignment-free methodology is a very popular way to calculate DNA sequence similarity. It normally converts a sequence into a feature space based on words’ probability distribution rather than directly matches strings. Existing alignment-free models, e.g. k-tuple, merely employ word frequency information and ignore many types of useful information contained in the DNA sequence, such as classifications of nucleotide bases, position and the like. It is believed that the better data mining results can be achieved with compounded information. Therefore, we present a new alignment-free model that employs compounded information to improve the DNA clustering quality. This paper proposes a Category-Position-Frequency (CPF) model, which utilizes the word frequency, position and classification information of nucleotide bases from DNA sequences. The CPF model converts a DNA sequence into three sequences according to the categories of nucleotide bases, and then yields a 12-dimension feature vector. The feature values are computed by an entropy based model that takes both local word frequency and position information into account. We conduct DNA clustering experiments on several datasets and compare with some mainstream alignment-free models for evaluation, including k-tuple, DMk, TSM, AMI and CV. The experiments show that CPF model is superior to other models in terms of the clustering results and optimal settings. The following conclusions can be drawn from the experiments. (1) The hybrid information model is better than the model based on word frequency only. (2) For DNA sequences no more than 5000 characters, the preferred size of sliding windows for CPF is two which provides a great advantage to promote system performance. (3) The CPF model is able to obtain an efficient stable performance and broad generalization.

20 April 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
JBJunpeng Bao
Junpeng Bao
WWWenqing Wang
Wenqing Wang
TYTianshe Yang
Tianshe Yang
GWGuan Wu
Guan Wu
Many important applications continuously generate data, such as financial transaction administration, satellite monitoring, network flow monitoring, and web information processing. The data mining results are always evolving with the newly generated data. Obviously, for the clustering task, it is better to incrementally update the new clustering results based on the old data rather than to recluster all of the data from scratch. The incremental clustering approach is an essential way to solve the problem of clustering with growing Big Data. This paper proposes a boundary-profile-based incremental clustering (BPIC) method to find arbitrarily shaped clusters with dynamically growing datasets. This method represents the existing clustering results with a collection of boundary profiles and discards the inner points of clusters rather than keep all data. It greatly saves both time and space storage costs. To identify the boundary profile, this paper presents a boundary-vector-based boundary point detection (BV-BPD) algorithm that summarizes the structure of the existing clusters. The BPIC method processes each new point in an online fashion and updates the clustering results in a batch mode. When a new point arrives, the BPIC method either immediately labels it or temporarily puts it into a bucket according to the relationship between the new data and the boundary profiles. A bucket is employed to distinguish the noise from the potential seeds of new clusters and alleviate the effects of data order. When the bucket is full, the BPIC method will cluster the data within it and update the clustering results. Thus, the BPIC method is insensitive to noise and the order of new data, which is critical for the robustness of the incremental clustering process. In the experiments, the performance of the boundary point detection algorithm BV-BPD is compared with the state-of-the-art method. The results show that the BV-BPD is better than the state-of-the-art method. Additionally, the performance of BPIC and other two incremental clustering methods are investigated in terms of clustering quality, time and space efficiency. The experimental results indicate that the BPIC method is able to get a qualified clustering result on a large dataset with higher time and space efficiency.

23 January 2025 in Electronics
Verified
Journal Article
Open access
PDF file
BSBin Song
Bin Song
BGBoyu Guo
Boyu Guo
WHWei Hu
Wei Hu
ZZZhen Zhang
Zhen Zhang
NZNan Zhang
Nan Zhang
JXJingmin Xin
Jingmin Xin
Safety and stability are critical in manned space missions, requiring an environmental control and life support system (ECLSS) of spacecraft to operate reliably. This study analyzed the time-series characteristics of telemetry data, including total pressure, temperature, and humidity, to predict the ECLSS’s operational state. Existing algorithms for time-series forecasting, including ARIMA, LSTM, TCN, and NBEATS, often struggle with long-sequence forecasting and discrepancies in data distribution, which hinder their ability to deliver accurate predictions. To address these challenges, this study introduces a two-stage normalization method, mean instance normalization (MeanIN), designed to adjust input data distributions and restore output data distributions, thereby significantly enhancing predictive performance. Experimental evaluations on ECLSS telemetry data demonstrate that MeanIN consistently improves model accuracy, with the informer model achieving superior results in long-sequence forecasting tasks. These results underscore the efficacy of MeanIN and its potential to support critical applications in anomaly detection and predictive analysis for spacecraft telemetry data.

6 April 2005 in Soft Computing
Verified
Journal Article
Closed access
PDF file
JBJunpeng Bao
Junpeng Bao
JSJun-Yi Shen
Jun-Yi Shen
HLHaiyan Liu
Haiyan Liu
Xiaodong LiuXiaodong Liu
Xiaodong Liu

7 July 2007 in Language Resources and Evaluation
Verified
Journal Article
Closed access
PDF file
JBJunpeng Bao
Junpeng Bao
CLCaroline Lyon
Caroline Lyon
PLPeter C. R. Lane
Peter C. R. Lane

12 December 2025 in Neurocomputing
Verified
Journal Article
Closed access
JBJunpeng Bao
Junpeng Bao
JTJiabo Tian
Jiabo Tian
XJXingchen Jia
Xingchen Jia
YHYifeng Huang
Yifeng Huang