Generalized Non-Reducible Descriptors

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ventzeslav Valev Articles by Bülent Sankur Articles by Petia Radeva

15th International Conference on Pattern Recognition (ICPR'00) - Volume 2

Barcelona, Spain

September 03-September 08

ISBN: 0-7695-0750-6

	ASCII Text	x
	Ventzeslav Valev, Bülent Sankur, Petia Radeva, "Generalized Non-Reducible Descriptors," Pattern Recognition, International Conference on, vol. 2, pp. 2394, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 2, 2000.

	BibTex	x
	@article{ 10.1109/ICPR.2000.906095, author = {Ventzeslav Valev and Bülent Sankur and Petia Radeva}, title = {Generalized Non-Reducible Descriptors}, journal ={Pattern Recognition, International Conference on}, volume = {2}, year = {2000}, isbn = {0-7695-0750-6}, pages = {2394}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.906095}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Pattern Recognition, International Conference on TI - Generalized Non-Reducible Descriptors SN - 0-7695-0750-6 SP EP A1 - Ventzeslav Valev, A1 - Bülent Sankur, A1 - Petia Radeva, PY - 2000 KW - Supervised Pattern Recognition KW - Machine Learning KW - Descriptors KW - Non-Reducible Descriptors KW - Generalized Non-Reducible Descriptors VL - 2 JA - Pattern Recognition, International Conference on ER -

Ventzeslav Valev, St. Louis University

Bülent Sankur, Bogazici University

Petia Radeva, Computer Vision Center

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.906095

This paper provides a generalization of non-reducible descriptors. Non-reducible descriptors are used in supervised pattern recognition problems when the pattern descriptions consist of Boolean variables. This generalization extends the concept of distance between patterns of different classes. A mathematical model to construct generalized non-reducible descriptors, a computational procedure, and numerical examples are discussed.

Index Terms:

Supervised Pattern Recognition, Machine Learning, Descriptors, Non-Reducible Descriptors, Generalized Non-Reducible Descriptors

Citation:

Ventzeslav Valev, Bülent Sankur, Petia Radeva, "Generalized Non-Reducible Descriptors," icpr, vol. 2, pp.2394, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 2, 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.