Author of the publication

Algorithms for the Construction of Concept Lattices and Their Diagram Graphs

, and . Principles of Data Mining and Knowledge Discovery, page 289--300. Berlin, Heidelberg, Springer Berlin Heidelberg, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Modal Logic for Evaluating Formulas in Incomplete Contexts.. ICCS, volume 2393 of Lecture Notes in Computer Science, page 314-325. Springer, (2002)Implications in Triadic Formal Contexts., and . ICCS, volume 3127 of Lecture Notes in Computer Science, page 186-195. Springer, (2004)AddIntent: A New Incremental Algorithm for Constructing Concept Lattices., , and . ICFCA, volume 2961 of Lecture Notes in Computer Science, page 372-385. Springer, (2004)Building access control models with attribute exploration., , and . Comput. Secur., 28 (1-2): 2-7 (2009)Algorithms for the Construction of Concept Lattices and Their Diagram Graphs., and . PKDD, volume 2168 of Lecture Notes in Computer Science, page 289-300. Springer, (2001)Large-Scale Parallel Matching of Social Network Profiles., , and . CoRR, (2019)Counting Pseudo-intents and #P-completeness., and . ICFCA, volume 3874 of Lecture Notes in Computer Science, page 306-308. Springer, (2006)Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis., and . CLA, volume 959 of CEUR Workshop Proceedings, page 43-57. CEUR-WS.org, (2011)Large-Scale Parallel Matching of Social Network Profiles., , and . AIST, volume 542 of Communications in Computer and Information Science, page 275-285. Springer, (2015)On Lattices in Access Control Models., , and . ICCS, volume 4068 of Lecture Notes in Computer Science, page 374-387. Springer, (2006)