Skip to main content

Continual Rare-Class Recognition with Emerging Novel Subclasses

  • Conference paper
  • First Online:
Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11907))

Abstract

Given a labeled dataset that contains a rare (or minority) class of of-interest instances, as well as a large class of instances that are not of interest, how can we learn to recognize future of-interest instances over a continuous stream? We introduce RaRecognize, which (i) estimates a general decision boundary between the rare and the majority class, (ii) learns to recognize individual rare subclasses that exist within the training data, as well as (iii) flags instances from previously unseen rare subclasses as newly emerging. The learner in (i) is general in the sense that by construction it is dissimilar to the specialized learners in (ii), thus distinguishes minority from the majority without overly tuning to what is seen in the training data. Thanks to this generality, RaRecognize ignores all future instances that it labels as majority and recognizes the recurrent as well as emerging rare subclasses only. This saves effort at test time as well as ensures that the model size grows moderately over time as it only maintains specialized minority learners. Through extensive experiments, we show that RaRecognize outperforms state-of-the art baselines on three real-world datasets that contain corporate-risk and disaster documents as rare classes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, Z., Liu, B.: Lifelong machine learning. Synth. Lect. Artif. Intell. Mach. Learn. 10(3), 1–145 (2016)

    Article  Google Scholar 

  2. French, R.: Catastrophic forgetting in connectionist networks. Trends Cogn. Sci. 3, 128–135 (1999)

    Article  Google Scholar 

  3. Kemker, R., Kanan, C.: Fearnet: brain-inspired model for incremental learning. In ICLR (2018)

    Google Scholar 

  4. Kim, Y.: Convolutional neural networks for sentence classification. In: EMNLP (2014)

    Google Scholar 

  5. Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. PNAS 114(13), 3521–3526 (2017)

    Article  MathSciNet  Google Scholar 

  6. Le, Q.V., Mikolov, T.: Distributed representations of sentences and documents. ICML 14, 1188–1196 (2014)

    Google Scholar 

  7. Lee, S.-W., Kim, J.-H., Jun, J., Ha, J.-W., Zhang, B.-T.: Overcoming catastrophic forgetting by incremental moment matching. In NeurlPS, pp. 4652–4662 (2017)

    Google Scholar 

  8. Mu, X., Ting, K.M., Zhou, Z.-H.: Classification under streaming emerging new classes: a solution using completely-random trees. IEEE TKDE 29(8), 1605–1618 (2017)

    Google Scholar 

  9. Mu, X., Zhu, F., Du, J., Lim, E.-P., Zhou, Z.-H.: Streaming classification with emerging new class by class matrix sketching. In: AAAI (2017)

    Google Scholar 

  10. Nguyen, H., Wang, X., Akoglu, L.: Continual rare-class recognition with emerging novel subclasses. arXiv preprint (2019)

    Google Scholar 

  11. Rebuffi, S.-A., Kolesnikov, A., Sperl, G., Lampert, C.H.: ICARL: Incremental classifier and representation learning. In: CVPR, pp. 2001–2010 (2017)

    Google Scholar 

  12. Shin, H., Lee, J.K., Kim, J., Kim, J.: Continual learning with deep generative replay. In: NeurlPS, pp. 2990–2999 (2017)

    Google Scholar 

  13. Shu, L., Xu, H., Liu, B.: Doc: deep open classification of text documents. In: EMNLP (2017)

    Google Scholar 

  14. Shu, L., Xu, H., Liu, B.: Unseen class discovery in open-world classification. arXiv preprint arXiv:1801.05609 (2018)

  15. Siffer, A., Fouque, P.-A., Termier, A., Largouet, C.: Anomaly detection in streams with extreme value theory. In: KDD, pp. 1067–1075. ACM (2017)

    Google Scholar 

  16. Xu, H., Liu, B., Shu, L., Yu, P.: Open-world learning and application to product classification. In: WWW (2019)

    Google Scholar 

  17. Zhang, X., Zhao, J., LeCun, Y.: Character-level convolutional networks for text classification. In: NeurlPS, pp. 649–657 (2015)

    Google Scholar 

Download references

Acknowledgments

This research is sponsored by NSF CAREER 1452425 and IIS1408287. In addition, the researchers gratefully acknowledge the support of the Risk and Regulatory Services Innovation Center at Carnegie Mellon University sponsored by PwC. Conclusions in this material are those of the authors and do not necessarily reflect the views, expressed or implied, of the funding parties.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hung Nguyen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nguyen, H., Wang, X., Akoglu, L. (2020). Continual Rare-Class Recognition with Emerging Novel Subclasses. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2019. Lecture Notes in Computer Science(), vol 11907. Springer, Cham. https://doi.org/10.1007/978-3-030-46147-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-46147-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-46146-1

  • Online ISBN: 978-3-030-46147-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics