نتایج جستجو برای: minimum distance classifier

تعداد نتایج: 432772  

2003
Wei Liu Hexin Chen Mianshu Chen

Kernel trick is a powerful tool being used for solving complex pattern classification problem. As long as a linear feature extraction algorithm can be expressed exclusively by dot-products, it can be extended to non-linear version by combining kernel method. In this paper, we present such an improved iterative algorithm used for linear discriminant analysis. By mapping data onto high dimensiona...

Journal: :Int. J. Approx. Reasoning 2008
Ashish Ghosh Bijnan Parai

De novo structure determination of proteins is a significant research issue of bioinformatics. Biochemical procedures for protein structure determination are costly. Use of different pattern classification techniques are proved to ease this task. In this article, the secondary structure prediction task has been mapped into a three-class problem of pattern classification, where the classes are h...

2012
D. Zhou X. Shen Y. Liu

In this paper, a novel approach, namely nonlinear subprofile space (NSS), is proposed for radar target recognition using high-resolution range profile (HRRP). First, the HRRP samples are mapped into a high-dimensional feature space using nonlinear mapping. Second, the nonlinear features, namely nonlinear subprofiles, are extracted by nonlinear discriminant analysis. Then, for each class, the no...

2015
Madhura M Suganthi Venkatachalam

This paper presents classification of various land cover types from the raw satellite image using supervised classifiers and performances of the classifiers are analyzed. Geo coded and Geo-referenced remote sensed images from Survey of India, Government of India Topographical maps are used. Prior to classification, Training process to assemble a set of statistics describing spectral response pa...

Journal: :IEEE Transactions on Information Forensics and Security 2009

Journal: :Journal of Combinatorial Theory, Series A 2019

Journal: :Advances in Mathematics 1992

Journal: :Journal of Mathematical Chemistry 2021

Abstract For a graph G , and two distinct vertices u v of let $$n_{G}(u,v)$$ n G ( u , v ) be the number that are closer in to than . Miklavi? Šparl (arXiv:2011.0...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید