Table of Contents Author Guidelines Submit a Manuscript
International Journal of Aerospace Engineering
Volume 2014 (2014), Article ID 218710, 11 pages
http://dx.doi.org/10.1155/2014/218710
Research Article

Use of Active Learning to Design Wind Tunnel Runs for Unsteady Cavity Pressure Measurements

Mechanical Engineering and Material Science Department, William Marsh Rice University, Houston, TX 77251-1892, USA

Received 23 December 2013; Accepted 13 May 2014; Published 19 June 2014

Academic Editor: Christopher J. Damaren

Copyright © 2014 Ankur Srivastava and Andrew J. Meade. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. B. Tracy and E. B. Plentovich, “Cavity unsteady-pressure measurements at subsonic and transonic speeds,” Tech. Rep. NASA-TP-3669, 1997. View at Google Scholar
  2. http://futureweaponsandmore.blogspot.com/.
  3. http://wararchive.blogspot.com/2009/11/lockheed-f-35-lightning-ii-specs-and.html.
  4. K.-M. Chung, “Geometric effect on compressible rectangular cavity flows,” Transactions of the Japan Society for Aeronautical and Space Sciences, vol. 45, no. 147, pp. 28–34, 2002. View at Google Scholar · View at Scopus
  5. N. M. Komerath, K. K. Ahuja, and F. W. Chambers, “Prediction and measurement of flows over cavities—a survey,” in Proceedings of the AIAA 25th Aerospace Sciences Meeting, AIAA 87-0166, Reno, Nev, USA, January 1987.
  6. A. Srivastava and A. J. Meade, “Application of sequential function approximation based machine learning for classification of cavity flow and resonance,” Journal of Aircraft. In press. View at Publisher · View at Google Scholar
  7. A. Srivastava, A. J. Meade, and J. Needham, “Adaptive algorithm for classifying launch and recovery of the HH-60H seahawk,” Journal of Aerospace Computing, Information and Communication, vol. 6, no. 2, pp. 109–120, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Kokkolaras, Utilizing parallel optimization in computational fluid dynamics [Ph.D. thesis], Mechanical Engineering Department, Rice University, 1997.
  9. A. J. Meade Jr., “Application of scattered data approximation to a rotorcraft heath monitoring problem,” Journal of Aerospace Computing, Information and Communication, vol. 1, no. 4, pp. 175–188, 2004. View at Google Scholar · View at Scopus
  10. A. Srivastava and A. J. Meade, “A sparse greedy algorithm for classification,” Advances in Adaptive Data Analysis, vol. 2, no. 1, pp. 97–114, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Hasenjäger, Active Data Selection in Supervised and Unsupervised Learning, Der Technischen Fakultät, der Universität Bielefeld, 2000.
  12. D. Lewis and W. A. Gale, “A sequential algorithm for training text classifiers,” in Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 3–12, 1994.
  13. M. D. McKay, “Latin Hypercube Sampling as a tool in uncertainty analysis of computer models,” in Proceedings of the Winter Simulation Conference, pp. 557–564, 1992.
  14. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, Springer Series in Statistics, 2001.
  15. D. A. Cohn, “Neural network exploration using optimal experiment design,” Neural Networks, vol. 9, no. 6, pp. 1071–1083, 1996. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Freund, “Boosting a weak learning algorithm by majority,” Information and Computation, vol. 121, no. 2, pp. 256–285, 1995. View at Publisher · View at Google Scholar · View at Scopus
  17. S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397–3415, 1993. View at Publisher · View at Google Scholar · View at Scopus
  18. L. K. Jones, “Constructive approximations for neural networks by sigmoidal functions,” Proceedings of the IEEE, vol. 78, no. 10, pp. 1586–1589, 1990. View at Publisher · View at Google Scholar · View at Scopus
  19. L. K. Jones, “A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training,” The Annals of Statistics, vol. 20, no. 1, pp. 608–613, 1992. View at Publisher · View at Google Scholar
  20. A. R. Barron, “Universal approximation bounds for superpositions of a sigmoidal function,” IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 930–945, 1993. View at Publisher · View at Google Scholar · View at Scopus
  21. C. A. J. Fletcher, Computational Galerkin Methods, Springer, New York, NY, USA, 1984.
  22. A. J. Meade Jr. and B. A. Zeldin, “Approximation properties of local bases assembled from neural network transfer functions,” Mathematical and Computer Modelling, vol. 28, no. 9, pp. 43–62, 1998. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Rifkin and A. Klautau, “In defense of one-vs-all classification,” Journal of Machine Learning Research, vol. 5, pp. 101–141, 2004. View at Google Scholar
  24. B. Cui, H. Lin, and Z. Yang, “Uncertainty sampling-based active learning for protein-protein interaction extraction from biomedical literature,” Expert Systems with Applications, vol. 36, no. 7, pp. 10344–10350, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. G. Schohn and D. Cohn, “Less is more: active learning with support vector machines,” in Proceedings of 17th International Conference on Machine Learning, pp. 839–846, 2000.
  26. H. S. Seung, M. Opper, and H. Sompolinsky, “Query by committee,” in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pp. 287–294, Pittsburgh, Pa, USA, July 1992. View at Scopus
  27. T. Luo, K. Kramer, D. B. Goldgof et al., “Active learning to recognize multiple types of plankton,” Journal of Machine Learning Research, vol. 6, pp. 589–613, 2005. View at Google Scholar · View at Scopus
  28. C. Korner and S. Wrobel, “Multi-class ensemble-based active learning,” Machine Learning, vol. 42, no. 12, pp. 687–694, 2006. View at Google Scholar
  29. J. Platt, “Probabilistic outputs for support vector machines and comparison to regularized likelihood methods,” in Advances in Large Margin Classifiers, pp. 61–74, MIT Press, 1999. View at Google Scholar
  30. K. Duan, S. S. Keerthi, W. Chu, S. K. Shevade, and A. N. Poo, “Multi-category classification by soft-max combination of binary classifiers,” in Proceedings of the 4th International Workshop on Multiple Classifier Systems, pp. 125–134, 2003.