یک الگوریتم مبتنی بر توصیف جدید برای کشف دانش جدید از مجموعه داده های طبقه بندی شده بدون استفاده از پشتیبانی

This paper introduces a novel proposal to discover the best associative classification rules through studying the influence of the attributes used in robust catalogues. Notice that a catalogue is defined as a dataset free of duplicate records. Moreover, a robust catalogue is obtained when incomplete records and those with uncertainty are eliminated from a catalogue. Therefore, a robust catalogue is a collection of association rules with 100% confidence and unitary support. In this paper we demonstrate that robust catalogues contain the same association rules as the datasets from which they were obtained, but can be managed in memory without eliminating any data from the analysis. In fact, the experiments performed show that all robust catalogues contained in a classification dataset are easily obtained, providing millions of associative classification rules with 100% confidence to the expert researcher in data mining.