Fast computation of concept lattices using data mining techniques
dc.date.accessioned | 2009-01-30T13:07:37Z | |
dc.date.available | 2009-01-30T13:07:37Z | |
dc.date.issued | 2000 | |
dc.identifier.uri | urn:nbn:de:hebis:34-2009013026110 | |
dc.identifier.uri | http://hdl.handle.net/123456789/2009013026110 | |
dc.format.extent | 243453 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.rights | Urheberrechtlich geschützt | |
dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | |
dc.subject.ddc | 004 | |
dc.title | Fast computation of concept lattices using data mining techniques | eng |
dc.type | Aufsatz | |
dcterms.abstract | We present a new algorithm called TITANIC for computing concept lattices. It is based on data mining techniques for computing frequent itemsets. The algorithm is experimentally evaluated and compared with B. Ganter's Next-Closure algorithm. | eng |
dcterms.accessRights | open access | |
dcterms.creator | Stumme, Gerd | |
dcterms.creator | Taouil, Rafik | |
dcterms.creator | Bastide, Yves | |
dcterms.creator | Pasquier, Nicolas | |
dcterms.creator | Lakhal, Lotfi | |
dc.description.et | Extern | ger |
dc.description.everything | Auch erschienen in: Bouzeghoub, Mokrane u.a. (Hrsg.): Proceedings of the 7th International Workshop on Knowledge Representation Meets Databases. Berlin. 2000 | ger |
dc.subject.swd | Formale Begriffsanalyse | ger |
Dateien zu dieser Ressource
Das Dokument erscheint in:
-
Publikationen [55]