Skip to main content

Induction in Multi-Label Domains

  • Chapter
  • First Online:
An Introduction to Machine Learning

Abstract

All the techniques discussed in the previous chapters assumed that each example is labeled with one and only one class. In realistic applications, however, this is not always the case. Quite often, an example is known to belong to two or more classes at the same time, sometimes to many classes. For machine learning, this poses certain new problems. After a brief discussion of how to deal with this issue within the framework of classical paradigms, this chapter describes the currently most popular approach: binary relevance.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    The reader will recall that the target values 0. 8 and 0. 2 are more appropriate for the backpropagation-of-error algorithm than 1 and 0. See Chap. 5.

  2. 2.

    The reader has noticed that the issue is similar to the one we have encountered in the section dealing with classifier chains.

References

  1. Boutell, M. R., Luo, J., Shen, X., & Brown, C. M. (2004). Learning multi-label scene classification. Pattern Recognition, 37, 1757–1771

    Article  Google Scholar 

  2. Clare, A. & King, R. D. (2001). Knowledge discovery in multi-label phenotype data. In Proceedings of the 5th European conference on principles of data mining and knowledge discovery, PKDD’01, Freiburg, Germany (pp. 42–53)

    Google Scholar 

  3. Godbole, S. & Sarawagi, S. (2004). Discriminative methods for multi-label classification. In H. Dai, R. Srikant, & C. Zhang (Eds.), Lecture Notes in Artificial Intelligence, Berlin, Heidelberg: Springer (Vol. 3056, pp. 22–30)

    Google Scholar 

  4. Koller, D. & Sahami, M. (1997). Hierarchically classifying documents using very few words. In Proceedings of the 14th International conference on machine learning, ICML’07, San Francisco, USA (pp. 170–178)

    Google Scholar 

  5. McCallum, A. (1999). Multi-label text classification with a mixture model trained by EM. In Proceedings of the workshop on text learning (AAAI’99) (pp. 1–7).

    Google Scholar 

  6. Read, J., Pfahringer, B., Holmes, G., & Frank, E. (2011). Classifier chains for multi-label classification. Machine Learning, 85, 333–359.

    Article  MathSciNet  Google Scholar 

  7. Zhang, M.-L. & Zhou, Z.-H. (2007). ML-KNN: A lazy learing approach to multi-label learning. Pattern Recognition, 40, 2038–2048.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Kubat, M. (2017). Induction in Multi-Label Domains. In: An Introduction to Machine Learning. Springer, Cham. https://doi.org/10.1007/978-3-319-63913-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63913-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63912-3

  • Online ISBN: 978-3-319-63913-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics