Shuyin Xia

Shuyin Xia

Auto-generated profile, based on publicly available information

Shuyin Xia

Chongqing University of Posts and Telecommunications

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 May 2019 in Information Sciences
Verified
Journal Article
Closed access
SXShuyin Xia
Shuyin Xia
YLYunsheng Liu
Yunsheng Liu
XDXin Ding
Xin Ding
GWGuoyin Wang
Guoyin Wang
HYHong Yu
Hong Yu
YLYuoguo Luo
Yuoguo Luo

25 May 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SXShuyin Xia
Shuyin Xia
HZHao Zhang
Hao Zhang
WLWenhua Li
Wenhua Li
GWGuoyin Wang
Guoyin Wang
EGElisabeth Giem
Elisabeth Giem
ZCZizhong Chen
Zizhong Chen
Feature reduction is an important aspect of Big Data analytics on today’s ever-larger datasets. Rough sets are a classical method widely applied in attribute reduction. Most rough set algorithms use the priori domain knowledge of a dataset to process continuous attributes through using a membership function. Neighborhood rough sets (NRS) replace the membership function with the concept of neighborhoods, allowing NRS to handle scenarios where no a priori knowledge is available. However, the neighborhood radius of each object in NRS is fixed, and the optimization of the radius depends on grid searching. This diminishes both the efficiency and effectiveness, leading to a time complexity of not lower than $O(N^2)$ . To resolve these limitations, granular ball neighborhood rough sets (GBNRS), a novel NRS method with time complexity $O(N)$ , is proposed. GBNRS adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility in comparison to standard NRS methods. GBNRS is compared with the current state-of-the-art NRS method, FARNeMF, and find that GBNRS obtains both higher performance and higher classification accuracy on public benchmark datasets. All code has been released in the open source GBNRS library at http://www.cquptshuyinxia.com/GBNRS.html .

22 September 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XLXiao Liu
Xiao Liu
CZChenxu Zhang
Chenxu Zhang
FHFuxiang Huang
Fuxiang Huang
SXShuyin Xia
Shuyin Xia
GWGuoyin Wang
Guoyin Wang
LZLei Zhang
Lei Zhang
State space model (SSM) is a mathematical model used to describe and analyze the behavior of dynamic systems. This model has witnessed numerous applications in several fields, including control theory, signal processing, economics, and machine learning. In the field of deep learning, SSMs are used to process sequence data, such as time series analysis, natural language processing (NLP), and video understanding. By mapping sequence data to state space, long-term dependencies in the data can be better captured. In particular, modern SSMs have shown strong representational capabilities in NLP, especially in long sequence modeling, while maintaining linear time complexity. In particular, based on the latest SSMs, Mamba merges time-varying parameters into SSMs toward efficient training and inference. Given its impressive efficiency and strong long-range dependency modeling capability, Mamba is expected to become a new AI architecture that may be capable of surpassing Transformer. Recently, a number of works attempt to study the potential of Mamba in various fields, such as general vision, multimodal learning, medical image analysis, and remote sensing image analysis, by extending Mamba from natural language domain to visual domain. To fully understand Mamba in the visual domain, we conduct a comprehensive survey and present a taxonomy study. This survey focuses on Mamba’s application to a variety of visual tasks and data types, and discusses its predecessors, recent advances, and far-reaching impact on a wide range of domains.

30 August 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SXShuyin Xia
Shuyin Xia
SZShaoyuan Zheng
Shaoyuan Zheng
GWGuoyin Wang
Guoyin Wang
XGXinbo Gao
Xinbo Gao
BWBinggui Wang
Binggui Wang
This article presents a general sampling method, called granular-ball sampling (GBS), for classification problems by introducing the idea of granular computing. The GBS method uses some adaptively generated hyperballs to cover the data space, and the points on the hyperballs constitute the sampled data. GBS is the first sampling method that not only reduces the data size but also improves the data quality in noisy label classification. In addition, because the GBS method can be used to exactly describe the boundary, it can obtain almost the same classification accuracy as the results on the original datasets, and it can obtain an obviously higher classification accuracy than random sampling. Therefore, for the data reduction classification task, GBS is a general method that is not especially restricted by any specific classifier or dataset. Moreover, the GBS can be effectively used as an undersampling method for imbalanced classification. It has a time complexity that is close to O(N), so it can accelerate most classifiers. These advantages make GBS powerful for improving the performance of classifiers. All codes have been released in the open source GBS library at http://www.cquptshuyinxia.com/GBS.html.

1 April 2021 in Information Sciences
Verified
Journal Article
Closed access
BCBaiyun Chen
Baiyun Chen
SXShuyin Xia
Shuyin Xia
ZCZizhong Chen
Zizhong Chen
BWBinggui Wang
Binggui Wang
GWGuoyin Wang
Guoyin Wang

5 October 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SXShuyin Xia
Shuyin Xia
XDXiaochuan Dai
Xiaochuan Dai
GWGuoyin Wang
Guoyin Wang
XGXinbo Gao
Xinbo Gao
EGElisabeth Giem
Elisabeth Giem
Granular-ball computing (GBC) is an efficient, robust, and scalable learning method for granular computing. The granular ball (GB) generation method is based on GB computing. This article proposes a method for accelerating GB generation using division to replace $k$ -means. It can significantly improve the efficiency of GB generation while ensuring an accuracy similar to that of the existing methods. In addition, a new adaptive method for GB generation is proposed by considering the elimination of the GB overlap and other factors. This makes the GB generation process parameter-free and completely adaptive in the true sense. In addition, this study first provides mathematical models for the GB covering. The experimental results on some real datasets demonstrate that the two proposed GB generation methods have accuracies similar to those of the existing method in most cases, while adaptiveness or acceleration is realized. All the codes were released in the open-source GBC library at http://www.cquptshuyinxia.com/GBC.html or https://github.com/syxiaa/gbc