Determinacy analysis as a diclique extracting task
ECC'08 Proceedings of the 2nd conference on European computing conference
Machine learning task as a diclique extracting task
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
| Hi-index | 0.00 |
In this paper we describe an algorithm named MONSA for closed sets mining. It is an exact depth-first search algorithm extracting only frequent closed sets using several pruning techniques to be free from repetitive and empty patterns. The first version of MONSA was created in 1993 and we have developed several versions during last years. Our algorithm does not use such kind of techniques as in ChARM by Zaki and Hsiao. In MONSA there is active only one branch which is under construction. All used techniques are proved. Our purpose is to introduce the approach used in MONSA and the correspondence of its basics and concepts to the approach by Zaki and Hsiao. We have used MONSA for creating a data mining method called Hypothesis Generator. By the algorithm the intersections (closed sets) and IF...THEN rules on the subsets of source data set simultaneously are found. MONSA does not depend on the initial order of objects. MONSA treats not only binary data, but a larger set of discrete values.