Yan-Ling Bao

Prof. Yan-Ling Bao

Xinjiang University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in Filomat
Verified
Journal Article
Open access
PDF file
HYHai-Long Yang
Hai-Long Yang
YBYan-Ling Bao
Yan-Ling Bao
ZGZhi-Lian Guo
Zhi-Lian Guo
Neutrosophic set (NS) was originally proposed by Smarandache to handle indeterminate and inconsistent information. It is a generalization of fuzzy sets and intuitionistic fuzzy sets. Wang and Smarandache proposed interval neutrosophic sets (INS) which is a special case of NSs and would be extensively applied to resolve practical issues. In this paper, we put forward generalized interval neutrosophic rough sets based on interval neutrosophic relations by combining interval neutrosophic sets with rough sets. We explore the hybrid model through constructive approach as well as axiomatic approach. On one hand, we define generalized interval neutrosophic lower and upper approximation operators through constructive approach. Moreover, we investigate the relevance between generalized interval neutrosophic lower (upper) approximation operators and particular interval neutrosophic relations. On the other hand, we study axiomatic characterizations of generalized interval neutrosophic approximation operators, and also show that different axiom sets of theoretical interval neutrosophic operators make sure the existence of different classes of INRs that yield the same interval neutrosophic approximation operators. Finally, we introduce generalized interval neutrosophic rough sets on two universes and a universal algorithm of multi-attribute decision making based on generalized interval neutrosophic rough sets on two universes. Besides, an example is given to demonstrate the validity of the new rough set model.

1 January 2021 in Complexity
Verified
Journal Article
Open access
LWLi Wang
Li Wang
YBYan-Ling Bao
Yan-Ling Bao
As a generalization of both single‐valued neutrosophic element and hesitant fuzzy element, single‐valued neutrosophic hesitant fuzzy element (SVNHFE) is an efficient tool for describing uncertain and imprecise information. Thus, it is of great significance to deal with single‐valued neutrosophic hesitant fuzzy information for many practical problems. In this paper, we study the aggregation of SVNHFEs based on some normalized operations from geometric viewpoint. Firstly, two normalized operations are defined for processing SVNHFEs. Then, a series of normalized aggregation operators which fulfill some basic conditions of a valid aggregation operator are proposed. Additionally, a decision‐making method is developed for resolving multiattribute decision‐making problems based on the proposed operators. Finally, a numerical example is provided to illustrate the feasibility and effectiveness of the method.

22 January 2024 in International Journal of Fuzzy Systems
Verified
Journal Article
Closed access
PDF file
ODOmirzhan Dawlet
Omirzhan Dawlet
YBYan-Ling Bao
Yan-Ling Bao

7 March 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
YZYan Zhou
Yan Zhou
YBYan-Ling Bao
Yan-Ling Bao
With databases growing at an unrelenting rate, it may be difficult and complex to extract statistics by accessing all of the data in many practical problems. Attribute reduction, as an effective method to remove redundant attributes from massive data, has demonstrated its remarkable capability in simplifying information systems. In this paper, we concentrate on reducing attributes in incomplete information systems. We introduce a novel definition of a binary similarity matrix and present a method to calculate the significance of attributes in correspondence. Secondly, We develop a heuristic attribute reduction algorithm using a binary similarity matrix and attribute significance as heuristic knowledge. In addition, we use a numerical example to showcase the practicality and accuracy of the algorithm. In conclusion, we demonstrate through comparative analysis that our algorithm outperforms some existing attribute reduction methods.

7 November 2018 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YBYan-Ling Bao
Yan-Ling Bao
HYHai-Long Yang
Hai-Long Yang
SLSheng-Gang Li
Sheng-Gang Li

16 November 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
YBYan-Ling Bao
Yan-Ling Bao
SCShumin Cheng
Shumin Cheng
HWHaichao Wang
Haichao Wang