Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tao Zhan 0004

dblp:43/6393-4 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0003-2603-544XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › dimensionality reduction
feature selection
0.912025
Adaptive Hyper-Box Granulation With Justifiable Granularity for Feature Selection · IEEE Trans. Knowl. Data Eng. 2025
Data mining
granular computing
0.912025
Adaptive Hyper-Box Granulation With Justifiable Granularity for Feature Selection · IEEE Trans. Knowl. Data Eng. 2025

Methods — techniques the papers use, named apart from their topics

rough sets · 0.9granular computing · 0.9
YearPublicationVenuePosition
2025 Adaptive Hyper-Box Granulation With Justifiable Granularity for Feature Selection
Wentao Li 0004, Witold Pedrycz, Chao Zhang 0046, Tao Zhan 0004
IEEE Trans. Knowl. Data Eng.5
2025 Granular-Ball Regeneration Clustering With Principle of Justifiable Granularity
abstract
Classical clustering algorithms such as k-means face limitations in handling clusters with heterogeneous shapes, densities, and sizes, while exhibiting sensitivity to initial centroid selection. To overcome these challenges, this article proposes a novel clustering framework based on regenerated granular ball (RGGB) with the principle of justifiable granularity. Unlike existing granular-ball (GB) techniques that overemphasize purity criteria at the expense of uncontrolled ball sizes, RGGB dynamically adjusts granularity levels through iterative regeneration, achieving an optimal balance between detailed data representation and computational efficiency. This adaptability enhances stability in capturing data similarities while mitigating sensitivity to initialization. To validate the method, we integrate RGGB with a novel k-nearest neighbor (KNN) classifier using regenerated GBs to evaluate classification performance and demonstrate practical applications. Experiments on diverse public and realistic datasets demonstrate that the RGGB-based KNN algorithm consistently outperforms existing techniques, including traditional KNN and other methods, making a promising advancement in clustering and classification tasks.
Wentao Li 0004, Lingwei Wei, Witold Pedrycz, Weiping Ding 0001, Chao Zhang 0046, Tao Zhan 0004, Shuyin Xia
IEEE Trans. Neural Networks Learn. Syst.6
2024 Adaptive Sliding Mode Control for Nonlinear Impulsive Time-Delay Hybrid Systems
abstract
This article investigates the adaptive sliding mode control (ASMC) for a class of nonlinear impulsive hybrid systems with time-varying delay, adopting a creative approach that emphasizes the switching perspective. When both impulse and sliding mode control are involved in the time-delay system, ensuring the continuity of the sliding mode function (SMF) and achieving the reachability of system states become crucial challenges that need to be addressed. In view of this, a novel impulse-based SMF is developed such that the impulsive effect can be avoided on sliding surface, and the difficulty of its continuity is also settled at impulsive instants. By using the state augmented approach, the delay-dependent Lyapunov function with switched systems is formulated to guarantee robust stability of the given sliding mode dynamics. Meanwhile, the designed ASMC law is derived to achieve the finite reachability of switching surface for system states. It is shown that the proposed ASMC law offers a high degree of freedom for adjusting the constants in nonlinear assumptions. Finally, comparative studies are conducted to validate the theoretical results and demonstrate their practical applicability.
Tao Zhan 0004, Yuanqing Xia, Wentao Li 0004, Witold Pedrycz, Shuping Ma
IEEE Trans. Syst. Man Cybern. Syst.1
2023 Dynamic maintenance of updating rough approximations in interval-valued ordered decision systems
Haoxiang Zhou, Wentao Li 0004, Chao Zhang 0046, Tao Zhan 0004
Appl. Intell.4
2023 Feature Selection Approach Based on Improved Fuzzy C-Means With Principle of Refined Justifiable Granularity
abstract
Fuzzy C-means (FCM) is a clustering algorithm based on partition of the universe. However, the partition generated by an equivalence relation is strict in practical application and exhibits relatively poor fault-tolerant mechanism. In this article, a novel binary relation based on improved FCM with the principle of refined justifiable granularity is presented. Different expressions of the proposed binary relation under different values of weight parameter are discussed, and the changes of the properties of the binary relation under different parameter values are provided. By measuring the significance of attributes in the feature space, a feature selection method, called forward heuristic feature selection (FHFS), is designed to construct the low-dimension feature space based on maximizing the original data and information retention through the defined degrees of aggregation and dispersion. It is shown how the results of feature selection and classification performance vary when the values of the weight factor locate in different ranges. To illustrate the superiority and effectiveness of the proposed FHFS algorithm, nine high-dimensional datasets and eight image datasets from University of California-Irvine (UCI) repository are used and compared with other feature selection methods, respectively. The results of experimental evaluation and the significance test show that the proposed learning mechanism is a superior algorithm.
Wentao Li 0004, Shichao Zhai, Weihua Xu 0003, Witold Pedrycz, Weiping Ding 0001, Tao Zhan 0004
IEEE Trans. Fuzzy Syst.7
2022 Exponential Stability of Fractional-Order Switched Systems With Mode-Dependent Impulses and Its Application
abstract
Most exiting results for impulsive switched systems (ISSs) are mainly built on the synchronous switching and impulses case; however, the impulses can not only occur in switched interval including switched instants but also the switched signals may exist between two impulsive points in practical instants. Under asynchronous impulses and switching signals, the main objective of this article is to study the exponential stability of fractional-order hybrid systems. In order to better characterize stability, some novel criteria are presented by adopting the mode-dependent average impulsive interval and induction method. The obtained impulsive switched criteria lead to a tradeoff between fractional-order α and impulsive strength. Especially, the impulsive effects (positive or negative) with the order α are also discussed in detail, which extends the previous integer order results. Moreover, numerical examples are given to interpret and verify the effectiveness of the obtained criteria.
Tao Zhan 0004, Shuping Ma, Wentao Li 0004, Witold Pedrycz
IEEE Trans. Cybern.1
2020 Double-quantitative variable consistency dominance-based rough set approach
Wentao Li 0004, Xiaoping Xue 0001, Weihua Xu 0003, Tao Zhan 0004, Bingjiao Fan
Int. J. Approx. Reason.4