BioMed Research International

BioMed Research International / 2017 / Article

Research Article | Open Access

Volume 2017 |Article ID 7560807 | https://doi.org/10.1155/2017/7560807

Hadi Raeisi Shahraki, Saeedeh Pourahmad, Najaf Zare, " Important Neighbors: A Novel Approach to Binary Classification in High Dimensional Data", BioMed Research International, vol. 2017, Article ID 7560807, 9 pages, 2017. https://doi.org/10.1155/2017/7560807

Important Neighbors: A Novel Approach to Binary Classification in High Dimensional Data

Academic Editor: Abdulbari Bener
Received03 Jul 2017
Revised07 Nov 2017
Accepted20 Nov 2017
Published11 Dec 2017

Abstract

nearest neighbors (KNN) are known as one of the simplest nonparametric classifiers but in high dimensional setting accuracy of KNN are affected by nuisance features. In this study, we proposed the important neighbors (KIN) as a novel approach for binary classification in high dimensional problems. To avoid the curse of dimensionality, we implemented smoothly clipped absolute deviation (SCAD) logistic regression at the initial stage and considered the importance of each feature in construction of dissimilarity measure with imposing features contribution as a function of SCAD coefficients on Euclidean distance. The nature of this hybrid dissimilarity measure, which combines information of both features and distances, enjoys all good properties of SCAD penalized regression and KNN simultaneously. In comparison to KNN, simulation studies showed that KIN has a good performance in terms of both accuracy and dimension reduction. The proposed approach was found to be capable of eliminating nearly all of the noninformative features because of utilizing oracle property of SCAD penalized regression in the construction of dissimilarity measure. In very sparse settings, KIN also outperforms support vector machine (SVM) and random forest (RF) as the best classifiers.

1. Introduction

The aim of classification methods is to assign true label to a new observation. Despite the fact that classification is one of the oldest statistical methods, finding the mechanism by which new observations are classified with the lowest error is still challenging. Although Fernández-Delgado et al. showed that there was no classifier which has the highest accuracy in all the situations, they present random forest (RF) and support vector machine (SVM) as the best classifiers among 182 classifiers [1].

nearest neighbors (KNN) are known as one of the simplest nonparametric classifiers. For a fixed value of , KNN assigns a new observation to the class of majority of the nearest neighbors [2, 3]. Nevertheless, in high dimensional setting, it is affected by nuisance (noninformative) features and suffers from “curse of dimensionality” [46]. In recent years, the effect of the curse of dimensionality on KNN has been studied by many authors. For example, Pal et al. showed that, in high dimensional setting, KNN classifier misclassifies about half of the observations [3, 7] and Lu et al. have noted that the nature of sparsity in high dimensional situation can lead to unstable results [5]. As a result of dimensionality curse, it has been argued by some authors that nearest neighbor can become ill defined because all pairwise distances concentrate around a single value (distance concentration) [3, 4, 7]. Beyer et al. stated that distance concentration can occur even with as few as 15 dimensions [7]. In 2010, Radovanović et al. introduced k-occurrences as follows: “the number of times a point appears among the nearest neighbors of other points in a data set.” They also showed the deleterious impact of points with very high -occurrences called hubs [6]. Another challenge in KNN method is about ties when sample size is small. Empirical practice showed that is not greater than square root of number of training data items [2]. Therefore for binary classification, when is even, there is the chance of ending with a tie vote. To eliminate this challenge, KNN only considers odd numbers [2, 8].

