Mining jumping emerging patterns by streaming feature selection

0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the main challenges for making an accurate classifier based on mining emerging pattern is extraction of a minimal set of strong emerging patterns from a high-dimensional dataset. This problem is harder when features are generated dynamically and so the entire feature space is unavailable. In this scheme, features are obtained one by one instead of having all features available before learning starts. In this paper, we propose mining Jumping Emerging Patterns by Streaming Feature selection (JEPSF for short) using a dynamic border-differential algorithmwhere builds a new border of the jumping emerging pattern space based on an old border of the jumping emerging pattern space for new coming features. This framework completely avoids going back to the most initial step to build a new border of the jumping emerging pattern space. This algorithm helps reducing number of irrelevant emerging patterns, what in turns brings significant advantages to the presented algorithm. Thus the number of jumping emerging patterns is reduced and strong emerging pattern is also extracted. We experimentally represent effectiveness of the proposed approach against other state-of-the-art methods, in terms of predictive accuracy.

Cite

CITATION STYLE

APA

Alavi, F., & Hashemi, S. (2014). Mining jumping emerging patterns by streaming feature selection. In Advances in Intelligent Systems and Computing (Vol. 245, pp. 337–349). Springer Verlag. https://doi.org/10.1007/978-3-319-02821-7_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free