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 Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.
Auch erschienen in: Baader, Franz u.a. (Hrsg.): Advances in artificial intelligence. (Lecture notes in computer science ; 2174). Berlin u.a. : Springer, 2001. S. 335-350. ISBN 3-540-42612-4 (The original publication is available at www.springerlink.com)