In the last decade, dimension reduction techniques as a remedial method for classification with KNN in high dimensional settings have been more attentive. Fern and Brodley proposed random projection, which was based on a random matrix. This random matrix projects the data along a subspace with lower dimension, so KNN classifier utilizes the reduced subspace for classification task [9]. Deegalla and Boström proposed principal component based projection when the number of PCs was lower than data dimensions. They recommended using aforementioned PCs instead of initial features for dissimilarity measure construction and finding the nearest neighbors [10]. Another popular approach is to employ a threshold (so called hard threshold) and truncate less important features. In this approach, only features greater than the threshold are contributed to KNN classifier [11]. Pal et al. proposed a new dissimilarity measure based on mean absolute difference of distances (MADD) to cope with curse of dimensionality [3]. Finally in 2013, Lu et al. stated that, in the sparse situations to enhance accuracy, a classifier should combine both linearity and locality information [5].

In this manuscript, we suggest a hybrid method called K important neighbors (KIN) that implements smoothly clipped absolute deviation (SCAD) regression and uses a function of the obtained coefficients as weights in construction of dissimilarity measure. Proposed method combines information of features employing logit link function (i.e., linearity information) and distances (i.e., locality information) in the dissimilarity measure, thereby leading to both feature selection and classification. In facing ties, KIN assign new observation to a class with lower amount of dissimilarity measure.

The rest of this paper is organized as follows: Section 2 presents a brief description about KNN, SCAD penalized regression, random forest (RF), and support vector machine (SVM). In Section 3, we present our proposed method. Section 4 compares the accuracy of KIN with KNN, RF, and SVM using simulation studies and benchmark data sets and finally, we provide discussion about the proposed classifier and conclude this manuscript in Section 5.

2. Statistical Methods

2.1. Nearest Neighbors (KNN)

The nearest neighbors classifier assigns a new observation into a class with majority votes in nearest neighbors [12, 13]. The dissimilarity measure in KNN is usually defined in terms of Minkowski distance as follows:where is the number of features, is a positive constant (usually 1 or 2), and is distance between and points. Optimum amounts of (number of neighbors) can be obtained using cross validation technique [2, 8].

2.2. Smoothly Clipped Absolute Deviation (SCAD)

Variable selection is one of the key tasks in high dimensional statistical modeling. Penalized likelihood approach by handling curse of dimensionality performs estimation and variable selection simultaneously [14]. Smoothly clipped absolute deviation (SCAD) logistic regression proposed for feature selection in high dimension and low sample size settings by Fan and Li is as follows:where is vector of coefficients, is maximum likelihood estimator of regression model, is penalty function, and is a positive constant called regularization (tuning) parameter [15, 16]. The amount of penalty depends on λ which is estimated using 5- or 10-fold cross validation technique. SCAD has good properties of both best subset and ridge regression which yield continuous and unbiased solutions. Moreover, it can estimate nuisance features as zero and signal (informative) features as nonzero with probability very close to one. This advantage of SCAD regression called “oracle” property and means that SCAD is able to estimate coefficients of all the features truly with probability which tends to one [15]. In short, SCAD selects the correct model as well as we hope, even in very sparse and low sample size situations.

2.3. Random Forest (RF)

Random forest (RF) is a method for regression or classification that is based on an ensemble of unpruned trees. In RF, each tree is built on a bootstrap sample (almost two-thirds of the observation) and grows via a random sample of features at each split. For classification tasks, this random sample is the square root of the total features. This is repeated hundreds of times for building a forest. Optimum number of trees in RF can be estimated by out of bag error and the class with majority votes is considered as the class of new observation [8, 17]. In the current study, randomForest package was used and default number of trees set at 500.

2.4. Support Vector Machine (SVM)

The aim of support vector machine (SVM) is to find a line which maximizes the margin between two classes. To attain this goal, SVM incorporates kernel trick that allows the expansion of the feature space. Also, support vector refers to any observation which for its class lies on the wrong side of the margin. Expansion of the feature space depends on the number of support vectors estimated by cross validation [8, 18]. In the current study, we used linear kernel and cost function ranging between 0.001 and 5 in e1071 package.

3. Important Neighbors (KIN) Algorithm for Binary Classification

Suppose that is a training data set and denotes class membership and vector of predictor features for th observation represented as .

