Advanced search
Publication Cover
International Journal of General Systems Volume 45, 2016 - Issue 2: Concept Lattices and Their Applications
Submit an article Journal homepage
138
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

A lattice-free concept lattice update algorithm

Jan OutrataDepartment of Computer Science, Palacký University Olomouc, Olomouc, Czech Republic.Correspondence[email protected]
View further author information
Pages 211-231 | Received 15 Jun 2014, Accepted 15 Dec 2014, Published online: 28 Oct 2015

References

  • Bache, K, and M Lichman. 2013. UCI Machine Learning Repository. Irvine, CA: School of Information and Computer Sciences. University of California. http://archive.ics.uci.edu/ml.
  • Carpineto, C., and G. Romano. 2004. Concept Data Analysis. Theory and Applications. Chichester: J. Wiley.
  • Ganter, B.. 1984. Two Basic Algorithms in Concept Analysis. Technical Report FB4-Preprint No. 831. TH Darmstadt.
  • Ganter, B., and R. Wille. 1999. Formal Concept Analysis. Mathematical Foundations. Berlin: Springer.
  • Godin, R., R. Missaoui, and H. Alaoui. 1995. “Incremental Concept Formation Algorithms Based on Galois Lattices.” Computation Intelligence 11: 246–267.
  • Kaytoue, M., F. Marcuola,, A. Napoli, L. Szathmary, and J. Villerd. 2010. “The Coron System.” In Proceedings of ICFCA 2010 -- Supplementary Proceedings, 55–58. http://coron.loria.fr.
  • Kirchberg, M., E. Leonardi, Y. S. Tan, S. Link, R. K L Ko, and B. S. Lee. 2012. “Formal Concept Discovery in Semantic Web Data.” In Proceedings of ICFCA 2012, LNAI. Leuven. Vol. 7278, 164–179. Berlin: Springer.
  • Krajca, P., J. Outrata, and V. Vychodil. 2010. “Advances in Algorithms Based on CbO.” In Proceedings of CLA 2010. Sevilla. Vol. 2010, 325–337.
  • Krajca, P., J. Outrata, and V. Vychodil. 2010b. “Parallel Algorithm for Computing Fixpoints of Galois Connections.” Annals of Mathematics and Artificial Intelligence 59 (2): 257–272.
  • Kuznetsov, S. O. 1989. “Interpretation on Graphs and Complexity Characteristics of a Search for Specific Patterns.” Automatic Documentation and Mathematical Linguistics 24 (1): 37–45.
  • Kuznetsov, S. O. 1993. “A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-lattice.” Automatic Documentation and Mathematical Linguistics 27 (5): 11–21.
  • Kuznetsov, S. O. 1999. “Learning of Simple Conceptual Graphs from Positive and Negative Examples.” In Proceedings of PKDD 1999. 384–391.Heidelberg: Springer.
  • Lindig, C. 2000. “Fast Concept Analysis.” In Working with Conceptual Structures--Contributions to ICCS 2000. Darmstadt. Vol. 2000, 152–161.
  • Norris, E. M. 1978. “An Algorithm for Computing the Maximal Rectangles in a Binary Relation.” Revue Roumaine de Mathématiques Pures et Appliquées 23 (2): 243–250.
  • Outrata, J., and V. Vychodil. 2012. “Fast Algorithm for Computing Fixpoints of Galois Connections Induced by Object-attribute Relational Data.” Information Sciences 185 (1): 114–127.
  • Valtchev, P., M. R. Hacene, and R. Missaoui. 2003. “A Generic Scheme for the Design of Efficient On-line Algorithms for Lattices.” In Proceedings of ICCS 2003, LNCS. Dresden. Vol. 2746, 282–295. Berlin: Springer.
  • Valtchev, P., and R. Missaoui. 2001. “Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods.” In Proceedings of ICCS 2001, LNAI. Stanford. Vol. 2120, 290–303. Berlin: Springer.
  • Valtchev, P., R. Missaoui, and R. Godin. 2008. “A Framework for Incremental Generation of Closed Itemsets.” Discrete Applied Mathematics 156 (6): 924–949.
  • van der Merwe, D., S. A. Obiedkov, and D. G. Kourie. 2004. “AddIntent: A New Incremental Algorithm for Constructing Concept Lattices.” In Proceedings of ICFCA 2004, LNAI. Sydney. Vol. 2961, 205–206. Berlin: Springer.
  • Wille, R. 1982. “Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts.” Ordered Sets 83: 445–470.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.