Wenjia Niu

Ms. Wenjia Niu

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
22 June 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
WNWenjia Niu
Wenjia Niu
KZKaihao Zhang
Kaihao Zhang
DLDongxu Li
Dongxu Li
WLWenhan Luo
Wenhan Luo

2 July 2015 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
PXPing Xiong
Ping Xiong
TZTianqing Zhu
Tianqing Zhu
WNWenjia Niu
Wenjia Niu
Gang LiGang Li
Gang Li

1 January 2024
Verified
Conference Paper
Open access
PDF file
QZQixuan Zhang
Qixuan Zhang
ZWZhifeng Wang
Zhifeng Wang
DZDylan Zhang
Dylan Zhang
WNWenjia Niu
Wenjia Niu
SCSabrina Caldwell
Sabrina Caldwell
ZQZhenyue Qin
Zhenyue Qin
Qixuan Zhang, Zhifeng Wang, Dylan Zhang, Wenjia Niu, Sabrina Caldwell, Tom Gedeon, Yang Liu, Zhenyue Qin. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

8 February 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YPyongke Pan
yongke Pan
Kewen XiaKewen Xia
Kewen Xia
WNWenjia Niu
Wenjia Niu
ZHZiping He
Ziping He
In many fields, such as oil logging, it is expensive to obtain labeled data, and a large amount of inexpensive unlabeled data are not used. Therefore, it is necessary to use semisupervised learning to obtain accurate classification with limited labeled data and many unlabeled data. The semisupervised support vector machine (S3VM) is the most useful method in semisupervised learning. Nevertheless, S3VM model performance will degrade when the sample number of categories is not even or have lots of unlabeled samples. Thus, a new semisupervised SVM by hybrid whale optimization algorithm (HWOA-S3VM) is proposed in this paper. Firstly, a tradeoff control parameter is added in S3VM to deal with an uneven sample of category which can cause S3VM to degrade. Then, a hybrid whale optimization algorithm (HWOA) is used to optimize the model parameters of S3VM to increase the classification accuracy. For HWOA improvement, an opposition-based cubic mapping is used to initialize the WOA population to improve the convergence speed, and the catfish effect is used to help WOA jump out of the local optimum and obtain the global optimization ability. In the experiments, firstly, the HWOA is tested by 12 classic benchmark functions of CEC2005 and four functions of CEC2014 compared with the other five algorithms. Then, six UCI datasets are used to test the performance of HWOA-S3VM and compared with the other four algorithms. Finally, we applied HWOA-S3VM to perform oil layer recognition of three oil well datasets. These experimental results show that (1) HWOA has a higher convergence speed and better global searchability than other algorithms. (2) HWOA-S3VM model has higher classification accuracy on UCI datasets than other algorithms when combined, labeled, and unlabeled data are used as the training dataset. (3) The recognition accuracy and speed of the HWOA-S3VM model are superior to the other four algorithms when applied in oil layer recognition.

1 January 2017 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
BZBaokai Zu
Baokai Zu
Kewen XiaKewen Xia
Kewen Xia
YPYongke Pan
Yongke Pan
WNWenjia Niu
Wenjia Niu
Semisupervised Discriminant Analysis (SDA) is a semisupervised dimensionality reduction algorithm, which can easily resolve the out-of-sample problem. Relative works usually focus on the geometric relationships of data points, which are not obvious, to enhance the performance of SDA. Different from these relative works, the regularized graph construction is researched here, which is important in the graph-based semisupervised learning methods. In this paper, we propose a novel graph for Semisupervised Discriminant Analysis, which is called combined low-rank and k-nearest neighbor (LRKNN) graph. In our LRKNN graph, we map the data to the LR feature space and then the kNN is adopted to satisfy the algorithmic requirements of SDA. Since the low-rank representation can capture the global structure and the k-nearest neighbor algorithm can maximally preserve the local geometrical structure of the data, the LRKNN graph can significantly improve the performance of SDA. Extensive experiments on several real-world databases show that the proposed LRKNN graph is an efficient graph constructor, which can largely outperform other commonly used baselines.

9 April 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
WNWenjia Niu
Wenjia Niu
Kewen XiaKewen Xia
Kewen Xia
YPyongke Pan
yongke Pan
In general dynamic scenes, blurring is the result of the motion of multiple objects, camera shaking or scene depth variations. As an inverse process, deblurring extracts a sharp video sequence from the information contained in one single blurry image—it is itself an ill-posed computer vision problem. To reconstruct these sharp frames, traditional methods aim to build several convolutional neural networks (CNN) to generate different frames, resulting in expensive computation. To vanquish this problem, an innovative framework which can generate several sharp frames based on one CNN model is proposed. The motion-based image is put into our framework and the spatio-temporal information is encoded via several convolutional and pooling layers, and the output of our model is several sharp frames. Moreover, a blurry image does not have one-to-one correspondence with any sharp video sequence, since different video sequences can create similar blurry images, so neither the traditional pixel2pixel nor perceptual loss is suitable for focusing on non-aligned data. To alleviate this problem and model the blurring process, a novel contiguous blurry loss function is proposed which focuses on measuring the loss of non-aligned data. Experimental results show that the proposed model combined with the contiguous blurry loss can generate sharp video sequences efficiently and perform better than state-of-the-art methods.