After random division of data into training and testing set, SCAD logistic regression was fitted on training data set which leads to estimating coefficients of nuisance features to be exactly zero. In the next step, the contribution (importance) of each feature is calculated using the following formula: where is coefficient of th feature in SCAD logistic regression. By imposing the obtained vector of contributions into Euclidian distance, we introduce our proposed dissimilarity measure as follows:where is distance between and points.

In the next stage, we obtain optimum number of neighbors () using the proposed dissimilarity measure and considering both even and odd values. A new observation was assigned to class one () if and assigned to class two ( if where is number of observations in the th class among nearest neighbors. When a tie occurs () assignment rule is as follows:it means assigning new observation into class with lower dissimilarity index.

To avoid a significant decrease in sample size of each fold, 5-fold cross validation was implemented for choosing optimum number of neighbors () because sample size in training data set may be as small as 30. In 5-fold cross validation technique, training data set (40% of total sample size in the current study) may randomly be divided into 5 equal parts. Each time one part is considered as validation while another part was used for training the model. This is repeated 5 times, so all the parts are used just once as validation set and mean error of the 5 repeat was calculated as cross validation error. Finally, after obtaining the optimum value of neighbors and using a matrix of dissimilarity measure, testing set (60% of total sample size in the current study) was assigned into the groups. In order to calculate misclassification rate (MC), the following formula was used:where , and represent ratio of observation, number of misclassifications, and sample size of the desired class, respectively. The algorithm used is described in a flowchart and displayed in Figure 1.

4. Numerical Comparisons

4.1. Simulation Framework

In the following scenarios, the misclassification rate of the proposed method called KIN was numerically compared with the traditional KNN, random forest (RF), and support vector machine (SVM) methods. The reason for the choice of RF and SVM is that they are the best among all of the current classifiers. All the simulations are performed in R 3.1.3 software and 5-fold cross validation was used to estimate optimum number of trees and support vectors in RF and SVM, respectively, or optimum number of neighbors in KNN and KIN methods.

We simulated 250 data sets for each scenario, comprising 100 or 200 observations from the model , where denotes class membership, , and is a vector of features and each feature has standard normal distribution. Let , where is a vector of 1 for their odd components and 2 for their even components and is vector of zero components. Degree of sparsity was determined by which was considered as 90, 95, or 98% and number of features was set to 100, 300, or 500. Moreover to assess effect of correlation between features on the accuracy of the proposed classifier, a kind of autoregressive correlation was used. In this correlation pattern, the closer two variables are together, the more correlation is between them as follows: the correlation between and (two arbitrary features) was considered as where was 0.8 or 0.4. In all the scenarios, we split simulated data set randomly into training and testing set with ratio of 40% and 60%, respectively. The reason for choosing smaller sample size for training set was assessing the accuracy of the proposed model compared to the best classifiers in low sample size settings.

4.2. Simulation Results

Table 1 compares the average misclassification rate of KNN and KIN in all the scenarios. The results indicate that using proposed KIN improves classification accuracy of KNN on average of 4.9, 5.9, and 8.8% when degree of sparsity is 90, 95, and 98%, respectively. In Table 1, we also demonstrate oracle property of KIN in the number of false positive variables (#FP) columns. The mean number of false positive variables was 1.9, 2.7, and 3.0 when numbers of variables were 100, 300, and 500, respectively. In fact, the proposed method successfully eliminates 98.8, 98.7, and 98.8% of noisy features in 90, 95, and 98% degree of sparsity scenarios, respectively. Our results indicated that KIN also has good performance in terms of assigning true weight to signal (nonzero) features. We called this true contribution (TC). Table 1 showed that the average true contributions were 80.2, 77.1, and 69.8% for 100, 300, and 500 predictors, respectively.


Number of featuresDegree of sparsity (%)Sample sizeRatio of the first class
KNNKINKNNKIN
MCMCTC (%)#FPMCMCTC (%)#FP

10098%0.543.230.766%2.740.027.569%2.5
0.821.419.171%1.421.617.965%1.5
0.540.227.682%2.537.225.485%2.1
0.820.117.879%1.320.216.683%1.1
95%0.539.628.076%2.435.021.084%2.1
0.821.119.164%1.721.016.383%1.7
0.536.823.887%3.030.817.988%2.6
0.820.016.587%1.919.214.292%1.3
90%0.539.133.968%2.130.820.589%1.5
0.821.622.059%1.620.816.589%1.5
0.536.928.087%2.728.118.592%2.1
0.820.018.685%1.918.414.394%1.6

30098%0.543.535.468%2.840.120.482%2.6
0.822.121.760%2.222.917.080%2.4
0.541.225.377%5.336.617.487%3.2
0.820.818.377%3.121.014.988%2.7
95%0.543.641.957%2.137.623.885%2.1
0.822.323.354%2.423.519.583%2.1
0.541.833.079%3.633.819.490%2.8
0.821.121.970%3.021.216.790%2.6
90%0.543.641.853%2.336.623.785%2.1
0.832.129.764%2.130.322.985%1.9
0.541.533.176%3.734.119.991%2.7
0.828.328.077%3.526.216.992%2.5

50098%0.544.741.358%2.539.921.682%2.5
0.822.522.551%2.323.117.178%2.5
0.543.529.075%4.937.917.287%4.0
0.820.518.969%3.321.314.888%3.2
95%0.545.744.844%6.238.829.374%2.3
0.823.225.340%2.326.622.574%2.2
0.544.540.569%3.335.822.388%3.3
0.821.124.666%3.121.918.188%3.0
90%0.545.745.146%2.539.326.083%2.0
0.828.232.250%2.329.725.477%2.1
0.546.545.258%2.836.929.586%3.3
0.826.130.359%3.221.823.286%2.8

Misclassification (MC) rate of KIN was compared to KNN, RF, and SVM for the above scenarios in Figure 2. This figure indicates that the superiority of proposed KIN rather than KNN is obvious in all the situations. Also in very sparse situations where degree of sparsity is 98%, KIN outperforms RF and SVM most of the times and has comparable accuracy in the other sparse situations. We also introduced the probability of achieving the maximum accuracy (PAMA) for each of the classifiers, as the number of scenarios for which the classifier achieves the highest accuracy (among 4 classifiers) is divided by the total number of scenarios. Table 2 shows the values of PAMA for each classifier in different degrees of sparsity. We can infer that the probability of achieving the maximum accuracy in KIN increases when degree of sparsity increases to 100% as the highest amount of PAMA for KIN is 66.7%, where only 2% of features are signal. Note that PAMA values are very far from 100% indicating that no classifier is the best for all settings.


Degree of sparsityMethodPAMAP95

90%Random forest (RF)45.8%66.7%
Support vector machine (SVM)50.0%87.5%
nearest neighbors (KNN)0.0%20.8%
important neighbors (KIN)8.3%41.7%

95%Random forest (RF)50%79.2%
Support vector machine (SVM)29.2%79.2%
nearest neighbors (KNN)0.0%29.2%
important neighbors (KIN)20.8%75%

98%Random forest (RF)20.8%75%
Support vector machine (SVM)12.5%41.7%
nearest neighbors (KNN)0.0%33.3%
important neighbors (KIN)66.7%100%

TotalRandom forest (RF)38.9%73.6%
Support vector machine (SVM)30.6%69.4%
nearest neighbors (KNN)0.0%27.8%
important neighbors (KIN)32%72.2%

Another useful measure which can be taken into consideration with very near accuracy from the best classifier is the probability of achieving more than 95% of the maximum accuracy (P95). The P95 for each classifier is estimated as the number of scenarios in which it achieves 95% or more of the maximum accuracy (among 4 classifiers), divided by the total number of scenarios. Once again, we can see that the proposed KIN is the best classifier in terms of P95 for very sparse situations and totally, KIN is dominant over the SVM and KNN (Table 2).

4.3. Benchmark Data Sets

In order to further assess the KIN classifier, we analyzed five data sets. The first two data sets were taken from the UCI machine learning repository (http://archive.ics.uci.edu/ml/datasets.html). Prostate cancer data set was from SIS package (only the first 600 features) and colon cancer data set from HiDimDA package in R software [19, 20]. We also used liver transplant data set as described in [21] to examine the accuracy of KIN in very unbalance class membership situations. In liver transplant data set, only 11% of patients were dead () and the rest were alive (). In these data sets, instead of using specific training and testing set, we used random partitioning of the whole data and for each of them, we form 200 training and testing sets and average accuracy rate was computed over these 200 partitions.

The results of classification on benchmark data sets are summarized in Table 3. For data sets with small or moderate number of features such as liver transplant, connectionist bench, and ozone, there was ignorable difference between accuracy of KIN and that of KNN. The accuracy of KIN was higher than KNN in very high dimensional data sets (prostate and colon cancer). Although simulation results showed that accuracy of KIN is affected by data sets’ degree of sparsity, in comparison to SVM and RF as the best classifiers, proposed KIN has comparable accuracy in high dimension and low sample size (in training data set) settings.


Data setTrain Test RFSVMKNNKIN

Connectionist bench6010410478.774.471.574.0
Ozone7210241080.679.572.475.4
Prostate cancer600703469.175.266.072.3
Colon cancer2000323265.777.962.574.3
Liver transplant3910257888.785.788.689.1

5. Discussion

Regarding the idea of Lu et al. that demonstrates how to enhance accuracy, a classifier should combine both linearity and locality information [5], we proposed a novel dissimilarity measure for nearest neighbors classifier. To avoid deleterious effects of curse of dimensionality on KNN method, all the proposed solutions up to now can be summarized into two main categories: dimension reduction which is based on feature selection or feature extraction [2225] or introducing a new dissimilarity measure [3]. From this perspective, assigning KIN in both of the above categories can be justified. By handling curse of dimensionality, KIN is capable classifier to overcome distance concentration and does not allow creating hubs. Moreover, managing ties challenge in small sample size leads to stable results.

Proposed feature extraction techniques for dimension reduction in KNN such as principal component analysis [10], linear discriminant analysis [26], locality preserving projections [27], random projection [9, 10], and nearest feature subspace [24] have two main defects: feature extraction does not explain 100% of features information, thereby leading to waste of some valuable information and since extracted features are combination of both signals and noises, the importance of each feature in classification may not be clearly achievable.

Our idea in present study is very close to Chan and Hall approach in 2009. They suggested truncated nearest neighbor which implements feature selection via a threshold before classification task [11]. Fan and Li called this threshold hard threshold and proposed a threshold in SCAD regression as SCAD threshold [15]. Hence, against truncated nearest neighbor, KIN use SCAD threshold that simultaneously satisfies unbiasedness and sparsity [15]. Another important difference between two aforementioned methods is that selected features in KIN do not have the same contribution in construction of dissimilarity measure which comprise an obvious advantage. Although MADD index as a novel dissimilarity measure for KNN classifier has good accuracy in high dimensional problems, compared to our hybrid dissimilarity measure, it does not take into consideration importance of features and is only based on distances [3]. Considering this shortcoming, we can infer that, as the degree of sparsity tends to one, MADD index becomes weaker but KIN becomes stronger in terms of accuracy.

Consequently, imposing features contribution as a function of SCAD coefficients on Euclidean distance (novelty of the present study) leads to four good properties:(1)It uses information of both variables and locations instead of usual dissimilarity measure in KNN which ignores information of features.(2)It performs dimension reduction because only those variables that contribute in construction of dissimilarity measure have nonzero coefficients.(3)It increases accuracy by eliminating noisy features from classification procedure and considering relative importance of the signal features.(4)It does not choose necessarily the nearest neighbors. The nature of this hybrid measure leads to choosing important neighbors (KIN); that helps to find more complex patterns in the presence of a huge number of noisy features.

5.1. Conclusion

In summary, KIN has a good performance in terms of both accuracy and dimension reduction. The proposed KIN also in very sparse settings outperforms support vector machine (SVM) and random forest (RF) as the best classifiers. The KIN approach was found to be capable of eliminating nearly all of the noninformative features because of utilizing oracle property of SCAD penalized regression in the construction of dissimilarity measure. What distinguishes KIN from KNN, SVM, and RF classifiers is that not only does the proposed KIN perform classification task, but it can also perform feature selection. In fact, KIN implements classification only with very small subgroup of features which can affect class assignment.

Disclosure

This article was adapted from the Ph.D. Dissertation of Hadi Raeisi Shahraki.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Acknowledgments

This article was supported by Grant no. 95-11613 from Shiraz University of Medical Sciences. The authors would like to thank the vice chancellor for research of Shiraz University of Medical Sciences for financial supports. They are also thankful to the Nemazee Hospital Organ Transplant Center, Shiraz, Iran.

References

  1. M. Fernández-Delgado, E. Cernadas, S. Barro, and D. Amorim, “Do we need hundreds of classifiers to solve real world classification problems?” Journal of Machine Learning Research, vol. 15, no. 1, pp. 3133–3181, 2014. View at: Google Scholar | MathSciNet
  2. B. Lantz, Machine learning with R, Packt Publishing Ltd, 2015.
  3. A. K. Pal, P. K. Mondal, and A. K. Ghosh, “High dimensional nearest neighbor classification based on mean absolute differences of inter-point distances,” Pattern Recognition Letters, vol. 74, pp. 1–8, 2016. View at: Publisher Site | Google Scholar
  4. C. C. Aggarwal, A. Hinneburg, and D. A. Keim, “On the surprising behavior of distance metrics in high dimensional space,” in Database Theory — ICDT 2001, vol. 1973 of Lecture Notes in Computer Science, pp. 420–434, Springer, Berlin, Germany, 2001. View at: Publisher Site | Google Scholar
  5. C.-Y. Lu, H. Min, J. Gui, L. Zhu, and Y.-K. Lei, “Face recognition via weighted sparse representation,” Journal of Visual Communication and Image Representation, vol. 24, no. 2, pp. 111–116, 2013. View at: Publisher Site | Google Scholar
  6. M. Radovanović, A. Nanopoulos, and M. Ivanović, “Hubs in space: popular nearest neighbors in high-dimensional data,” Journal of Machine Learning Research (JMLR), vol. 11, pp. 2487–2531, 2010. View at: Google Scholar | MathSciNet
  7. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, “When is ‘nearest neighbor’ meaningful?” in Database Theory—ICDT'99, vol. 1540 of Lecture Notes in Computer Science, pp. 217–235, Springer, Berlin, Germany, 1999. View at: Publisher Site | Google Scholar
  8. C. Lesmeister, Mastering Machine Learning with R, Packt Publishing, 2015.
  9. X. Z. Fern and C. E. Brodley, “Random projection for high dimensional data clustering: a cluster ensemble approach,” in Proceedings of the 20th International Conference on Machine Learning (ICML '03), vol. 3, pp. 186–193, August 2003. View at: Google Scholar
  10. S. Deegalla and H. Boström, “Reducing high-dimensional data by principal component analysis vs. random projection for nearest neighbor classification,” in Proceedings of the 5th International Conference on Machine Learning and Applications, (ICMLA'06), pp. 245–250, USA, December 2006. View at: Publisher Site | Google Scholar
  11. Y.-b. Chan and P. Hall, “Robust nearest-neighbor methods for classifying high-dimensional data,” The Annals of Statistics, vol. 37, no. 6A, pp. 3186–3203, 2009. View at: Publisher Site | Google Scholar | MathSciNet
  12. I. Brown and C. Mues, “An experimental comparison of classification algorithms for imbalanced credit scoring data sets,” Expert Systems with Applications, vol. 39, no. 3, pp. 3446–3453, 2012. View at: Publisher Site | Google Scholar
  13. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, Springer, New York, NY, USA, 2001. View at: Publisher Site | MathSciNet
  14. R. Tibshirani, “Regression shrinkage and selection via the lasso: A retrospective,” Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol. 73, no. 3, pp. 273–282, 2011. View at: Publisher Site | Google Scholar
  15. J. Fan and R. Li, “Variable selection via nonconcave penalized likelihood and its oracle properties,” Journal of the American Statistical Association, vol. 96, no. 456, pp. 1348–1360, 2001. View at: Publisher Site | Google Scholar | MathSciNet
  16. H. R. Shahraki, S. Pourahmad, S. Paydar, and M. Azad, “Improving the accuracy of early diagnosis of thyroid nodule type based on the SCAD method,” Asian Pacific Journal of Cancer Prevention, vol. 17, no. 4, pp. 1861–1864, 2016. View at: Publisher Site | Google Scholar
  17. L. Breiman, “Random forests,” Machine Learning, vol. 45, no. 1, pp. 5–32, 2001. View at: Publisher Site | Google Scholar
  18. C. Cortes and V. Vapnik, “Support-vector networks,” Machine Learning, vol. 20, no. 3, pp. 273–297, 1995. View at: Publisher Site | Google Scholar
  19. P.D. Silva, Ed., HiDimDA: An R package for Supervised Classification of High-Dimensional Data, 1ères Rencontres R.
  20. J. Fan, Y. Feng, R. Samworth, and Y. Wu, SIS: Sure Independence Screening, R package version 0.6, 2010, http://cran.r-project.org/web/packages/SIS/index.html.1235.
  21. H. R. Shahraki, S. Pourahmad, and S. M. T. Ayatollahi, “Identifying the prognosis factors in death after liver transplantation via adaptive LASSO in Iran,” Journal of Environmental and Public Health, vol. 2016, Article ID 7620157, 2016. View at: Publisher Site | Google Scholar
  22. P. N. Belhumeur, J. P. Hespanha, and D. J. Kriegman, “Eigenfaces vs. fisherfaces: recognition using class specific linear projection,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 7, pp. 711–720, 1997. View at: Publisher Site | Google Scholar
  23. X. He, S. Yan, Y. Hu, P. Niyogi, and H.-J. Zhang, “Face recognition using Laplacian faces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 328–340, 2005. View at: Publisher Site | Google Scholar
  24. S. Shan, W. Gao, and D. Zhao, “Face identification from a single example image based on face-specific subspace (FSS),” in Proceedings of the 2002 IEEE International Conference on Acoustic, Seech and Signal Processing, USA, May 2002. View at: Google Scholar
  25. M. A. Turk and A. P. Pentland, “Face recognition using eigenfaces,” in Proceedings of the Computer Society Conference on Computer Vision and Pattern Recognition, pp. 586–591, IEEE, Maui, HI, USA, 1991. View at: Publisher Site | Google Scholar
  26. T. Hastie and R. Tibshirani, “Discriminant adaptive nearest neighbor classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 6, pp. 607–616, 1996. View at: Publisher Site | Google Scholar
  27. W. Li, S. Prasad, J. E. Fowler, and L. M. Bruce, “Locality-preserving dimensionality reduction and classification for hyperspectral image analysis,” IEEE Transactions on Geoscience and Remote Sensing, vol. 50, no. 4, pp. 1185–1198, 2012. View at: Publisher Site | Google Scholar

Copyright © 2017 Hadi Raeisi Shahraki et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views1266
Downloads304
Citations

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.