Rule Schema Multi-Level for Local Patterns Analysis: Application in Production FieldJournal: The International Arab Journal of Information Technology (Vol.14, No. 5)
Publication Date: 2017-09-01
Authors : Salim Khiat; Hafida Belbachir; Sid Rahal;
Page : 670-680
Keywords : Schema; association rules; exceptional rules; global rules; ontology;
Recently, Multi-Database Mining (MDBM) for association rules has been recognized as an important and timely research area in the Knowledge Discovery Database (KDD) community. It consists of mining different databases in order to obtain frequent patterns which are forwarded to a centralized place for global pattern analysis. Various synthesizing models [8,9,13,14,15,16] have been proposed to build global patterns from the forwarded patterns. It is desired that the synthesized rules from such forwarded patterns must closely match with the mono-mining results, ie., the results that would be obtained if all the databases are put together and mining has been done. When the pattern is present in a site but fails to satisfy the minimum support threshold value, it is not allowed to take part in the pattern synthesizing process. Therefore this process can lose some interesting patterns which can help the decision maker to make the right decisions. To adress this problem, we propose to integrate the users knowledge in the local and global mining process. For that we describe the users beliefs and expectation by the rule schemas multi-level and integrate them in both the local association rules mining and in the synthesizing process. In this situation we get true global patterns of select items as there is no need to estimate them. Furthermore, a novel Condensed Patterns Tree (CP_TREE)structure is defined in order to store the candidates patterns for all organization levels which can improve the time processing and reduce the space requirement. In addition CP_TREE structure facilitate the exploration and the projection of the candidates patterns in differents levels. finally We conduct some experimentations in real world databases which are the production field and demonstrate the effectivlness of the CP_TREE structure on time processing and space requirement.
Other Latest Articles
Last modified: 2019-05-09 16:54:15