This paper demonstrates how to employ rough set framework in order to induce JEPs in transactional data. The algorithm employs local reducts in order to generate desired JEPs and additional EPs. The number of the latter is decreased by preceding reduct computation with item aggregation. The preprocessing is reduced to graph coloring and solved with efficient classical heuristics. Our approach is contrasted with JEP-Producer, the recommended method for JEP induction. Moreover, a formal apparatus for classified transactional data has been proposed. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Terlecki, P., & Walczak, K. (2007). Jumping emerging pattern induction by means of graph coloring and local reducts in transaction databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4482 LNAI, pp. 363–370). Springer Verlag. https://doi.org/10.1007/978-3-540-72530-5_43
Mendeley helps you to discover research relevant for your work.