Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleSeptember 2023
Concept Lattices as a Reduction Tool for Fuzzy Relation Equations
AbstractRecently, a procedure to reduce multi-adjoint relation equations has been published. Such method relies on the strong existing link between fuzzy relation equations and concept lattices, and more specifically, it is based on attribute reduction ...
- research-articleJuly 2023
Reducing fuzzy relation equations via concept lattices
AbstractThis paper has taken into advantage the relationship between Fuzzy Relation Equations (FRE) and Concept Lattices in order to introduce a procedure to reduce a FRE, without losing information. Specifically, attribute reduction theory in property-...
- research-articleSeptember 2022
Multi-attention concept-cognitive learning model: A perspective from conceptual clustering
AbstractConcept-cognitive learning (CCL), as a cognitive process, is an emerging field of simulating the human brain to learn concepts in the formal context. Simultaneously, attention is a core property of all perceptual and cognitive ...
- ArticleSeptember 2021
- ArticleSeptember 2020
Collaborative Design and Manufacture: Information Structures for Team Formation and Coordination
Graph Structures for Knowledge Representation and ReasoningPages 93–104https://doi.org/10.1007/978-3-030-72308-8_7AbstractOur interest here lies in supporting important, but routine and time-consuming activities that underpin success in highly distributed, collaborative design and manufacturing environments; and how information structuring can facilitate this. To ...
-
- research-articleMarch 2020
Knowledge reduction methods of covering approximate spaces based on concept lattice
AbstractBoth rough sets and concept lattices, which are two complementary tools in data analysis, are analyzed based on binary relations. The relations between rough sets and concept lattices are important research topic. In this paper, the ...
Highlights- Union reduction methods of CA-space based on concept lattice are presented.
- The ...
- research-articleFebruary 2020
On the size of ∃-generalized concept lattices
Discrete Applied Mathematics (DAMA), Volume 273, Issue CPages 205–216https://doi.org/10.1016/j.dam.2019.02.035AbstractFormal Concept Analysis (FCA) offers several tools for qualitative data analysis. One possibility is to group objects that share common attributes together and get a concept lattice that describes the data. Quite often the size of this ...
- research-articleMarch 2019
A fast attribute reduction method for large formal decision contexts
International Journal of Approximate Reasoning (IJAR), Volume 106, Issue CPages 1–17https://doi.org/10.1016/j.ijar.2018.12.002AbstractAttribute reduction in formal decision contexts is an important issue in formal concept analysis, which can help us to discover the knowledge hidden in formal decision contexts. However, most reduction methods in formal decision ...
- research-articleJanuary 2017
Multidimensional skyline analysis based on agree concept lattices
Intelligent Data Analysis (INDA), Volume 21, Issue 5Pages 1245–1265https://doi.org/10.3233/IDA-163111The Skyline concept has been introduced in order to exhibit the best objects according to all the criterion combinations and makes it possible to analyze the relationships between Skyline objects. Like the data cube, the Skycube groups all the ...
- articleAugust 2016
IRAFCA: an O(n) information retrieval algorithm based on formal concept analysis
Knowledge and Information Systems (KAIS), Volume 48, Issue 2Pages 465–491https://doi.org/10.1007/s10115-015-0876-xWith the exponential increase in the quantity of information circulating on the Internet, an evolution of information-retrieval systems becomes paramount. Indeed, current approaches for information systems design remain unable to meet the needs of users,...
- research-articleJanuary 2016
The connections between three-way and classical concept lattices
Knowledge-Based Systems (KNBS), Volume 91, Issue CPages 143–151https://doi.org/10.1016/j.knosys.2015.08.006The model of three-way concept lattices, a novel model for widely used three-way decisions, is an extension of classical concept lattices in formal concept analysis. This paper systematically analyses the connections between two types of three-way ...
- research-articleDecember 2015
Knowledge Reduction in Crisply Generated Fuzzy Concept Lattices
Fundamenta Informaticae (FUNI), Volume 142, Issue 1-4Pages 307–335https://doi.org/10.3233/FI-2015-1296Knowledge reduction is a basic issue in knowledge representation and data mining. Although various methods have been developed to reduce the size of classical formal contexts, the reduction of formal fuzzy contexts based on fuzzy lattices remains a ...
- research-articleNovember 2015
Concept lattices reduction
Expert Systems with Applications: An International Journal (EXWA), Volume 42, Issue 20Pages 7084–7097https://doi.org/10.1016/j.eswa.2015.04.044Survey of the main existing techniques for concept lattices reduction.Classification of techniques in three classes based on seven dimensions.Analyzing reduction techniques with formal concept analysis.Considerations are carried out about computational ...
- research-articleMay 2015
Relations of reduction between covering generalized rough sets and concept lattices
Information Sciences: an International Journal (ISCI), Volume 304, Issue CPages 16–27https://doi.org/10.1016/j.ins.2014.11.053The reduction theory plays an important role in data analysis. This paper studies the relation between the reduction of a covering and the attribute reduction of a concept lattice. The reduction of a covering from the perspective of concept lattices is ...
- articleOctober 2014
Generalized pattern extraction from concept lattices
Annals of Mathematics and Artificial Intelligence (KLU-AMAI), Volume 72, Issue 1-2Pages 151–168https://doi.org/10.1007/s10472-014-9411-0In this paper, we show how the existence of taxonomies on objects and/or attributes can be used in Formal Concept Analysis to help discover generalized concepts. To that end, we analyze three generalization cases ( , , and ) and present different ...
- articleJanuary 2014
Multi-adjoint fuzzy rough sets: Definition, properties and attribute selection
International Journal of Approximate Reasoning (IJAR), Volume 55, Issue 1Pages 412–426https://doi.org/10.1016/j.ijar.2013.09.007This paper introduces a flexible extension of rough set theory: multi-adjoint fuzzy rough sets, in which a family of adjoint pairs are considered to compute the lower and upper approximations. This new setting increases the number of applications in ...
- ArticleSeptember 2013
Association Rule Discovery Based on Formal Concept Analysis
IMCCC '13: Proceedings of the 2013 Third International Conference on Instrumentation, Measurement, Computer, Communication and ControlPages 884–887https://doi.org/10.1109/IMCCC.2013.196Association rule discovery, as the kernel task of data mining, has been studied widely. However, most algorithms based on frequent item sets have to scan databases many times. This reduces the algorithms' efficiency. Formal concept analysis is a useful ...
- articleMarch 2013
Dual multi-adjoint concept lattices
Information Sciences: an International Journal (ISCI), Volume 225Pages 47–54https://doi.org/10.1016/j.ins.2012.10.030Several papers relate different alternative approaches to classical concept lattices: such as property-oriented and object-oriented concept lattices and the dual concept lattices. Whereas the usual approach to the latter is via a negation operator, this ...
- articleJanuary 2013
Relational concept analysis: mining concept lattices from multi-relational data
Annals of Mathematics and Artificial Intelligence (KLU-AMAI), Volume 67, Issue 1Pages 81–108https://doi.org/10.1007/s10472-012-9329-3The processing of complex data is admittedly among the major concerns of knowledge discovery from data (kdd). Indeed, a major part of the data worth analyzing is stored in relational databases and, since recently, on the Web of Data. This clearly ...
- research-articleOctober 2009
Granular Computing and Knowledge Reduction in Formal Contexts
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 21, Issue 10Pages 1461–1474https://doi.org/10.1109/TKDE.2008.223Granular computing and knowledge reduction are two basic issues in knowledge representation and data mining. Granular structure of concept lattices with application in knowledge reduction in formal concept analysis is examined in this paper. Information ...