Three-way concept analysis (3WCA) is extended research of formal concept analysis (FCA) by combining three-way decision. The three-way object oriented concept lattice (OEOL) is one of the important data structures which integrates rough set, concept...
Formal concept analysis has proven to be a very effective method for data analysis and rule extraction, but how to build formal concept lattices is a difficult and hot topic. In this paper, an efficient and rapid incremental concept lattice construct...
In this paper, firstly, we studied the relationship between negative concept lattices with increasing the granularity sizes of the attributes. Aiming to do this, negative concepts and covering relations were both classified into three types, and the...
In the era of big data, the data is updating in real-time. How to prepare the data accurately and efficiently is the key to mining association rules. In view of the above questions, this paper proposes a dynamic horizontal union algorithm of multiple...
The findability and usability of open data have never been more important due to the volume of available data. Therefore, methods have been developed to improve the dataset metadata quality, enhancing its findability and usability. One effective appr...
An object-oriented concept lattice, as an important generalization of classic concept lattices, is a bridge between formal concept analysis and rough set theory. This paper presents an application of covering reduction in formal concept analysis. It...
Granule description is a fundamental problem in granular computing. However, how to describe indefinable granules is still an open, interesting, and important problem. The main objective of this paper is to give a preliminary solution to this problem...
Attribute reduction is a crucial research area within concept lattices. However, the existing works are mostly limited to either increment or decrement algorithms, rather than considering both. Therefore, dealing with large-scale streaming attributes...
As a basic method of spatial data operation, spatial keyword query can provide meaningful information to meet user demands by searching spatial textual datasets. How to accurately understand users’ intentions and efficiently retrieve results fr...
To deal with the complexities associated with the rapid growth in a merged concept lattice, a formal method based on an entropy-based weighted concept lattice (EWCL) is proposed as a mechanism for merging multi-source geographic ontologies (geo-onto...
Role-based access control (RBAC) is a widely adopted security model that provides a flexible and scalable approach for managing permissions in various domains. One of the critical challenges in RBAC is the efficient assignment of roles to users while...
An interval concept lattice is an expansion form of a classical concept lattice and a rough concept lattice. It is a conceptual hierarchy consisting of a set of objects with a certain number or proportion of intent attributes. Interval concept lattic...
Constructing a merged concept lattice with formal concept analysis (FCA) is an important research direction in the field of integrating multi-source geo-ontologies. Extracting essential geographical properties and reducing the concept lattice are two...
Medical diagnosis has been recognized as one of the key processes in clinical medicine, which determines diseases from some given symptoms. Nonetheless, previous works about medical diagnosis have some drawbacks because medical data are usually fuzzy...
The application of knowledge graphs has been restricted in some domains, especially the industrial and academic domains. One of the reasons is that they require a high reliability of knowledge, which cannot be satisfied by the existing knowledge grap...
Managing and extracting information from databases is one of the main goals in several fields, as in Formal Concept Analysis (FCA). One-sided concept lattices and multi-adjoint concept lattices are two frameworks in FCA that have been developed in pa...
The measurement of semantic similarity has been widely recognized as having a fundamental and key role in information science and information systems. Although various models have been proposed to measure semantic similarity, these models are not abl...
The generalized one-sided concept lattices represent a generalization of the classical FCA method convenient for a hierarchical analysis of object-attribute models with different types of attributes. The mentioned types of object-attribute models are...
In a world rich with linguistic-valued data, traditional methods often lead to significant information loss when converting such data into other formats. This paper presents a novel approach for constructing an interval linguistic-valued intuitionist...
A relative lag in research methods, technical means and research paradigms has restricted the rapid development of geography and urban computing. Hence, there is a certain gap between urban data and industry applications. In this paper, a spatial ass...
To combat the uncertainty of the multiple factors affecting roadway surrounding rock stability, five initial indexes are selected for reduction according to concept lattice theory: rock quality designation (RQD), uniaxial compressive strength (Rc), t...
Knowledge reduction is a crucial topic in formal concept analysis. There always exists uncertain, symmetric linguistic-evaluation information in social life, which leads to high complexity in the process of knowledge representation. In order to overc...
Noticing certain limitations of concept lattices in the fuzzy context, especially in view of their practical applications, in this paper, we propose a more general approach based on what we call graded fuzzy preconcept lattices. We believe that this...
Association Rule Mining (ARM) relies on concept lattices as an effective knowledge representation structure. However, classical ARM methods face significant limitations, including the generation of misleading rules during data-to-formal-context mappi...
The purpose of this paper is to interpret fuzzy Kripke models as fuzzy information systems with objects and attributes. We introduce topological structures (interior, closure operators, Alexandrov pretopologies, Alexandrov precotopologies, fuzzy roug...
Russian Roulette is a well-known cruel gambling game and its concepts and methods have been exploited in a lot of research fields for decades. However, abundant useful information contained in the process of Russian Roulette is seldom studied with a...
Concept lattice has been successfully applied to various fields as an effective tool for data analysis and knowledge discovery, with attribute reduction being the key problem. This paper combines the intuitionistic fuzzy theory with the concept latti...
Web page clustering is an important technology for sorting network resources. By extraction and clustering based on the similarity of the Web page, a large amount of information on a Web page can be organized effectively. In this paper, after describ...
In this paper, we introduce topological information systems between objects with a distance and attributes with a distance based on a complete co-residuated lattice. We can obtain two distances and Alexandrov topologies for objects and attributes fro...
Aiming at the problem that the assembly body model is difficult to classify and retrieve (large information redundancy and poor data consistency), an assembly body retrieval method oriented to key structures was presented. In this paper, a decision f...
The formal concept of lattice plays a vital role in knowledge discovery. Reduction of the attribute has many applications in machine learning technology and data mining fields. In this paper, we introduce an object ranking concept to define a consist...
Consider a formal context (G, M, I) as the basic mechanism to capture information about a set G of objects, a set M of attributes and the relation I ∈ G × M between them. Traditional use of Formal Concept Analysis has some shortcomings in...
Lattice structures are characterized by a light weight, high strength, and high stiffness, and have a wide range of applications in the aerospace field. Node stress concentration is a key factor affecting the mechanical performance of lattice structu...
We introduce the notion of the reduct of soft contexts, which is a special notion of a consistent set for soft contexts. Then, we study its properties and show that this notion is well explained by the two classes,
We introduce the notion of consistent sets of soft contexts and investigate its characterizations. For the purpose of studying the characterizations of consistent sets, we introduce the notions of
Bipartite graphs are widely used for modelling various real-world scenarios characterized with binary relations, such as, scholarly articles recommendation with author-paper relations, and product recommendation with user-product relations. Particula...
A partially ordered set (or a poset, for short) is a set endowed with a partial order relation, i.e., with a reflexive, anti-symmetric, and transitive binary relation. As mathematical objects, posets have been intensively studied in the last century,...
In this paper, we give a mathematical model of the logic of determination of objects (LDO) based on preordered sets, and a mathematical model of the logic of typical and atypical instances (LTA). We prove that LTA is an extension of LDO. It can manip...
Fifth metacarpal shaft fractures account for a large share of hand trauma and often require operative internal fixation, yet conventional dorsal plates and cannulated screws present a stiffness mismatch with native bone and the insertion of screws ca...
Urban–rural information infrastructure (URII) serves as the backbone of the “Digital Village” strategy; however, it faces significant threats from natural disasters and socioeconomic disparities. This study proposes a comprehensive...
Classification in discrete object space is a widely used machine learning technique. In this case, we can construct a rule set using attribute level implication rules. In this paper, we apply the technique of formal concept analysis to generate the r...
To express wider uncertainty, Běhounek and Daňková studied fuzzy partial logic and partial function. At the same time, Borzooei generalized t-norms and put forward the concept of partial t-norms when studying lattice valued quantum e...
Preconcepts are basic units of knowledge that form the basis of formal concepts in formal concept analysis (FCA). This paper investigates the relations among different kinds of preconcepts, such as protoconcepts, meet and join-semiconcepts and formal...
Recently, Milles and Hammami presented and studied the concept of a neutrosophic topology generated by a neutrosophic relation. As a continuation in the same direction, this paper studies the concepts of neutrosophic ideals and neutrosophic filters o...
Lattice structure topology is a rapidly growing area of research facilitated by developments in additive manufacturing. These low-density structures are particularly promising for their medical applications. However, predicting their performance beco...
The detection of redundant or irrelevant variables (attributes) in datasets becomes essential in different frameworks, such as in Formal Concept Analysis (FCA). However, removing such variables can have some impact on the concept lattice, which is cl...
Many papers have been devoted to applying fuzzy sets to algebraic structures. In this paper, based on ideals, we investigate residuated lattices from fuzzy set theory, lattice theory, and coding theory points of view, and some applications of fuzzy s...
In this paper, firstly, as a generalization of derivations on a lattice, the notion of n-derivation is introduced and some fundamental properties are investigated. Secondly, the concept of (n,m)-derivation-homomorphism on lattices is described and im...
CubeSat and small satellite resistojet heat exchanger designs are based on conventional concepts that have been used since the 1960s, being primarily limited to helical or twisted tape heat exchangers. The design flexibility enabled by new additive m...
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD). These algebras are already complete lattices and many of their in...
of 7