Inproceedings3251: Unterschied zwischen den Versionen
Sru (Diskussion | Beiträge) |
Sru (Diskussion | Beiträge) |
||
Zeile 17: | Zeile 17: | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational or a black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by adding closed sets or implication, and conversion from one representation into another. | |Abstract=It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational or a black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by adding closed sets or implication, and conversion from one representation into another. | ||
+ | |Download=Rudolph-ICFCA2012.pdf, | ||
|Projekt=ExpresST | |Projekt=ExpresST | ||
|Forschungsgruppe=Wissensmanagement | |Forschungsgruppe=Wissensmanagement |
Aktuelle Version vom 28. Juni 2012, 18:06 Uhr
Some Notes on Managing Closure Operators
Some Notes on Managing Closure Operators
Published: 2012
Mai
Herausgeber: Florent Domenach, Dmitry I. Ignatov, Jonas Poelmans
Buchtitel: Proceedings of the 10th International Conference on Formal Concept Analysis
Ausgabe: 7278
Reihe: LNCS
Seiten: 278-293
Verlag: Springer
Referierte Veröffentlichung
BibTeX
Kurzfassung
It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational or a black-box representation. These tasks include closure computation, size minimization, finer-coarser-comparison, modification by adding closed sets or implication, and conversion from one representation into another.
Download: Media:Rudolph-ICFCA2012.pdf