A parallel genetic algorithm approach for automated discovery of censored production rules
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Mining unexpected multidimensional rules
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Generalizing Data in Natural Language
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Discovering unexpected documents in corpora
Knowledge-Based Systems
WebUser: mining unexpected web usage
International Journal of Business Intelligence and Data Mining
Undirected exception rule discovery as local pattern detection
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
An evolutionary approach to discover intra-and inter-class exceptions in databases
International Journal of Intelligent Systems Technologies and Applications
Hi-index | 0.00 |
This article presents an algorithm that seeks every possible exception rule that violates a commonsense rule and satisfies several assumptions of simplicity. Exception rules, which represent systematic deviation from commonsense rules, are often found interesting. Discovery of pairs that consist of a commonsense rule and an exception rule, resulting from undirected search for unexpected exception rules, was successful in various domains. In the past, however, an exception rule represented a change of conclusion caused by adding an extra condition to the premise of a commonsense rule. That approach formalized only one type of exception and failed to represent other types. To provide a systematic treatment of exceptions, we categorize exception rules into 11 categories, and we propose a unified algorithm for discovering all of them. Preliminary results on 15 real-world datasets provide an empirical proof of effectiveness of our algorithm in discovering interesting knowledge. The empirical results also match our theoretical analysis of exceptions, showing that the 11 types can be partitioned in three classes according to the frequency with which they occur in data. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 673–691, 2005.