loading...
Pattern Recognition Using Information Slicing Method (pRISM)
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104825816th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sameer Singh, University of Exeter
Antony Galton, University of Exeter
In this paper we present a method of partitioning feature space of given data into a number of hypercuboids. We derive the overall complexity of the classification problem as a weighted sum of the hypercube's separability measure and the number of elements present in them. On a total of eight Gaussian distributions and two UCI pattern recognition benchmarks, we quantify the complexity of the classification problem. Also, we discuss how our approach can be used to solve a range of pattern recognition problems in a non-conventional but highly effective manner.
Citation:
Sameer Singh, Antony Galton, "Pattern Recognition Using Information Slicing Method (pRISM)," icpr, vol. 2, pp.20144, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 2, 2002
Usage of this product signifies your acceptance of the Terms of Use.