YPYichun Peng
Yichun Peng
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yichun Peng has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoyan Guo
School of Computer Science, Zhuhai College of Science Technology, Zhuhai 519000, China
2 shared publications - Yu Li
School of Big Data, Zhuhai College of Science and Technology, Zhuhai, China
2 shared publications - Hai Lin
College of Mathematics and Information Science, Guangxi University, Nanning 530004, China
1 shared publication
Latest Publications
- Open Access
- 23 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1718
Unsupervised Attribute Reduction Algorithms for Multiset-Valued Data Based on Uncertainty Measurement
Missing data introduce uncertainty in data mining, but existing set-valued approaches ignore frequency information. We propose unsupervised attribute reduction algorithms for multiset-valued data to address this gap. First, we define a multiset-valued information system (MSVIS) and establish -tolerance relation to form the information granules. Then, -information entropy and -information amount are introduced as uncertainty measures. Finally, these two UMs are used to design two unsupervised attribute reduction algorithms in an MSVIS. The experimental results demonstrate the superiority of the proposed algorithms, achieving average reductions of 50% in attribute subsets while improving clustering accuracy and outlier detection performance. Parameter analysis further validates the robustness of the framework under varying missing rates.- 23 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1718
Open AccessUnsupervised Attribute Reduction Algorithms for Multiset-Valued Data Based on Uncertainty Measurement
Missing data introduce uncertainty in data mining, but existing set-valued approaches ignore frequency information. We propose unsupervised attribute reduction algorithms for multiset-valued data to address this gap. First, we define a multiset-valued information system (MSVIS) and establish -tolerance relation to form the information granules. Then, -information entropy and -information amount are introduced as uncertainty measures. Finally, these two UMs are used to design two unsupervised attribute reduction algorithms in an MSVIS. The experimental results demonstrate the superiority of the proposed algorithms, achieving average reductions of 50% in attribute subsets while improving clustering accuracy and outlier detection performance. Parameter analysis further validates the robustness of the framework under varying missing rates. - Open Access
- 1 January 2025
- Published by Walter de Gruyter GmbH in Journal of Intelligent Systems
- Vol. 34 (1)
Uncertainty measurement for a three heterogeneous information system based on k -nearest neighborhood: Application to unsupervised attribute reduction
The -nearest-neighbor (KNN) rule is a widely adopted classification technique in machine learning and pattern recognition. Notably, rough set models exhibit a robust capability for decision approximation, making them particularly valuable in handling complex and imprecise data. In practical applications, information systems (IS) often comprise diverse structures of information values. A three-way heterogeneous information system (3HIS) refers to an IS where attribute values encompass three distinct data types: scaled (continuous), ordinal (ranked), and nominal (categorical). This article investigates uncertainty measurement in a 3HIS by leveraging the KNN approach. First, we introduce a specialized distance function designed to compute the dissimilarity between any two information values within each attribute, accounting for the heterogeneity of data types. Building upon this, we propose an enhanced KNN model tailored for a 3HIS, which effectively captures local data structures. By using this model, we construct information granules that facilitate granular computing in heterogeneous data environments. Subsequently, we develop uncertainty quantification tools based on information entropy and information granulation, enabling a rigorous assessment of data inconsistency and ambiguity. To validate the effectiveness of these measurements, we conduct dispersion analysis from a statistical perspective, comparing various uncertainty metrics. Furthermore, we introduce a novel unsupervised attribute reduction algorithm for a 3HIS. The algorithm optimizes feature selection by minimizing redundancy while preserving discriminative power. To evaluate its performance, we employ cluster analysis to demonstrate its efficacy in enhancing data interpret-ability and classification accuracy. These findings provide significant insights into the fundamental nature of uncertainty in a 3HIS.- 1 January 2025
- Published by Walter de Gruyter GmbH in Journal of Intelligent Systems
- Vol. 34 (1)
Open AccessUncertainty measurement for a three heterogeneous information system based on k -nearest neighborhood: Application to unsupervised attribute reduction
The -nearest-neighbor (KNN) rule is a widely adopted classification technique in machine learning and pattern recognition. Notably, rough set models exhibit a robust capability for decision approximation, making them particularly valuable in handling complex and imprecise data. In practical applications, information systems (IS) often comprise diverse structures of information values. A three-way heterogeneous information system (3HIS) refers to an IS where attribute values encompass three distinct data types: scaled (continuous), ordinal (ranked), and nominal (categorical). This article investigates uncertainty measurement in a 3HIS by leveraging the KNN approach. First, we introduce a specialized distance function designed to compute the dissimilarity between any two information values within each attribute, accounting for the heterogeneity of data types. Building upon this, we propose an enhanced KNN model tailored for a 3HIS, which effectively captures local data structures. By using this model, we construct information granules that facilitate granular computing in heterogeneous data environments. Subsequently, we develop uncertainty quantification tools based on information entropy and information granulation, enabling a rigorous assessment of data inconsistency and ambiguity. To validate the effectiveness of these measurements, we conduct dispersion analysis from a statistical perspective, comparing various uncertainty metrics. Furthermore, we introduce a novel unsupervised attribute reduction algorithm for a 3HIS. The algorithm optimizes feature selection by minimizing redundancy while preserving discriminative power. To evaluate its performance, we employ cluster analysis to demonstrate its efficacy in enhancing data interpret-ability and classification accuracy. These findings provide significant insights into the fundamental nature of uncertainty in a 3HIS.