Shuai Li 0019

dblp:57/2281-19 · DBLP profile ↗
← Back
6ranked-venue papers in the field
3as first author
5since 2021 · last 2025
0000-0002-2090-5873ORCID · verified

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 4 (1 first)Database Systems & Data Management · 1 (1 first)Other / Interdisciplinary · 1 (1 first)
YearPublicationVenuePosition
2025 Cost-Sensitive Neighborhood Granularity Selection for Hierarchical Classification
abstract
Multi-label classification represented by hierarchical classification (HC) plays an important role in current large-scale problems, which can acquire a more accurate expression of data that conforms to the human multi-granularity cognitive process. To compress the original dataset and simultaneously enhance the expressive force of models, selecting an appropriate granularity for approximately describing the classification is the main task in the rough set theory. Nevertheless, the current rough set theory merely concerns flat classification and encounters new problems when approximately describing HC. 1) There lacks a measure to correctly reflect misclassification in accordance with the hierarchical accuracy of HC on the training set. 2) There lacks a measure relying on the distribution of the dataset to reflect the difference between two distinct feature sets describing HC in generalization ability. To address the mentioned issues, this paper utilizes the knowledge distance to characterize HC and proposes a cost-sensitive granularity selection for HC. First, HC and features are respectively granulated according to hierarchical quotient space and neighborhood granular structures. Then, knowledge distance and its extended form are employed to formulate misclassification and test costs. On this basis, a cost-sensitive neighborhood granularity selection is presented for HC. Finally, we experimentally demonstrate the excellent performance of the proposed method in terms of efficiency and HC accuracy both in synthetic and real datasets.
Shuai Li 0019, Jie Yang 0052, Huanan Bao, Deyou Xia, Qinghua Zhang 0001, Guoyin Wang 0001
IEEE Trans. Knowl. Data Eng.1
2024 Adaptive three-way KNN classifier using density-based granular balls
Jie Yang 0052, Juncheng Kuang, Guoyin Wang 0001, Qinghua Zhang 0001, Yanmin Liu, Qun Liu 0005, Deyou Xia, Shuai Li 0019, Di Wu 0056
Inf. Sci.8
2024 Attribute reduction for hierarchical classification based on improved fuzzy rough set
Jie Yang 0052, Xiaodan Qin, Guoyin Wang 0001, Qinghua Zhang 0001, Shuai Li 0019, Di Wu 0056
Inf. Sci.5
2022 Local knowledge distance for rough approximation measure in multi-granularity spaces
Deyou Xia, Guoyin Wang 0001, Jie Yang 0052, Qinghua Zhang 0001, Shuai Li 0019
Inf. Sci.5
2021 Multi-granularity distance measure for interval-valued intuitionistic fuzzy concepts
Shuai Li 0019, Jie Yang 0052, Guoyin Wang 0001, Taihua Xu
Inf. Sci.1
2015 On the Cross-Migrativity with Respect to Continuous t-Norms
abstract
Depending on whether α is an idempotent element of the t-norm T0 or not, we study and characterize the structure of a continuous crossmigrative t-norm T with respect to a fixed and continuous t-norm T0, which is indeed the conjecture presented by Fodor et al. (Int J Intell Syst 2012;27:411–428) Results of this paper show that the -cross-migrativity is completely determined by the restriction on a portion of domain of T and have nothing to do with the remaining of [0, 1]2. Moreover, we also clarify the relations between our present results and the previous results.
Shuai Li 0019, János C. Fodor
Int. J. Intell. Syst.1