Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation

Formal concept analysis
Imprecise information
Authors
Domingo López-Rodríguez , Manuel Ojeda Hernández , Ángel Mora , Carlos Bejines
Published
15 November 2025
Publication details
Fuzzy Sets and Systems vol. 520, pages 109574.
Links
DOI PDF

 

Abstract

In Fuzzy Formal Concept Analysis (FFCA), concept lattices are computed by scaling the problem and applying ordinary FCA algorithms. In this paper, the CbO family of algorithms is extended to work natively in the fuzzy setting, they are proved to be correct and output the whole set of formal concepts, which makes them mathematically equivalent to the scaling approach. However, experimental results demonstrate the performance improvement of these methods compared to scaling. The paper also discusses a new fuzzy strategy based on blacklisting redundant truth values to enhance the performance of algorithms by taking advantage of the structure of the residuated lattice.

Funding

NoteProjects funding this work

VALID: Verifiable Algebraic and Logic tools for Imperfect Data

Formal concept analysis
Fuzzy logic
Uncertainty
Imprecise information
1 September 2023
Manuel Ojeda-Aciego, Domingo López-Rodríguez
No matching items

Citation

How to cite

D. López-Rodríguez, M. Ojeda-Hernández, Á. Mora, et al. “Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation”. In: Fuzzy Sets and Systems 520 (2025), p. 109574. ISSN: 0165-0114. DOI: https://doi.org/10.1016/j.fss.2025.109574. URL: https://www.sciencedirect.com/science/article/pii/S0165011425003136.

BibTeX 
<pre><code>
@Article{LOPEZRODRIGUEZ2025109574, title = {Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation}, journal = {Fuzzy Sets and Systems}, volume = {520}, pages = {109574}, year = {2025}, issn = {0165-0114}, doi = {https://doi.org/10.1016/j.fss.2025.109574}, url = {https://www.sciencedirect.com/science/article/pii/S0165011425003136}, author = {Domingo L{‘o}pez-Rodr{’}guez and Manuel Ojeda-Hern{’a}ndez and {’A}ngel Mora and Carlos Bejines}, keywords = {Formal concept analysis, Close-by-One, Algorithms, Comparison, Performance, Fuzzy}, abstract = {In Fuzzy Formal Concept Analysis (FFCA), concept lattices are computed by scaling the problem and applying ordinary FCA algorithms. In this paper, the CbO family of algorithms is extended to work natively in the fuzzy setting, they are proved to be correct and output the whole set of formal concepts, which makes them mathematically equivalent to the scaling approach. However, experimental results demonstrate the performance improvement of these methods compared to scaling. The paper also discusses a new fuzzy strategy based on blacklisting redundant truth values to enhance the performance of algorithms by taking advantage of the structure of the residuated lattice.}, } 
<button class='copy-bib-btn' id='copy-bib-btn'><i class='bi bi-clipboard'></i> Copy BibTeX</button>

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

Close-by-One-like algorithms in the fuzzy setting: Theory and experimentation

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

  1. Sahjad M. Aksan, Wang Jing, Li Na (2026). Knowledge, Truth, and Interpretation: Revisiting Classical Philosophy in the Digital Age. Journal of Humanities Research Sustainability DOI
  2. Unknown Author (n.d.). NA.
  3. Unknown Author (n.d.). NA.
  4. Unknown Author (n.d.). NA.
  5. Unknown Author (n.d.). NA.
  6. Unknown Author (n.d.). NA.