skip to main content
10.1145/2480362.2480515acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Novelty detection algorithm for data streams multi-class problems

Published:18 March 2013Publication History

ABSTRACT

Novelty detection has been presented in the literature as one-class problem. In this case, new examples are classified as either belonging to the target class or not. The examples not explained by the model are detected as belonging to a class named novelty. However, novelty detection is much more general, especially in data streams scenarios, where the number of classes might be unknown before learning and new classes can appear any time. In this case, the novelty concept is composed by different classes. This work presents a new algorithm to address novelty detection in data streams multi-class problems, the MINAS algorithm. Moreover, we also present a new experimental methodology to evaluate novelty detection methods in multi-class problems. The data used in the experiments include artificial and real data sets. Experimental results show that MINAS is able to discover novelties in multi-class problems.

References

  1. C. C. Aggarwal, J. W. J. Han, and P. S. Yu. A framework for clustering evolving data streams. In Proceedings of the 29th International Conference on Very Large Data Bases, volume 29, pages 81--92, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Ahmed and M. Coates. Multivariate online anomaly detection using kernel recursive least squares. In Proc. IEEE Infocom, pages 625--633, Anchorage, Alaska, 2007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Bifet, G. Holmes, B. Pfahringer, P. Kranen, H. Kremer, T. Jansen, and T. Seidl. MOA: Massive online analysis, a framework for stream classification and clustering. 11:44--50, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Casimir, E. Boutleux, G. Clerc, and A. Yahoui. The use of features selection and nearest neighbors rule for faults diagnostic in induction motors. Eng. Appl. Artif. Intell., 19(2):169--177, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. A. Clifton, H. Yin, and Y. Zhang. Support vector machine in novelty detection for multi-channel combustion data. In Proceedings of the Third international conference on Advances in Neural Networks - Volume Part III, ISNN'06, pages 836--843, Berlin, Heidelberg, 2006. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Frank and A. Asuncion. UCI machine learning repository, 2010.Google ScholarGoogle Scholar
  7. J. Gama. Knowledge Discovery from Data Streams. Chapman & Hall/CRC Data Mining and Knowledge Discovery Series. CRC Press, 1 edition, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Z. Hayat and M. R. Hashemi. A dct based approach for detecting novelty and concept drift in data streams. In International Conference on Soft Computing and Pattern Recognition (SoCPaR), pages 373--378. IEEE, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  9. M. Markou and S. Singh. Novelty detection: a review part 1: statistical approaches. Signal Process., 83(12):2481--2497, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Marsland, J. Shapiro, and U. Nehmzow. A self-organising network that grows when required. Neural Network, 15:1041--1058, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Masud, J. Gao, L. Khan, J. Han, and B. M. Thuraisingham. Classification and novel class detection in concept-drifting data streams under time constraints. IEEE Trans. on Knowl. and Data Eng., 23(6):859--874, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. M. Masud, T. M. Al-Khateeb, L. Khan, C. Aggarwal, J. Gao, J. Han, and B. Thuraisingham. Detecting recurring and novel classes in concept-drifting data streams. In Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM '11, pages 1176--1181, Washington, DC, USA, 2011. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Naldi, R. Campello, E. Hruschka, and A. Carvalho. Efficiency issues of evolutionary k-means. App. Soft Comp., 11:1938--1952, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. E. J. Spinosa, A. C. P. L. F. Carvalho, and J. Gama. Novelty detection with application to data streams. Intelligent Data Analysis, 13(3):405--422, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Y. Yan and C. Chow. Parzen-window network intrusion detectors. In International Conference on Pattern Recognition, ICPR '02, pages 385--388, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Novelty detection algorithm for data streams multi-class problems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
      March 2013
      2124 pages
      ISBN:9781450316569
      DOI:10.1145/2480362

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 18 March 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader