Skip to main content
  • 1144 Accesses

Summary

In this paper, a novel active learning algorithm for design of experiments (DOE) is presented. In this algorithm, a boosting method for regression is firstly used to generate ensemble of learners from existing data. And then the average ensemble ambiguity among the element learners in the ensemble is proposed to determine which data point would be labeled by executing experiments. The results of simulations have shown that when the number of experiment is limited, the algorithm is better compared with traditional passive learning algorithms.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Abe, N., Mamitsuka, H.: Query learning strategies using boosting and bagging. International conference on Machine Learning (ICML).

    Google Scholar 

  2. Drucker, H. 1997. Improving regressors using boosting techniques. In Machine Learning: Proceedings of the Fourteenth International Conference 107–115. Morgan Kauffman, San Francisco.

    Google Scholar 

  3. Y. Freund, R. Schapire: A decision theoretic generalization of on-line learning and an application to boosting. In Proceedings of the Second European Conference on Computational Learning Theory (Euro COLT’95), pages 148–156, 1995.

    Google Scholar 

  4. Freedman, J.H.: Multivariate Adaptive Regression Splines, The Annals of Statistics, 19.

    Google Scholar 

  5. Gunnar, R.; A Documentation of RBF and AdaBoost Software Package. 2001.

    Google Scholar 

  6. Moore, A.W., Schneider, J. G.: Q2: Memory-based active learning for optimizing noisy continuous functions. In Proceedings of the Fifteenth International Conference on Machine Learning (pp.386–394).

    Google Scholar 

  7. N. Roy and A. McCallum, “Toward optimal active learning through sampling estimation of error reduction,” in Proc. 18th International Conference on Machine Learning(ICML01), 2001, pp. 441–448.

    Google Scholar 

  8. Prem Melville, Raymond J. Mooney: Diverse Ensembles for Active Learning. In Proc of the 21st International Conference on Machine Learning.

    Google Scholar 

  9. H. S. Seung, M. Opper, and H. Sompolinsky.: Query by committee. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 287–294. ACM Press, New York, NY, 1992.

    Google Scholar 

  10. Vijay S., Chidanand Apte, Tong Zhang: Active Learning using Adaptive Resampling. Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 91–98, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, T., Zhang, S. (2005). Active Learning with Ensembles for DOE. In: Zhang, W., Tong, W., Chen, Z., Glowinski, R. (eds) Current Trends in High Performance Computing and Its Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27912-1_32

Download citation

Publish with us

Policies and ethics