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

On Overfitting of Classifiers Making a Lattice., and . ICFCA, volume 10308 of Lecture Notes in Computer Science, page 184-197. Springer, (2017)Scale Coarsening as Feature Selection., and . ICFCA, volume 4933 of Lecture Notes in Computer Science, page 217-228. Springer, (2008)Stepwise Construction of the Dedekind-MacNeille Completion (Research Note)., and . ICCS, volume 1453 of Lecture Notes in Computer Science, page 295-302. Springer, (1998)Hypotheses and Version Spaces., and . ICCS, volume 2746 of Lecture Notes in Computer Science, page 83-95. Springer, (2003)Counting Pseudo-intents and #P-completeness., and . ICFCA, volume 3874 of Lecture Notes in Computer Science, page 306-308. Springer, (2006)Human-Centered Text Mining: A New Software System., , , , , and . ICDM, volume 7377 of Lecture Notes in Computer Science, page 258-272. Springer, (2012)Approximating Concept Stability., and . ICFCA, volume 7278 of Lecture Notes in Computer Science, page 7-15. Springer, (2012)Can triconcepts become triclusters?, , , and . Int. J. General Systems, 42 (6): 572-593 (2013)Ordered Sets for Data Analysis.. CoRR, (2019)On interestingness measures of formal concepts., and . Inf. Sci., (2018)