Feature selection focused within error clusters

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Wang, Sui Yu ^a   Baird, Henry S ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; ITERATIVE METHODS;

FEATURE DISCOVERY; FEATURE MAPPING; FEATURE SELECTION METHODS; FEATURE SPACE; FORWARD SELECTION; LARGE SCALE EXPERIMENTS; LINEAR FEATURE; TIME-EFFICIENT;

FEATURE EXTRACTION;

EID: 77957933224     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2008.4761924     Document Type: Conference Paper

References (21)

1. H. S. Baird and M. R. Casey. Towards versatile document analysis systems. In Document Analysis Systems, pages 280-290, 2006.
2. H. S. Baird, M. A. Moll, J. Nonnemaker, M. R. Casey, and D. L. Delorenzo. Versatile document image content extraction. In Proc., SPIE/IS&T Document Recognition & Retrieval XII Conf., San Jose, CA, January 2006.
3. R. E. Bellman, editor. Adaptive Control Processes. Princeton University Press, Princeton, NJ, 1961.
4. Y. Bengio, O. Delalleau, N. L. Roux, J.-F. Paiement, P. Vincent, and M. Ouimet. Feature Extraction: Foundations and Applications, chapter Spectral Dimensionality Reduction, pages 519.549. Springer, 2003.
5. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Trans. on Information Theory, 13:21-27, 1967.
6. B. N. Datta. Numerical Linear Algebra and Applications. Brooks/Cole Publishing Company, 1994.
7. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, New York, 1996.
8. J. Dongarra, V. Eijkhout, and J. Langou. Handbook of Linear Algebra. CRC press, 2006.
9. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification, 2nd Edition. Wiley, New York, 2001.
10. J. D. Elashoff, R. M. Elashoff, and G. Goldman. On the choice of variables in classification problems with dichotomous variables. Biometrika, 54:668-670, 1967.
11. I. Guyon and A. Elisseeff. An introduction to variable and feature selection. J. Mach. Learn. Res., 3:1157-1182, 2003.
12. I. Guyon, S. Gunn, M. Nikravesh, and L. A. Zadeh, editors. Feature Extraction: Foundations and Applications. Studies in Fuzziness and Soft Computing. Springer, 2006.
13. F. E. Hohn. Elementary Matrix Algebra. Dover Publications; 3rd edition, Jan 27 2003.
14. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Boosting algorithms as gradient descent. In In Advances in Neural Information Processing Systems 12, pages 512-518. MIT Press, 2000.
15. M. Momma and K. P. Bennett. Feature Extraction: Foundations and Applications, chapter Constructing Orthogonal Latent Features for Arbitrary Loss, pages 551-585. Springer, 2003.
16. C. E. Shannon. A mathematical theory of communication. Bell Sys. Tech. Journal, 27, 1948.
17. S.Watanabe. Pattern Recognition: Human and Mechanical. Wiley, New York, 1985.
18. H. Wold. The fix-point approach to interdependent systems. 1981).
19. D. H. Wolpert, editor. The Mathematics of Generalization. Addison-Wesley, Reading, MA, 1995.
20. D. H. Wolpert and W. G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe, NM, 1995.
21. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997.