HLHuirong Li

Huirong Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Huirong Li has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Intuitionistic Fuzzy Decision Tree Temporal Logic and Its Application in Engineering Decision-Making

    by Xianfeng Yu, Jianhua Zhao, Famin Ma, Lei Wang, Huirong Li

    This paper investigates engineering decision optimization in uncertain environments. Subject to constraints on cost and expected returns, engineering decisions optimize material input, equipment selection and process arrangement to minimize costs and maximize economic benefits. As an efficient formal verification technique, model checking offers a new approach to addressing this problem. Traditional model checking focuses on qualitative verification, while quantitative approaches, including probabilistic and possibilistic model checking, have been gradually developed. Among them, possibilistic model checking is more applicable to systems with fuzzy uncertainty. However, existing possibilistic model-checking techniques have notable limitations: they are only designed for closed systems and ignore interactions between the system and external environments; their simplistic information aggregation leads to information asynchrony and loss; and they cannot model and verify systems with incomplete information. Model checking based on possibilistic decision processes enables the selection of uncertain actions and initially resolves the modeling and verification of open systems. In our previous work, we introduced quality constraints into possibilistic temporal logic to mitigate information asynchrony and loss. We also established the theories of intuitionistic fuzzy Kripke structure (IFKS) and Intuitionistic Fuzzy Computation Tree Logic (IFCTL), which support the modeling and verification of systems with incomplete information. To improve the practicality and accuracy of engineering decisions, this study adopts the ideas of uncertain decision-making behavior selection, quality constraints and incomplete information modeling. It extends IFKS to the Weighted Intuitionistic Fuzzy Kripke Structure (WIFKS) and evolves IFCTL into the intuitionistic fuzzy decision tree logic (IFDTL). We further propose an IFDTL model-checking algorithm and a multi-attribute engineering decision algorithm based on the proposed method, along with corresponding correctness proofs and complexity analysis. A case study on Qinling health-preserving tourism planning verifies the rationality and effectiveness of the presented approach. This research provides a novel formal solution for engineering decision-making under uncertainty.

  • Open Access

    Intuitionistic Fuzzy Decision Trees Temporal Logic and Its Application in Engineering Decision-Making

    by Xian-Feng Yu, Jianhua Zhao, Famin Ma, Lei Wang, Huirong Li

    This paper focuses on the optimization of engineering decision-making under uncertain environments. Engineering decision-making requires optimizing the input of production materials and the selection of equipment and processes under the constraints of cost and expected return to minimize costs and maximize production benefits. As an efficient formal verification technique, model checking provides a new approach to solve this problem. Traditional model checking mainly focuses on qualitative verification, while quantitative model checking techniques (such as probabilistic and possibilistic model checking) have been developed gradually, among which possibilistic model checking is more suitable for systems with fuzzy uncertainty. However, existing possibilistic model checking techniques have obvious defects: first, they only target closed systems and do not consider the interaction between the system and the external environment; second, the simple information aggregation method leads to information desynchronization and information loss; third, they cannot model and verify systems with incomplete information. Model checking technology based on possibilistic decision processes considers uncertain action selection and initially solves the problem of modeling and verification of open systems. The author has introduced the idea of quality constraints into possibilistic temporal logic to solve the problems of information desynchronization and information loss in possibilistic model checking; moreover, the author has established the theories of Intuitionistic Fuzzy Kripke Structure (IFKS) and Intuitionistic Fuzzy Computation Tree Logic (IFCTL), which can model and verify systems with incomplete information. To improve the usability and accuracy of engineering decisions, this paper will draw on the ideas and methods of uncertain selection of decision behaviors, quality constraints, and incompleteness modeling, extend IFKS to Weighted Intuitionistic Fuzzy Kripke Structure (WIFKS), induce IFCTL to Intuitionistic Fuzzy Decision Tree Logic (IFDTL), propose an algorithm for solving IFDTL model checking problems, and present a solution algorithm for multi-attribute engineering decision-making based on IFDTL model checking, along with its correctness proof and complexity analysis. Finally, a case study of Qinling health-preserving tourism planning is given to verify the rationality and efficiency of the proposed method, providing a new formal solution for uncertain engineering decision-making.

  • Open Access

    Robust Unsupervised Feature Selection Algorithm Based on Fuzzy Anchor Graph

    by Zhouqing Yan, Ziping Ma, Jinlin Ma, Huirong Li

    Unsupervised feature selection aims to characterize the cluster structure of original features and select the optimal subset without label guidance. However, existing methods overlook fuzzy information in the data, failing to model cluster structures between data effectively, and rely on squared error for data reconstruction, exacerbating noise impact. Therefore, a robust unsupervised feature selection algorithm based on fuzzy anchor graphs (FWFGFS) is proposed. To address the inaccuracies in neighbor assignments, a fuzzy anchor graph learning mechanism is designed. This mechanism models the association between nodes and clusters using fuzzy membership distributions, effectively capturing potential fuzzy neighborhood relationships between nodes and avoiding rigid assignments to specific clusters. This soft cluster assignment mechanism improves clustering accuracy and the robustness of the graph structure while maintaining low computational costs. Additionally, to mitigate the interference of noise in the feature selection process, an adaptive fuzzy weighting mechanism is presented. This mechanism assigns different weights to features based on their contribution to the error, thereby reducing errors caused by redundant features and noise. Orthogonal tri-factorization is applied to the low-dimensional representation matrix. This guarantees that each center represents only one class of features, resulting in more independent cluster centers. Experimental results on 12 public datasets show that FWFGFS improves the average clustering accuracy by 5.68% to 13.79% compared with the state-of-the-art methods.


  • Open Access

    Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking

    by Xianfeng Yu, Yongming Li, Shengling Geng, Huirong Li

    The encapsulation of particular quality functions and predicates within temporal logic formulas markedly enhances the representation of detailed temporal characteristics within a system. During our preliminary investigations, we innovatively combined quality constraint functions and predicates with Possibility Linear Temporal Logic (PoLTL), yielding the conception of Fuzzy Linear Temporal Logic with Quality Constraints (QFLTL). This amalgamation results in a significant elevation of QFLTL’s expressivity relative to PoLTL, ensuring the preservation of informational integrity whilst achieving a synchronized, yet selectively inclined, and exact consolidation of path reachability specifics alongside property satisfaction evaluations. This treatise represents a significant contribution to the field by integrating quality constraint functions and predicates into Possibility Computation Tree Temporal Logic (PoCTL), thus giving rise to Fuzzy Computation Tree Temporal Logic with Quality Constraints (QFCTL). We provide a comprehensive definition of QFCTL’s syntax, conduct an in-depth analysis of its logical characteristics, outline a precise model checking algorithm for QFCTL, and perform a meticulous complexity assessment of said algorithm. It is illustrated by examples that PoCTL is a proper subset of QFCTL, and QFCTL has stronger expressive power than PoCTL and can characterize more refined temporal properties of the system. An in-depth exploration of the logical characteristics of QFCTL was carried out, showing its unique logical characteristics that are distinct from other temporal logic systems under the influence of quality constraints. In particular, the introduction of characteristic predicates effectively classifies the satisfaction of temporal formulas, making the logical framework of QFCTL more complete compared to the existing probabilistic temporal logic. Moreover, by enriching QFCTL with a quantitative characteristic predicate operator, we innovate, culminating in the development of an enhanced Fuzzy Computation Tree Temporal Logic with Quality Constraints (QFCTL*). The logical characteristics of QFCTL* are explored in detail. It is shown that with the support of quantitative feature predicates, QFCTL* can divide the satisfaction of temporal formulas more delicately than QFCTL. The decision theorems for the semantics of QFCTL* formulas containing quantitative feature predicates are given, and the decidability of QFCTL* is strictly proved. Through the bounded-depth search of GPKS, a model-checking algorithm of QFCTL* on GPKS is presented. The correctness of the algorithm is proved, and the complexity of the algorithm is analyzed. In order to prove the practical applications and strong expressive capabilities of QFCTL and QFCTL*, we present a model-checking example as empirical evidence for the effectiveness of the proposed model-checking algorithms. Through this example, we verify that, compared with the existing PoCTL, QFCTL and QFCTL* can avoid the loss of system path reachability information or system property satisfaction information, ensure the synchronization of the two types of information, and fuse these two types of information according to weight preferences. QFCTL and QFCTL* can also synthesize temporal formulas that characterize the subproperties of the system according to weight preferences. These application examples also verify that the QFCTL and QFCTL* model-checking algorithms proposed in this article are automatic and effective.


  • Open Access

    Sparse Feature-Weighted Double Laplacian Rank Constraint Non-Negative Matrix Factorization for Image Clustering

    by Hu Ma, Ziping Ma, Huirong Li, Jingyu Wang

    As an extension of non-negative matrix factorization (NMF), graph-regularized non-negative matrix factorization (GNMF) has been widely applied in data mining and machine learning, particularly for tasks such as clustering and feature selection. Traditional GNMF methods typically rely on predefined graph structures to guide the decomposition process, using fixed data graphs and feature graphs to capture relationships between data points and features. However, these fixed graphs may limit the model’s expressiveness. Additionally, many NMF variants face challenges when dealing with complex data distributions and are vulnerable to noise and outliers. To overcome these challenges, we propose a novel method called sparse feature-weighted double Laplacian rank constraint non-negative matrix factorization (SFLRNMF), along with its extended version, SFLRNMTF. These methods adaptively construct more accurate data similarity and feature similarity graphs, while imposing rank constraints on the Laplacian matrices of these graphs. This rank constraint ensures that the resulting matrix ranks reflect the true number of clusters, thereby improving clustering performance. Moreover, we introduce a feature weighting matrix into the original data matrix to reduce the influence of irrelevant features and apply an L2,1/2 norm sparsity constraint in the basis matrix to encourage sparse representations. An orthogonal constraint is also enforced on the coefficient matrix to ensure interpretability of the dimensionality reduction results. In the extended model (SFLRNMTF), we introduce a double orthogonal constraint on the basis matrix and coefficient matrix to enhance the uniqueness and interpretability of the decomposition, thereby facilitating clearer clustering results for both rows and columns. However, enforcing double orthogonal constraints can reduce approximation accuracy, especially with low-rank matrices, as it restricts the model’s flexibility. To address this limitation, we introduce an additional factor matrix R, which acts as an adaptive component that balances the trade-off between constraint enforcement and approximation accuracy. This adjustment allows the model to achieve greater representational flexibility, improving reconstruction accuracy while preserving the interpretability and clustering clarity provided by the double orthogonality constraints. Consequently, the SFLRNMTF approach becomes more robust in capturing data patterns and achieving high-quality clustering results in complex datasets. We also propose an efficient alternating iterative update algorithm to optimize the proposed model and provide a theoretical analysis of its performance. Clustering results on four benchmark datasets demonstrate that our method outperforms competing approaches.


  • Open Access

    Research on Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking

    by XianFeng Yu, YongMing Li, ShengLing Geng, HuiRong Li

    This treatise represents a significant contribution to the field by integrating quality constraint functions and predicates into Possibility Computation Tree Temporal Logic (PoCTL), thus giving rise to Fuzzy Computation Tree Temporal Logic with Quality Constraints (QFCTL). We provide a comprehensive definition of QFCTL's syntax, conduct an in-depth analysis of its logical characteristics, outline a precise model checking algorithm for QFCTL, and perform a meticulous complexity assessment of said algorithm. Moreover, by enriching QFCTL with a quantitative characteristic predicate operator, we innovate, culminating in the development of an enhanced Fuzzy Computation Tree Temporal Logic with Quality Constraints (QFCTL*). The treatise explores the logical facets of QFCTL*, formulates a bespoke model checking algorithm for QFCTL*, and conducts a rigorous analysis of its algorithmic complexity. To attest to the practical utility and robust expressive power of QFCTL and QFCTL*, we present a model checking example that serves as empirical evidence of the efficacy of the proposed model checking algorithms.


  • Open Access

    Unsupervised Feature Selection with Latent Relationship Penalty Term

    by Ziping Ma, Yulei Huang, Huirong Li, Jingyu Wang

    With the exponential growth of high dimensional unlabeled data, unsupervised feature selection (UFS) has attracted considerable attention due to its excellent performance in machine learning. Existing UFS methods implicitly assigned the same attribute score to each sample, which disregarded the distinctiveness of features and weakened the clustering performance of UFS methods to some extent. To alleviate these issues, a novel UFS method is proposed, named unsupervised feature selection with latent relationship penalty term (LRPFS). Firstly, latent learning is innovatively designed by assigning explicitly an attribute score to each sample according to its unique importance in clustering results. With this strategy, the inevitable noise interference can be removed effectively while retaining the intrinsic structure of data samples. Secondly, an appropriate sparse model is incorporated into the penalty term to further optimize its roles as follows: (1) It imposes potential constraints on the feature matrix to guarantee the uniqueness of the solution. (2) The interconnection between data instances is established by a pairwise relationship situation. Extensive experiments on benchmark datasets demonstrate that the proposed method is superior to relevant state-of-the-art algorithms with an average improvement of 10.17% in terms of accuracy.