Journal Article10.1016/J.INS.2015.12.013
Using minimal generators for composite isolated point extraction and conceptual binary relation coverage
8
TL;DR: The MinGenCoverage algorithm for covering a Formal Context based on isolated labels and using these labels for categorization, corpus structuring, and micro-macro browsing as an advanced information retrieval functionality is proposed.
read more
About: This article is published in Information Sciences. The article was published on 01 Apr 2016. The article focuses on the topics: Formal concept analysis & Binary relation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A methodology for analysis of concept lattice reduction
Sérgio M. Dias,Newton J. Vieira +1 more
TL;DR: A methodology for analysis of concept lattice reduction is presented here based on the use of sets of proper implications holding in the original and reduced formal contexts or concept lattices, able to show what is preserved, eliminated, inserted or transformed by a reduction technique.
39
QualityCover: Efficient binary relation coverage guided by induced knowledge quality
Amira Mouakher,Sadok Ben Yahia +1 more
TL;DR: A new gain function based approach, called QualityCover, is introduced, for the extraction of a pertinent coverage of a formal context, which operates akin to a greedy approach and relies on the assessment of a measure of correlation for the selection of the formal concepts to be retained in the final coverage.
38
Conceptual Coverage Driven by Essential Concepts: A Formal Concept Analysis Approach
Amira Mouakher,Axel Ragobert,Sébastien Gerin,Andrea Ko +3 more
- 23 Oct 2021
TL;DR: In this article, a greedy algorithm called Concise is proposed to compute minimal and meaningful subsets of concepts in FCA, which is shown to avoid the sluggishness of its competitors while offering the ability to mine both partial and full conceptual coverage.
5
Describing hierarchy of concept lattice by using matrix
TL;DR: It is believed that any software autonomously understand the information of hierarchy of the concepts from the hierarchy-matrix, which is a new of method describing a hierarchy of a finite concept lattice by using a matrix.
5
References
LIBSVM: A library for support vector machines
Chih-Chung Chang,Chih-Jen Lin +1 more
TL;DR: Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.