AddIntent

AddIntent: A new incremental algorithm for constructing concept lattices. An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g′|) attributes, is O(|L||G|2 max(|g′|)).


References in zbMATH (referenced in 13 articles , 1 standard article )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Ibrahim, Mohamed-Hamza; Missaoui, Rokia: Approximating concept stability using variance reduction techniques (2020)
  2. Naidenova, Xenia; Parkhomenko, Vladimir: Contribution to attributive and object subcontexts in inferring good maximally redundant tests (2020)
  3. Nica, Cristina; Braud, Agnès; Le Ber, Florence: \textscRCA-seq: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns (2020)
  4. Girard, Nathalie; Bertet, Karell; Visani, Muriel: Dichotomic lattices and local discretization for Galois lattices (2017)
  5. Li, Jinhai; Aswani Kumar, Cherukuri; Mei, Changlin; Wang, Xizhao: Comparison of reduction in formal decision contexts (2017)
  6. Rodríguez-Jiménez, Jose Manuel; Cordero, Pablo; Enciso, Manuel; Mora, Angel: Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis (2016)
  7. Andrews, Simon: A `best-of-breed’ approach for designing a fast algorithm for computing fixpoints of Galois connections (2015)
  8. Codocedo, Victor; Lykourentzou, Ioanna; Napoli, Amedeo: A semantic approach to concept lattice-based information retrieval (2014)
  9. Outrata, Jan; Vychodil, Vilem: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (2012)
  10. Vityaev, E. E.; Demin, A. V.; Ponomaryov, D. K.: Probabilistic generalization of formal concepts (2012)
  11. Kourie, Derrick G.; Obiedkov, Sergei; Watson, Bruce W.; van der Merwe, Dean: An incremental algorithm to construct a lattice of set intersections (2009)
  12. Obiedkov, S.; Duquenne, V.: Attribute-incremental construction of the canonical implication basis (2007)
  13. van der Merwe, Dean; Obiedkov, Sergei; Kourie, Derrick: AddIntent: A new incremental algorithm for constructing concept lattices (2004)