A metric for selection of the most promising rules
The process of Knowledge Discovery in Databases pursues the goal of extracting useful knowledge from large amounts of data. It comprises a pre-processing step, application of a data-mining algorithm and post-processing of results. When rule induction is applied for data-mining one must be prepared to deal with the generation of a large number of rules. In these circumstances it is important to have a way of selecting the rules that have the highest predictive power. We propose a metric for selection of the n rules with the highest average distance between them. We defend that applying our metric to select the rules that are more distant improves the system prediction capabilities against other criteria for rule selection. We present an application example and empirical results produced from a synthesized data set on a financial domain.
Unable to display preview. Download preview PDF.
- 1.Gomes, P., Bento, C., Gago, P., Costa, E.: Towards a Case-Based Model for Creative Processes. Proceedings of the 12 th European Conference on Artificial Intelligence (1996) 122–126.Google Scholar
- 2.Kamber, M., Shingal, R.: Evaluating the Interestingness of Characteristic Rules. Proceedings of the Second International Conference on Knowledge Discovery & Data Mining (1995) 263–266.Google Scholar
- 3.Klementinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.: Finding Interesting Rules from Large Datasets of Discovered Association Rules. Proceedings of the Third International Conference on Information and Knowledge Management (1994) 401–407.Google Scholar
- 4.Liu, B., Hsu, W., Chen, S.: Using General Impressions to Analyse Discovered Classification Rules. Proceedings of the Third International Conference on Knowledge Discovery & Data Mining (1997) 31–36.Google Scholar
- 5.Major, J.A., Mangano, J.: Selecting Among Rules Induced from a Hurricane Database. Proceedings of the AAAI-93 Workshop on Knowledge Discovery in Databases (1993) 28–44.Google Scholar
- 6.Piatesky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. G. Piatesky-Shapiro & W.J. Frawley, eds., Knowledge Discovery in Databases. Menlo Park, CA: AAAI/MIT Press. (1991) 229–248.Google Scholar
- 7.Piatesky-Shapiro, G., Matheus, C.J.: The Interestingness of Deviations. Proceedings of the AAAI-94 Workshop on Knowledge Discovery in Databases (1994) 25–36.Google Scholar
- 9.Srikant, R., Agrawal, R.: Mining Generalized Association Rules. Proceedings of the 21 st VLDB conference (1995) 407–419.Google Scholar