Skip to main content

Training Minimum Enclosing Balls for Cross Tasks Knowledge Transfer

  • Conference paper
Neural Information Processing (ICONIP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7663))

Included in the following conference series:

Abstract

This paper proposes a learner independent multi-task learning (MTL) scheme such that \(\mathcal{M}_\mathcal{L} = \mathcal{L}(T^i, KT(T^i, T^j))\), for i,j = 1,2, i ≠ j, where KT is independent to the learner \(\mathcal{L}\), and MTL is conducted for arbitrary learner combinations. In the proposed solution, we use Minimum Enclosing Balls (MEBs) as knowledge carriers to extract and transfer knowledge from one task to another. Since the knowledge presented in MEB can be decomposed as raw data, it can be incorporated into any learner as additional training data for a new learning task and thus improve its learning rate. The effectiveness and robustness of the proposed KT is evaluated on multi-task pattern recognition (MTPR) problems derived from UCI datasets, using classifiers from different disciplines for MTL. The experimental results show that multi-task learners using KT via MEB carriers perform better than learners without-KT, and it is successfully applied to all type of classifiers.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate Minimum Enclosing Balls in High Dimensions Using Core-sets. Journal of Experimental Algorithmics, 8(1.1) (2003)

    Google Scholar 

  2. Welzl, E.: Smallest Enclosing Disks (Balls and Ellipsoids). Results and New Trends in Computer Science pp. 359–370 (1991)

    Google Scholar 

  3. Chan, T.M.: Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-width Annulus. In: Proceedings of the 16th Annual Symposium on Computational Geometry, Clear Water Bay, Kowloon, Hong Kong, pp. 300–309. ACM, New York (2000)

    Google Scholar 

  4. Megiddo, N.: Linear-time Algorithms for Linear Programming in r 3 and Related Problems. SIAM Journal on Computing 12(4), 759–776 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Badoiu, M.: Optimal Core Sets for Balls. In: DIMACS Workshop on Computational Geometry (2002)

    Google Scholar 

  6. Chapelle, O., Scholkopf, B., Zien, A.: Semi-supervised Learning. MIT Press, Cambridge (2006)

    Google Scholar 

  7. Frank, A., Asuncion, A.: UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pang, S., Liu, F., Kadobayashi, Y., Ban, T., Inoue, D. (2012). Training Minimum Enclosing Balls for Cross Tasks Knowledge Transfer. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34475-6_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34475-6_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34474-9

  • Online ISBN: 978-3-642-34475-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics