Discovery of emerging patterns from nearest neighbors

In this paper, we propose a scalable classifier that uses jumping emerging patterns (JEPs), which are combinations of values that occur in one class. The original classifier, DeEPs, is an instance-based classifier that operates on all instances in real-time. It discovers maximal patterns that occur throughout the entire database and identifies JEPs by using these patterns. The necessary computational effort, though, is likely to increase when DeEPs is applied to a large database. Our proposed classifier operates on the nearest neighbors of a test instance. This reduction of instances improves scalability as the database volume increases. Moreover, our classifier imposes a restriction regarding JEPs discovery, so that it excludes patterns that cannot be identified as either correct JEPs or JEPs caused by the maximal patterns missing from nearest neighbors. These probably incorrect JEPs are specialized with additional items and participate in class determination. Our classifier perform significantly faster with these two enhancements, while it remains as accurate as the original classifier.