Fuzzy Sets and Systems最新文献

{"title":"Multi-label feature selection with high-level semantic label relationships based on fuzzy rough sets","authors":"Liangzhou Chen ,&nbsp;Mingjie Cai ,&nbsp;Qingguo Li","doi":"10.1016/j.fss.2025.109368","DOIUrl":"10.1016/j.fss.2025.109368","url":null,"abstract":"<div><div>In multi-label learning, feature selection plays a key role. This paper delves into the study of label relationships within the field of multi-label feature selection, with a particular focus on local label relationships. Most existing research explores these local relationships through clustering and other methods. These approaches may overlook the fact that the local correlations between labels may only manifest in specific subsets of the data, and there may be more complex semantic relationships between labels. Additionally, traditional logical label representation methods may not fully capture the connections between the sample space and the label space, whereas converting logical labels into label distributions with relative importance can provide more effective supervision information. At the same time, existing multi-label feature selection methods based on fuzzy rough sets are deficient in handling the interrelationships between labels and are sensitive to noise. Motivated by these challenges, this paper proposes a new multi-label feature selection algorithm that combines label enhancement and fuzzy rough sets. First, we propose a method to identify neighborhood granules with high-level semantic relationships to explore the local structure of the data, and based on this, we propose a novel label enhancement algorithm. Secondly, we transform the decision classes in traditional fuzzy rough set model into fuzzy decision classes, and propose an innovative multi-label fuzzy decision system based on label distribution. Finally, we design a new type of multi-label feature selection method based on high-level semantic relationships (HSR-MLFS). In the experiments, compared with other seven algorithms on eleven real-world datasets, the results show the superiority of the proposed algorithm.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109368"},"PeriodicalIF":3.2,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fuzzy neural network interpolation operators on fuzzy number valued functions endowed with weak types of continuity","authors":"Juan J. Font,&nbsp;Sergio Macario,&nbsp;Manuel Sanchis","doi":"10.1016/j.fss.2025.109365","DOIUrl":"10.1016/j.fss.2025.109365","url":null,"abstract":"<div><div>We extend Cardaliaguet-Euvrard neural network operators to the context of fuzzy number valued continuous functions and study their behaviour. We focus on level continuous, sendograph continuous and endograph continuous functions and obtain Jackson-type results in all these cases.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109365"},"PeriodicalIF":3.2,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"⊤-ultrafilters and their applications in ⊤-convergence spaces","authors":"Yuan Gao,&nbsp;Bin Pang","doi":"10.1016/j.fss.2025.109367","DOIUrl":"10.1016/j.fss.2025.109367","url":null,"abstract":"<div><div>Ultrafilters serve as an important tool for studying compactness and Choquet convergence structures in classical convergence spaces. In the framework of ⊤-convergence spaces, we provide three characterizations of ⊤-ultrafilters and consider their applications from three aspects. Firstly, we use ⊤-ultrafilters to study the ⊤-compactness of a ⊤-convergence space, including the Tychonoff theorem and the relationships between the compactness of a classical convergence space and its induced ⊤-convergence space. Secondly, we use ⊤-ultrafilters to construct the one-point <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> ⊤-compactification of a ⊤-convergence space and present the necessary and sufficient conditions for one-point <span><math><msub><mrow><mi>T</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> ⊤-compactification to be the smallest. Finally, we employ ⊤-ultrafilters to define Choquet ⊤-convergence spaces and investigate their function spaces as well as their relationships with other types of ⊤-convergence spaces.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109367"},"PeriodicalIF":3.2,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Lexicographic minimum solutions of fuzzy relation inequalities with product-max-min composition","authors":"Zhining Wang ,&nbsp;Xue-ping Wang","doi":"10.1016/j.fss.2025.109363","DOIUrl":"10.1016/j.fss.2025.109363","url":null,"abstract":"<div><div>With the consideration of the potential line faults in a Peer-to-Peer (P2P) network, the success rates of the lines have already been incorporated into the P2P network. A novel system of fuzzy relation inequalities (FRIs) with product-max-min composition has been proposed for characterizing such kind of P2P network. In this article, some essential properties of characteristic matrices (resp. discriminant matrices and submatrices) of the system are first examined and, as a by-product, the structure theorem for the entire solution set of the system is established by relying on the submatrices. In particular, it is proved that for every solution of the system there is a minimal solution that is less than or equal to the solution. Moreover, in order to alleviate the network congestion based on a given priority level of the nodes, the concept of a lexicographic minimum solution of the system is introduced and an algorithm named a CAD-based resolution algorithm is proposed for calculating such solutions. Several examples are given to demonstrate the algorithm.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109363"},"PeriodicalIF":3.2,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Generalizing comonotonicity: New insights and dual perspectives","authors":"M. Boczek,&nbsp;A. Hovana,&nbsp;O. Hutník","doi":"10.1016/j.fss.2025.109364","DOIUrl":"10.1016/j.fss.2025.109364","url":null,"abstract":"<div><div>We review, exemplify, and compare recently introduced classes of functions that generalize comonotone functions from two perspectives: algebraically through <span><math><msub><mrow><mo>⋆</mo></mrow><mrow><mi>inf</mi></mrow></msub></math></span>-associated functions and measure-theoretically via <em>m</em>-positively dependent functions, along with their dual versions – <span><math><msub><mrow><mo>⋆</mo></mrow><mrow><mi>sup</mi></mrow></msub></math></span>-associated functions and <em>m</em>-subadditive functions, respectively. While the concept of <em>m</em>-subadditive functions is well-documented in the literature, the concept of <span><math><msub><mrow><mo>⋆</mo></mrow><mrow><mi>sup</mi></mrow></msub></math></span>-associatedness appears to be novel. Furthermore, we present several applications of these function classes, particularly concerning integral inequalities for the generalized Sugeno integral. Additionally, we mention other extensions of comonotonicity, including weak comonotonicity and multivariate comonotonicity.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109364"},"PeriodicalIF":3.2,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"How to tractably compute a productive repair for possibilistic partially ordered DL-LiteR ontologies?","authors":"Ahmed Laouar ,&nbsp;Sihem Belabbes ,&nbsp;Salem Benferhat","doi":"10.1016/j.fss.2025.109361","DOIUrl":"10.1016/j.fss.2025.109361","url":null,"abstract":"<div><div>The lightweight description logic dialect DL-Lite<span><math><msub><mrow></mrow><mrow><mi>R</mi></mrow></msub></math></span> offers a framework for specifying and reasoning with formal inconsistent ontologies. Basically, an ontology is a knowledge base composed of a TBox, modelling conceptual knowledge of some domain of interest, and an ABox, asserting factual knowledge about specific entities of the domain. Inconsistency in an ontology is usually handled by evaluating queries over maximal conflict-free subsets of the ABox, called data repairs. Several inconsistency-tolerant semantics, with different levels of cautiousness and computational cost, propose strategies for selecting the repairs to consider when deriving new conclusions from an inconsistent ontology. In this paper, we focus on partially ordered ontologies where a partial order relation captures the reliability levels of the ABox elements. We propose a new tractable method, called “C<em>π</em>-repair”, which leverages possibility theory in repairing a partially ordered ABox. It proceeds in four steps as follows. First, the partial order relation is extended into a family of total orders, thus inducing as many compatible totally ordered ABoxes. Second, a single repair is computed for each compatible ABox. Third, these repairs are closed deductively in order to improve their productivity, i.e., to derive more facts. Finally, the closed repairs are intersected to produce a single repair for the initial partially ordered ABox. The main contribution of this paper is an equivalent characterization that determines the validity of the conclusions drawn with the “C<em>π</em>-repair” method, but without eliciting the compatible ABoxes or computing their repairs. This allows us to establish the tractability of the method by reformulating the problem using the notions of support for an assertion and dominance over the conflicts that arise between the ABox elements. Essentially, the valid conclusions are those derived from the supports that dominate all conflicts. In the last part of the paper, we explore the rationality properties of our method. We show that increasing repair productivity does not alter the satisfaction of the rationality properties. We also discuss the applicability of our proposed method to languages richer than DL-Lite<span><math><msub><mrow></mrow><mrow><mi>R</mi></mrow></msub></math></span> and to other inconsistency-tolerant semantics.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109361"},"PeriodicalIF":3.2,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Labeled Fuzzy Reactive Graphs","authors":"Suene Campos ,&nbsp;Daniel Figueiredo ,&nbsp;Manuel A. Martins ,&nbsp;Regivan Santiago","doi":"10.1016/j.fss.2025.109320","DOIUrl":"10.1016/j.fss.2025.109320","url":null,"abstract":"<div><div>The topic of fuzzy and relation-changing structures have been progressively explored through the authors' previous work. This paper continues to expand the range of application for these models by introducing Labeled Fuzzy Reactive Graphs. This structure admits labels in regular edges, in order to permit to describe the action of different agents. For such structures, the operations of union, intersection and threshold are presented. Subsequently, this structure is applied to model a cancer treatment protocol and it is shown how the relation-changing properties of this structure can be used to better describe the dynamics of the modelled protocol.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109320"},"PeriodicalIF":3.2,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"“d score” for type-2 fuzzy number incorporating the interaction between fast thinking and slow thinking","authors":"Kun Yu ,&nbsp;Yuanzhen Xu ,&nbsp;Xiaohan Yu ,&nbsp;Bin Zhu","doi":"10.1016/j.fss.2025.109362","DOIUrl":"10.1016/j.fss.2025.109362","url":null,"abstract":"<div><div>Modeling human thinking process is essential in decision making. According to dual-process theory, fast thinking and slow thinking in our brains shape our judgments and decisions. Type-2 fuzzy number (T2FN) models the shaping process with these two thinking patterns. However, how to model the interaction between them is a mystery, which can be referred as interactive thinking. In this paper, we propose a <em>d</em> score of T2FN to reveal their interaction mechanism, where an interaction coefficient <em>θ</em> is used to measure the interaction. This score describes fast and slow thinking patterns and the transformation process between them, and how the interaction helps decision makers make better decisions. We propose two optimization models to solve for the coefficient <em>θ</em>. With the collected data based on questionnaires, we find a dominant role of interactive thinking in practice. In particular, it is most common that fast thinking and slow thinking play equally important roles in forming our judgments. Moreover, our results suggest that fast thinking tends to correspond with questions that contain complex information, while slow thinking tends to correspond with simple information.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"510 ","pages":"Article 109362"},"PeriodicalIF":3.2,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143601290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fuzzification of crisp functions using gradual elements and gradual sets","authors":"Hsien-Chung Wu","doi":"10.1016/j.fss.2025.109358","DOIUrl":"10.1016/j.fss.2025.109358","url":null,"abstract":"<div><div>There are two ways to fuzzify the crisp functions into fuzzy functions. One is using the extension principle. Another one is using the expression in decomposition theorem. In this paper, we present a new methodology to fuzzify the crisp functions for non-normal fuzzy sets using the concepts of gradual elements and gradual sets. The main purpose of this paper is to establish the equivalence between the fuzzy functions that are obtained using the extension principle and the gradual elements when the membership functions are assumed to be upper semi-continuous. This kind of technique is based on the idea in which the fuzzy set is formulated as consisting of gradual elements like the usual set consisting of usual elements. In this case, the operations among sets can be borrowed to set up the operations among fuzzy sets.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"509 ","pages":"Article 109358"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Independent subcontexts and blocks of concept lattices. Definitions and relationships to decompose fuzzy contexts","authors":"Roberto G. Aragón,&nbsp;Jesús Medina,&nbsp;Eloísa Ramírez-Poussa","doi":"10.1016/j.fss.2025.109345","DOIUrl":"10.1016/j.fss.2025.109345","url":null,"abstract":"<div><div>The decomposition of datasets is a useful mechanism in the processing of large datasets and it is required in many cases. In formal concept analysis (FCA), the dataset is interpreted as a context and the notion of independent context is relevant in the decomposition of a context. In this paper, we have introduced a formal definition of independent context within the multi-adjoint concept lattice framework, which can be translated to other fuzzy approaches. Furthermore, we have analyzed the decomposition of a general bounded lattice in pieces, that we have called blocks. This decomposition of a lattice has been related to the existence of a decomposition of a context into independent subcontexts. This study will allow to develop algorithms to decompose datasets with imperfect information.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"509 ","pages":"Article 109345"},"PeriodicalIF":3.2,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143552810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}