Advertisement

Parametric and Nonparametric Classification for Minimizing Misclassification Errors

  • Sushma Nagdeote
  • Sujata Chiwande
Conference paper
  • 14 Downloads
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 100)

Abstract

Parametric classification fits the parametric model to the training data and interpolates to classify the test data, whereas nonparametric methods like regression tree and classification trees use different techniques to determine classification. The classification process can be of two types: supervised and unsupervised. In supervised classification, training data are used to design the classifier. Bayes’s rule, nearest neighboring rule, and perceptron rules are few widely used supervised classification rules. For unlabeled data, the process of classification is called clustering or unsupervised classification. This paper proposes a wrapper-based approach for pattern classification to minimize the error factor. Techniques, such as Bayes’s classification, K-NN classifier, and NN classifier, are used to classify the patterns using linearly separable, linearly nonseparable, and Gaussian sample dataset. These methods classify the data in two stages: training stage and prediction stage. In this paper, we will be using parametric and nonparametric decision-making algorithm as we know the statistical and geometric properties of the patterns under study.

Keywords

Parametric Nonparametric Maximum margin hyperplane Soft margin Wrapper 

References

  1. 1.
    Sampat MP, Bovik AC, Aggarwal JK, Castleman KR (2005) Supervised parametric and non parametric classification of chromosome image. Pattern Recogn 38(8):1209–1223.  https://doi.org/10.1016/j.patcog.2004.09.010CrossRefGoogle Scholar
  2. 2.
    Kumar Y, Sahoo G (2012) Analysis of parametric and non parametric classifiers for classification techniques using WEKA. Int J Inf Technol Comput Sci 7:43–49.  https://doi.org/10.5815/ijitcs.2012.07.06CrossRefGoogle Scholar
  3. 3.
    Lange T, Law MH, Jain AK, Buhmann J (2005) Learning with constrained and unlabelled data. IEEE Comput Conf Soc Comput Vis Pattern Recogn 1:730–737.  https://doi.org/10.1109/CVPR.2005.210CrossRefGoogle Scholar
  4. 4.
    Bhatia N, Vandana (2010) Survey of nearest neighbour techniques. Int J Comput Sci Inf Secur 8(2)Google Scholar
  5. 5.
    Fernandez AP (2015) Geometrical models for time series analysis. 18 ECTS thesis in artificial intelligence, Oct 2015Google Scholar
  6. 6.
    Aimal H, Rehman S, Farooq U, Ain QU, Riaz F, Hassan A (2018) Convolutional neural network based image segmentation: a review. In: Proceeding, vol 10649. Pattern recognition and tracking. SPIE 2018.  https://doi.org/10.1117/12.2304711
  7. 7.
    Ahmadi SA, Mehrshad N, Razavi SM (2018) Semisupervised graph-based hyperspectral images classification using low-rank representation graph with considering the local structure of data. J Electron Imag 27(6):063002, 13 Nov 2018.  https://doi.org/10.1117/1.jei.27.6.063002CrossRefGoogle Scholar
  8. 8.
    Zhang M, Thomas Fletcher P (2013) Probablistic principal geodesic analysis. In: Advances in neural information processing systems, Jan 2013Google Scholar
  9. 9.
    Klassen E, Srivastava A, Mio M, Joshi SH (2004) Analysis of planar shapes using geodespic paths on shape spaces. IEEE, June 2004.  https://doi.org/10.1109/tpami.2004.1262333CrossRefGoogle Scholar
  10. 10.
    Bhattacharya A, Dunson DB (2010) Non parametric bayesian density estimation on manifolds with applications to planar shapes. Biometrika 97(4):851–865MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Sushma Nagdeote
    • 1
  • Sujata Chiwande
    • 2
  1. 1.Department of Electronics EngineeringFr. CRCEMumbaiIndia
  2. 2.Department of Electronics and Telecommunication EngineeringYCCENagpurIndia

Personalised recommendations