Some characteristics of matroids through rough sets - Lirun Su; William Zhu 001 (CoRR, 2012)

Condition for covering-based upper approximation operators to be closure operators of matroids. - Lirun Su; William Zhu 001 (Int. J. Granul. Comput. Rough Sets Intell. Syst., 2013)

A Spanning Matroidal Structure in Rough Sets and Its Axiomatic Characterizations. - Lirun Su; Peng Xiao; Yan Lin; Hong Chen (FSDM, 2017)

Closed-set lattice and modular matroid induced by covering-based rough sets. - Lirun Su; William Zhu 001 (Int. J. Mach. Learn. Cybern., 2017)

Dependence space of topology and its application to attribute reduction. - Lirun Su; William Zhu 001 (Int. J. Mach. Learn. Cybern., 2018)

On Axiomatic Characterizations of Positive-Negative Region Covering-Based Rough Sets. - Lirun Su; Yan Lin; Xiao Zhao (FSDM, 2019)

Matrix approach to spanning matroids of rough sets and its application to attribute reduction. - Lirun Su; Fusheng Yu (Theor. Comput. Sci., 2021)

Incremental updating reduction for relation decision systems with dynamic conditional relation sets. - Lirun Su; Fusheng Yu; Jinjin Li; Xubo Du; Hanliang Huang (Inf. Sci., 2023)

Federated learning with three-way decisions for privacy-preserving multicloud resource scheduling. - Chunmao Jiang; Lirun Su (Appl. Soft Comput., 2025)