Efficient mining of association rules based on formal concept analysis
| dc.date.accessioned | 2009-04-08T13:58:53Z | |
| dc.date.available | 2009-04-08T13:58:53Z | |
| dc.date.issued | 2005 | |
| dc.identifier.uri | urn:nbn:de:hebis:34-2009040826965 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/2009040826965 | |
| dc.format.extent | 223200 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 | Efficient mining of association rules based on formal concept analysis | eng |
| dc.type | Preprint | |
| dcterms.abstract | Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, TITANIC, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining. | eng |
| dcterms.accessRights | open access | |
| dcterms.creator | Lakhal, Lotfi | |
| dcterms.creator | Stumme, Gerd | |
| dc.description.everything | Auch erschienen in: Ganter, Bernhard u.a. (Hrsg.): Formal concept analysis. (Lecutre notes in computer science ; 3626). Berlin u.a. : Springer, 2005. S. 180-195. ISBN 3-540-27891-5 (The original publication is available at www.springerlink.com) | ger |
| dc.subject.swd | Formale Begriffsanalyse | ger |
| dc.subject.swd | Data Mining | ger |
Dateien zu dieser Ressource
Das Dokument erscheint in:
-
Publikationen [55]