Inproceedings484: Unterschied zwischen den Versionen
Aus Aifbportal
K (Added from ontology) |
K (Added from ontology) |
||
| Zeile 1: | Zeile 1: | ||
| + | {{Publikation Erster Autor | ||
| + | |ErsterAutorNachname=Stumme | ||
| + | |ErsterAutorVorname=Gerd | ||
| + | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=2 | |Rank=2 | ||
|Author=Rafik Taouil | |Author=Rafik Taouil | ||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| Zeile 16: | Zeile 16: | ||
}} | }} | ||
{{Publikation Author | {{Publikation Author | ||
| − | |Rank= | + | |Rank=4 |
| − | |Author= | + | |Author=Nicolas Pasquier |
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Version vom 8. September 2009, 11:06 Uhr
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
Published: 2001
Herausgeber: F. Baader. G. Brewker, T. Eiter
Buchtitel: KI 2001: Advances in Artificial Intelligence. Proc. KI 2001
Reihe: LNAI 2174
Seiten: 335-350
Verlag: Springer, Heidelberg
Referierte Veröffentlichung
BibTeX
Kurzfassung
Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Anal- ysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.
Download: Media:2001_484_Stumme_Intelligent_Str_1.ps
Forschungsgebiet