Mining border descriptions of emerging patterns from dataset pairs

Publication Type:
Journal Article
Knowledge and Information Systems, 2005, 8 (2), pp. 178 - 202
Issue Date:
Filename Description Size
Thumbnail2010006992OK.pdf470.79 kB
Adobe PDF
Full metadata record
The mining of changes or differences or other comparative patterns from a pair of datasets is an interesting problem. This paper is focused on the mining of one type of comparative pattern called emerging patterns. Emerging patterns are denoted by EPs and are defined as patterns for which support increases from one dataset to the other with a big ratio. The number of EPs is sometimes huge. To provide a good structure for and to reduce the size of mining results, we use borders to concisely describe large collections of EPs in a lossless way. Such a border consists of only the minimal (under set inclusion) and the maximal EPs in the collection. We also present an algorithm for efficiently computing the borders of some desired EPs by manipulating the input borders only. Our experience with many datasets in the UCI Repository and recent cancer diagnosis datasets demonstrated that: Both the EP pattern type and our algorithm are useful for building accurate classifiers and useful for mining multifactor interactions, for example, minimal gene groups potentially responsible for the development of cancer. © Springer-Verlag London Ltd. 2004.
Please use this identifier to cite or link to this item: