Irrelevant Feature and Rule Removal for Structural Associative Classification

Abstract

In the classifi cation task, the presence of irrelevant features can signifi cantly degrade the performance of classifi cation algorithms, in terms of additional processing time, more complex models and the likelihood that the models have poor generalization power due to the over fi tting problem. Practical applications of association rule mining often suffer from overwhelming number of rules that are generated, many of which are not interesting or not useful for the application in question. Removing rules comprised of irrelevant features can signifi cantly improve the overall performance. In this paper, we explore and compare the use of a feature selection measure to fi lter out unnecessary and irrelevant features/attributes prior to association rules generation. The experiments are performed using a number of real-world datasets that represent diverse characteristics of data items. Empirical results confi rm that by utilizing feature subset selection prior to association rule generation, a large number of rules with irrelevant features can be eliminated. More importantly, the results reveal that removing rules that hold irrelevant features improve the accuracy rate and capability to retain the rule coverage rate of structural associative association.

Enabling efficient business process mining using flatten sequential structure model

“…Their research prove that applying DSM on XML format data have better result compare to FSM. Shaharanee et al [13] and Shaharanee and Jamil [25] suggest that performing correlation analysis can filter or reduce the unrelated variables in XML document to improve the interestingness of result after performing analytics or data mining. However, the weakness of DSM is assuming all tree structure in XML document are the same.…”