Yue Xu

Yue Xu

Auto-generated profile, based on publicly available information

Yue Xu

School of Computer Science, Queensland University of Technology, Brisbane, Australia

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
3 February 2024 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
KBkamal berahmand
kamal berahmand
Fatemeh DaneshfarFatemeh Daneshfar
Fatemeh Daneshfar
ESElaheh Sadat Salehi
Elaheh Sadat Salehi
Yuefeng LiYuefeng Li
Yuefeng Li
YXYue Xu
Yue Xu
Autoencoders have become a hot researched topic in unsupervised learning due to their ability to learn data features and act as a dimensionality reduction method. With rapid evolution of autoencoder methods, there has yet to be a complete study that provides a full autoencoders roadmap for both stimulating technical improvements and orienting research newbies to autoencoders. In this paper, we present a comprehensive survey of autoencoders, starting with an explanation of the principle of conventional autoencoder and their primary development process. We then provide a taxonomy of autoencoders based on their structures and principles and thoroughly analyze and discuss the related models. Furthermore, we review the applications of autoencoders in various fields, including machine vision, natural language processing, complex network, recommender system, speech process, anomaly detection, and others. Lastly, we summarize the limitations of current autoencoder algorithms and discuss the future directions of the field.

12 May 2011 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
Xujuan ZhouXujuan Zhou
Xujuan Zhou
YXYue Xu
Yue Xu
Yuefeng LiYuefeng Li
Yuefeng Li
AJAudun Josang
Audun Josang
CCClive Cox
Clive Cox

1 January 2018 in Information Sciences
Verified
Journal Article
Closed access
FLFenglian Li
Fenglian Li
XZXueying Zhang
Xueying Zhang
XZXiqian Zhang
Xiqian Zhang
CDChunlei Du
Chunlei Du
YXYue Xu
Yue Xu
YTYu-Chu Tian
Yu-Chu Tian

28 September 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
KBkamal berahmand
kamal berahmand
MMMehrnoush Mohammadi
Mehrnoush Mohammadi
FSFarid Saberi-Movahed
Farid Saberi-Movahed
Yuefeng LiYuefeng Li
Yuefeng Li
YXYue Xu
Yue Xu
Community detection has become an important research topic in machine learning due to the proliferation of network data. However, most existing methods have been developed based on only exploiting the topology structures of the network, which can result in missing the advantage of using the nodes' attribute information. As a result, it is expected that much valuable information that could be used to improve the quality of discovered communities will be ignored. To solve this limitation, we propose a novel Augment Graph Regularization Nonnegative Matrix Factorization for Attributed Networks (AGNMF-AN) method, which is simple yet effective. Firstly, Augment Attributed Graph (AAG) is applied to combine both the topological structure and attributed nodes of the network. Secondly, we introduced an effective framework to update the affinity matrix, in which the affinity matrix's weight in each iteration is modified adaptively instead of using a fixed affinity matrix in the classical graph regularization-based nonnegative matrix factorization methods. Thirdly, the $l_{2,1}$ -norm is utilized to reduce the effect of random noise and outliers in the quality of structure community. Experimental results show that our method performs unexpectedly well in comparison to existing state-of-the-art methods in attributed networks.

16 April 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KBkamal berahmand
kamal berahmand
SBSondos Bahadori
Sondos Bahadori
MAMaryam Nooraei Abadeh
Maryam Nooraei Abadeh
Yuefeng LiYuefeng Li
Yuefeng Li
YXYue Xu
Yue Xu
Attributed graph clustering aims to group nodes into disjoint categories using deep learning to represent node embeddings and has shown promising performance across various applications. However, two main challenges hinder further performance improvement. First, reliance on unsupervised methods impedes the learning of low-dimensional, clustering-specific features in the representation layer, thus impacting clustering performance. Second, the predominant use of separate approaches leads to suboptimal learned embeddings that are insufficient for subsequent clustering steps. To address these limitations, we propose a novel method called Semi-supervised Deep Attributed Clustering using Dual Autoencoder (SDAC-DA). This approach enables semi-supervised deep end-to-end clustering in attributed networks, promoting high structural cohesiveness and attribute homogeneity. SDAC-DA transforms the attribute network into a dual-view network, applies a semi-supervised autoencoder layering approach to each view, and integrates dimensionality reduction matrices by considering complementary views. The resulting representation layer contains high clustering-friendly embeddings, which are optimized through a unified end-to-end clustering process for effectively identifying clusters. Extensive experiments on both synthetic and real networks demonstrate the superiority of our proposed method over seven state-of-the-art approaches.

13 March 2017 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YLYuefeng Li
Yuefeng Li
LZLibiao Zhang
Libiao Zhang
YXYue Xu
Yue Xu
YYYiyu Yao
Yiyu Yao
RLRaymond Yiu Keung Lau
Raymond Yiu Keung Lau
YWYutong Wu
Yutong Wu
Text classification is a process of classifying documents into predefined categories through different classifiers learned from labelled or unlabelled training samples. Many researchers who work on binary text classification attempt to find a more effective way to separate relevant texts from a large data set. However, current text classifiers cannot unambiguously describe the decision boundary between positive and negative objects because of uncertainties caused by text feature selection and the knowledge learning process. This paper proposes a three-way decision model for dealing with the uncertain boundary to improve the binary text classification performance based on the rough set techniques and centroid solution. It aims to understand the uncertain boundary through partitioning the training samples into three regions (the positive, boundary, and negative regions) by two main boundary vectors $\vec{C_{P}}$ and $\vec{C_{N}}$ , created from the labeled positive and negative training subsets, respectively, and further resolve the objects in the boundary region by two derived boundary vectors $\vec{B_{P}}$ and $\vec{B_{N}}$ , produced according to the structure of the boundary region. It involves an indirect strategy which is composed of two successive steps in the whole classification process: ‘two-way to three-way’ and ‘three-way to two-way’. Four decision rules are proposed from the training process and applied to the incoming documents for more precise classification. A large number of experiments have been conducted based on the standard data sets RCV1 and Reuters-21578. The experimental results show that the usage of boundary vectors is very effective and efficient for dealing with uncertainties of the decision boundary, and the proposed model has significantly improved the performance of binary text classification in terms of $F_{1}$ measure and $AUC$ area compared with six other popular baseline models.