DOCSLIB.ORG

Joint Feature Selection and Subspace Learning

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Joint Feature Selection and Subspace Learning Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Joint Feature Selection and Subspace Learning Quanquan Gu, Zhenhui Li and Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign {qgu3,zli28,hanj}@illinois.edu Abstract nal features, thus it is often difficult to interpret the results. Sparse subspace learning methods attempted to solve this Dimensionality reduction is a very important topic problem. For example, [Zou et al., 2004] proposed a sparse in machine learning. It can be generally classi- PCA algorithm based on 2-norm and 1-norm regularization. fied into two categories: feature selection and sub- [Moghaddam et al., 2006] proposed both exact and greedy space learning. In the past decades, many meth- algorithms for binary class sparse LDA as well as its spec- ods have been proposed for dimensionality reduc- tral bound. [Cai et al., 2007] proposed a unified sparse sub- tion. However, most of these works study fea- space learning (SSL) framework based on 1-norm regular- ture selection and subspace learning independently. ized Spectral Regression. In this paper, we present a framework for joint However, the selected features by sparse subspace methods feature selection and subspace learning. We re- are independent and generally different for each dimension of formulate the subspace learning problem and use the subspace. See Figure 1 (a) for an illustrative toy example L2,1-norm on the projection matrix to achieve row- of the projection matrix learned by SSL. Each row of the pro- sparsity, which leads to selecting relevant features jection matrix corresponds to a feature, while each column and learning transformation simultaneously. We corresponds to a dimension of the subspace. We can see that discuss two situations of the proposed framework, for the first dimension of the subspace, the 3rd and 6th fea- and present their optimization algorithms. Experi- tures are not selected, while for the second dimension of the ments on benchmark face recognition data sets il- subspace, the selected features are all except the 1st and 4th lustrate that the proposed framework outperforms one. Hence it is still unclear which features are really use- the state of the art methods overwhelmingly. ful as a whole. Our goal is to learn a projection matrix like Figure 1 (b), which has row-sparsity (elements in a row are 1 Introduction all zero). Hence it is able to discard the irrelevant features High-dimensional data in the input space is usually not good (e.g., the 1st, 5th and 7th features) and transform the relevant for classification due to the curse of dimensionality.Acom- ones simultaneously. One intuitive way is performing feature [ ] mon way to resolve this problem is dimensionality reduction, selection Guyon and Elisseeff, 2003 before subspace learn- which has attracted much attention in machine learning com- ing. However, since these two sub-processes are conducted munity in the past decades. Generally speaking, dimensional- individually, the whole process is likely suboptimal. ity reduction techniques can be classified into two categories: 1IVJ1QJQ`%G]:HV (1) feature selection [Guyon and Elisseeff, 2003]: to select a subset of most representative or discriminative features from the input feature set, and (2) subspace learning [Belhumeur et 8 8 8 8 8 8 al., 1997][He and Niyogi, 2003][He et al., 2005][Yan et al., 2007] (a.k.a feature transformation): to transform the original R8 R8 8 8 R8 R8 input features to a lower dimensional subspace. 8 R8 8 8 R8 8 The most popular subspace learning methods include Prin- R8 8 8 8 8 R8 cipal Component Analysis (PCA) [Belhumeur et al., 1997], V: %`V 8 8 8 8 8 8 Linear Discriminant Analysis (LDA) [Belhumeur et al., 8 R8 R8 R8 R8 8 1997], Locality Preserving Projection (LPP) [He and Niyogi, R8 8 8 8 8 8 2003] and Neighborhood Preserving Embedding (NPE) [He et al., 2005]. Despite different motivations of these meth- ^:_ ^G_ ods, they can all be interpreted in a unified Graph Embedding framework [Yan et al., 2007]. Figure 1: An illustrative toy example of the projection matri- One major disadvantage of the above methods is that the ces learned by (a) Sparse subspace learning; and (b) feature learned projection is a linear combination of all the origi- selection and subspace learning 1294 Based on the above motivation, in this paper, we aim to With different choices of W, the linear graph embedding jointly perform feature selection and subspace learning. To framework leads to many popular linear dimensionality re- achieve this goal, we reformulate subspace learning as solv- duction methods, e.g. PCA [Belhumeur et al., 1997],LDA ing a linear system equation, during which we use L2,1- [Belhumeur et al., 1997],LPP[He and Niyogi, 2003] and norm on the projection matrix, encouraging row-sparsity. It NPE [He et al., 2005]. We briefly give two examples below. is worth noting that L2,1-norm has already been successfully LDA: Suppose we have c classes and the k-th class have applied in Group Lasso [Yuan et al., 2006], multi-task fea- nk samples, n1 + ···+ nc = n.Define ture learning [Argyriou et al., 2008], joint covariate selection 1 , if xi and xj belong to the k-th class [ ] = nk and joint subspace selection Obozinski et al., 2010 .There- Wij 0 . (2) sulted optimization problem includes two situations, for each , otherwise of which we present a very simple algorithm, that is theo- LPP [He and Niyogi, 2003]: Define retically guaranteed to converge. Experiments on benchmark (x x ) x ∈N (x ) x ∈N (x ) = d i, j , if j k i or i k j face recognition data sets demonstrate the effectiveness of the Wij 0 , proposed framework. , otherwise The remainder of this paper is organized as follows. In (3) where Nk(xi) denotes the set of k nearest neighbors of xi, Section 2, we briefly introduce the graph embedding view of (x x ) x x subspace learning. In Section 3, we present a framework for d i, j measures the similarity between i and j ,which x −x 2 − i j joint feature selection and subspace learning. In Section 4, we can be chosen as Gaussian kernel e 2σ2 or cosine dis- xT x review some related works. Experiments on benchmark face tance i j . For more examples and other extensions of recognition data sets are demonstrated in Section 5. Finally, xixj we draw a conclusion and point out future work in Section 6. graph embedding, please refer to [Yan et al., 2007]. 1.1 Notations 3 Joint Feature Selection and Subspace d×n Learning Given a data matrix X =[x1,...,xn] ∈ R ,weaim to learn a projection matrix A ∈ Rd×m, projecting the Since each row of the projection matrix corresponds to a fea- input data into an m-dimensional subspace. For a matrix ture in the original space, in order to do feature selection, it A ∈ Rd×m, we denote the ith row of A by ai,andthejth is desirable to have some rows of the projection matrix be all column of A by aj . The Frobenius norm of A is defined as zeros. This motivates us to use L2,1-norm on the projection d i 2 matrix, which leads to row-sparsity of the projection matrix. ||A||F = ||a || ,andtheL2,1-norm of A is defined as i 2 As a result, based on Eq. (1), we formulate joint feature se- d i ||A||2,1 = i ||a ||2. lection and subspace learning as follows, T T minA ||A||2,1 + μtr(A XLX A) 2 Graph Embedding View of Subspace s.t. AT XDXT A = I, (4) Learning where μ is a regularization parameter. Although the objective Many dimensionality reduction methods have been proposed function is convex, the constraint is not. Hence it is difficult to to find low-dimensional representation of xi. Despite dif- optimize. In the following, we will reformulate the problem ferent motivations of these methods, they can be nicely in- to make it easy to be solved. terpreted in a general graph embedding framework [Yan et Theorem 3.1. Let Y ∈ Rn×m be a matrix of which each al., 2007]. In graph embedding, we construct a data graph G column is an eigenvector of eigen-problem Wy = λDy. n×n whose vertices correspond to {x1,...,xn}.LetW ∈ R If there exists a matrix A ∈ Rd×m such that XT A = Y, be a symmetric adjacency matrix with Wij characterizes the then each column of A is an eigenvector of eigen-problem favorite relationship among the data. The purpose of graph XWXT a = λXDXT a with the same eigenvalue λ. embedding is to find the optimal low-dimensional vector rep- resentation for the vertices of graph G that best preserves the Proof. This is the corollary of Theorem 1 in [Cai et al., 2007]. relationship between the data points. In this paper, we fo- cus on linear dimensionality reduction. That is, XT A.The A Theorem 3.1 shows that instead of solving the eigen- optimal is given by the following optimization problem, problem XWXT A = ΛXDXT A, A can be obtained by T T the following two steps: minA tr(A XLX A) WY = ΛDY Y AT XDXT A = I 1. Solve the eigen-problem to get ; s.t. , (1) T 2. Find A which satisfies X A = Y. = L = D − T where Dii j Wij is a diagonal matrix, and Note that only the second step involves A. X A = Y is a W is called graph Laplacian [Chung, 1997], I is the identity linear system problem, which may behave in any one of three matrix with proper size.
Load more

Recommended publications
  • A New Wrapper Feature Selection Approach Using Neural Network
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Community Repository of Fukui Neurocomputing 73 (2010) 3273–3283 Contents lists available at ScienceDirect Neurocomputing journal homepage: www.elsevier.com/locate/neucom A new wrapper feature selection approach using neural network Md. Monirul Kabir a, Md. Monirul Islam b, Kazuyuki Murase c,n a Department of System Design Engineering, University of Fukui, Fukui 910-8507, Japan b Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka 1000, Bangladesh c Department of Human and Artificial Intelligence Systems, Graduate School of Engineering, and Research and Education Program for Life Science, University of Fukui, Fukui 910-8507, Japan article info abstract Article history: This paper presents a new feature selection (FS) algorithm based on the wrapper approach using neural Received 5 December 2008 networks (NNs). The vital aspect of this algorithm is the automatic determination of NN architectures Received in revised form during the FS process. Our algorithm uses a constructive approach involving correlation information in 9 November 2009 selecting features and determining NN architectures. We call this algorithm as constructive approach Accepted 2 April 2010 for FS (CAFS). The aim of using correlation information in CAFS is to encourage the search strategy for Communicated by M.T. Manry Available online 21 May 2010 selecting less correlated (distinct) features if they enhance accuracy of NNs. Such an encouragement will reduce redundancy of information resulting in compact NN architectures. We evaluate the Keywords: performance of CAFS on eight benchmark classification problems. The experimental results show the Feature selection essence of CAFS in selecting features with compact NN architectures.
    [Show full text]
  • ``Preconditioning'' for Feature Selection and Regression in High-Dimensional Problems
    The Annals of Statistics 2008, Vol. 36, No. 4, 1595–1618 DOI: 10.1214/009053607000000578 © Institute of Mathematical Statistics, 2008 “PRECONDITIONING” FOR FEATURE SELECTION AND REGRESSION IN HIGH-DIMENSIONAL PROBLEMS1 BY DEBASHIS PAUL,ERIC BAIR,TREVOR HASTIE1 AND ROBERT TIBSHIRANI2 University of California, Davis, Stanford University, Stanford University and Stanford University We consider regression problems where the number of predictors greatly exceeds the number of observations. We propose a method for variable selec- tion that first estimates the regression function, yielding a “preconditioned” response variable. The primary method used for this initial regression is su- pervised principal components. Then we apply a standard procedure such as forward stepwise selection or the LASSO to the preconditioned response variable. In a number of simulated and real data examples, this two-step pro- cedure outperforms forward stepwise selection or the usual LASSO (applied directly to the raw outcome). We also show that under a certain Gaussian la- tent variable model, application of the LASSO to the preconditioned response variable is consistent as the number of predictors and observations increases. Moreover, when the observational noise is rather large, the suggested proce- dure can give a more accurate estimate than LASSO. We illustrate our method on some real problems, including survival analysis with microarray data. 1. Introduction. In this paper, we consider the problem of fitting linear (and other related) models to data for which the number of features p greatly exceeds the number of samples n. This problem occurs frequently in genomics, for exam- ple, in microarray studies in which p genes are measured on n biological samples.
    [Show full text]
  • Feature Selection Via Dependence Maximization
    JournalofMachineLearningResearch13(2012)1393-1434 Submitted 5/07; Revised 6/11; Published 5/12 Feature Selection via Dependence Maximization Le Song [email protected] Computational Science and Engineering Georgia Institute of Technology 266 Ferst Drive Atlanta, GA 30332, USA Alex Smola [email protected] Yahoo! Research 4301 Great America Pky Santa Clara, CA 95053, USA Arthur Gretton∗ [email protected] Gatsby Computational Neuroscience Unit 17 Queen Square London WC1N 3AR, UK Justin Bedo† [email protected] Statistical Machine Learning Program National ICT Australia Canberra, ACT 0200, Australia Karsten Borgwardt [email protected] Machine Learning and Computational Biology Research Group Max Planck Institutes Spemannstr. 38 72076 Tubingen,¨ Germany Editor: Aapo Hyvarinen¨ Abstract We introduce a framework for feature selection based on dependence maximization between the selected features and the labels of an estimation problem, using the Hilbert-Schmidt Independence Criterion. The key idea is that good features should be highly dependent on the labels. Our ap- proach leads to a greedy procedure for feature selection. We show that a number of existing feature selectors are special cases of this framework. Experiments on both artificial and real-world data show that our feature selector works well in practice. Keywords: kernel methods, feature selection, independence measure, Hilbert-Schmidt indepen- dence criterion, Hilbert space embedding of distribution 1. Introduction In data analysis we are typically given a set of observations X = x1,...,xm X which can be { } used for a number of tasks, such as novelty detection, low-dimensional representation,⊆ or a range of . Also at Intelligent Systems Group, Max Planck Institutes, Spemannstr.
    [Show full text]
  • Feature Selection in Convolutional Neural Network with MNIST Handwritten Digits
    Feature Selection in Convolutional Neural Network with MNIST Handwritten Digits Zhuochen Wu College of Engineering and Computer Science, Australian National University [email protected] Abstract. Feature selection is an important technique to improve neural network performances due to the redundant attributes and the massive amount in original data sets. In this paper, a CNN with two convolutional layers followed by a dropout, then two fully connected layers, is equipped with a feature selection algorithm. Accuracy rate of the networks with different attribute input weight as zero are calculated and ranked so that the machine can decide which attribute is the least important for each run of the algorithm. The algorithm repeats itself to remove multiple attributes. When the network will not achieve a satisfying accuracy rate as defined in the algorithm, the process terminates and no more attributes to be removed. A CNN is chosen the image recognition task and one dropout is applied to reduce the overfitting of training data. This implementation of deep learning method proves its ability to rise accuracy and neural network performance with up to 80% less attributes fed in. This paper also compares the technique with other the result of LeNet-5 to see the differences and common facts. Keywords: CNN, Feature selection, Classification, Real world problem, Deep learning 1. Introduction Feature selection has been a focus in many study domains like econometrics, statistics and pattern recognition. It is a process to select a subset of attributes in given data and improve the algorithm performance in efficient and accuracy, etc. It is commonly understood that the more features being fed into a neural network, the more information machine could learn from in order to achieve a better outcome.
    [Show full text]
  • Classification with Costly Features Using Deep Reinforcement Learning
    Classification with Costly Features using Deep Reinforcement Learning Jarom´ır Janisch and Toma´sˇ Pevny´ and Viliam Lisy´ Artificial Intelligence Center, Department of Computer Science Faculty of Electrical Engineering, Czech Technical University in Prague jaromir.janisch, tomas.pevny, viliam.lisy @fel.cvut.cz f g Abstract y1 We study a classification problem where each feature can be y2 acquired for a cost and the goal is to optimize a trade-off be- af3 af5 af1 ac tween the expected classification error and the feature cost. We y3 revisit a former approach that has framed the problem as a se- ··· quential decision-making problem and solved it by Q-learning . with a linear approximation, where individual actions are ei- . ther requests for feature values or terminate the episode by providing a classification decision. On a set of eight problems, we demonstrate that by replacing the linear approximation Figure 1: Illustrative sequential process of classification. The with neural networks the approach becomes comparable to the agent sequentially asks for different features (actions af ) and state-of-the-art algorithms developed specifically for this prob- finally performs a classification (ac). The particular decisions lem. The approach is flexible, as it can be improved with any are influenced by the observed values. new reinforcement learning enhancement, it allows inclusion of pre-trained high-performance classifier, and unlike prior art, its performance is robust across all evaluated datasets. a different subset of features can be selected for different samples. The goal is to minimize the expected classification Introduction error, while also minimizing the expected incurred cost.
    [Show full text]
  • Feature Selection for Regression Problems
    Feature Selection for Regression Problems M. Karagiannopoulos, D. Anyfantis, S. B. Kotsiantis, P. E. Pintelas unreliable data, then knowledge discovery Abstract-- Feature subset selection is the during the training phase is more difficult. In process of identifying and removing from a real-world data, the representation of data training data set as much irrelevant and often uses too many features, but only a few redundant features as possible. This reduces the of them may be related to the target concept. dimensionality of the data and may enable There may be redundancy, where certain regression algorithms to operate faster and features are correlated so that is not necessary more effectively. In some cases, correlation coefficient can be improved; in others, the result to include all of them in modelling; and is a more compact, easily interpreted interdependence, where two or more features representation of the target concept. This paper between them convey important information compares five well-known wrapper feature that is obscure if any of them is included on selection methods. Experimental results are its own. reported using four well known representative regression algorithms. Generally, features are characterized [2] as: 1. Relevant: These are features which have Index terms: supervised machine learning, an influence on the output and their role feature selection, regression models can not be assumed by the rest 2. Irrelevant: Irrelevant features are defined as those features not having any influence I. INTRODUCTION on the output, and whose values are generated at random for each example. In this paper we consider the following 3. Redundant: A redundancy exists regression setting.
    [Show full text]
  • Gaussian Universal Features, Canonical Correlations, and Common Information
    Gaussian Universal Features, Canonical Correlations, and Common Information Shao-Lun Huang Gregory W. Wornell, Lizhong Zheng DSIT Research Center, TBSI, SZ, China 518055 Dept. EECS, MIT, Cambridge, MA 02139 USA Email: [email protected] Email: {gww, lizhong}@mit.edu Abstract—We address the problem of optimal feature selection we define a rotation-invariant ensemble (RIE) that assigns a for a Gaussian vector pair in the weak dependence regime, uniform prior for the unknown attributes, and formulate a when the inference task is not known in advance. In particular, universal feature selection problem that aims to select optimal we show that multiple formulations all yield the same solution, and correspond to the singular value decomposition (SVD) of features minimizing the averaged MSE over RIE. We show the canonical correlation matrix. Our results reveal key con- that the optimal features can be obtained from the SVD nections between canonical correlation analysis (CCA), principal of a canonical dependence matrix (CDM). In addition, we component analysis (PCA), the Gaussian information bottleneck, demonstrate that in a weak dependence regime, this SVD Wyner’s common information, and the Ky Fan (nuclear) norms. also provides the optimal features and solutions for several problems, such as CCA, information bottleneck, and Wyner’s common information, for jointly Gaussian variables. This I. INTRODUCTION reveals important connections between information theory and Typical applications of machine learning involve data whose machine learning problems. dimension is high relative to the amount of training data that is available. As a consequence, it is necessary to perform di- mensionality reduction before the regression or other inference II.
    [Show full text]
  • Feature Selection for Unsupervised Learning
    Journal of Machine Learning Research 5 (2004) 845–889 Submitted 11/2000; Published 8/04 Feature Selection for Unsupervised Learning Jennifer G. Dy [email protected] Department of Electrical and Computer Engineering Northeastern University Boston, MA 02115, USA Carla E. Brodley [email protected] School of Electrical and Computer Engineering Purdue University West Lafayette, IN 47907, USA Editor: Stefan Wrobel Abstract In this paper, we identify two issues involved in developing an automated feature subset selec- tion algorithm for unlabeled data: the need for finding the number of clusters in conjunction with feature selection, and the need for normalizing the bias of feature selection criteria with respect to dimension. We explore the feature selection problem and these issues through FSSEM (Fea- ture Subset Selection using Expectation-Maximization (EM) clustering) and through two different performance criteria for evaluating candidate feature subsets: scatter separability and maximum likelihood. We present proofs on the dimensionality biases of these feature criteria, and present a cross-projection normalization scheme that can be applied to any criterion to ameliorate these bi- ases. Our experiments show the need for feature selection, the need for addressing these two issues, and the effectiveness of our proposed solutions. Keywords: clustering, feature selection, unsupervised learning, expectation-maximization 1. Introduction In this paper, we explore the issues involved in developing automated feature subset selection algo- rithms for unsupervised learning. By unsupervised learning we mean unsupervised classification, or clustering. Cluster analysis is the process of finding “natural” groupings by grouping “similar” (based on some similarity measure) objects together. For many learning domains, a human defines the features that are potentially useful.
    [Show full text]
  • Feature Selection Convolutional Neural Networks for Visual Tracking Zhiyan Cui, Na Lu*
    1 Feature Selection Convolutional Neural Networks for Visual Tracking Zhiyan Cui, Na Lu* Abstract—Most of the existing tracking methods based on such amount of data for tracking to train a deep network. CNN(convolutional neural networks) are too slow for real-time MDNet [12] is a novel solution for tracking problem with application despite the excellent tracking precision compared detection method. It is trained by learning the shared with the traditional ones. Moreover, neural networks are memory intensive which will take up lots of hardware resources. In this representations of targets from multiple video sequences, paper, a feature selection visual tracking algorithm combining where each video is regarded as a separate domain. There CNN based MDNet(Multi-Domain Network) and RoIAlign was are several branches in the last layer of the network for developed. We find that there is a lot of redundancy in feature binary classification and each of them is corresponding to maps from convolutional layers. So valid feature maps are a video sequence. The preceding layers are in charge of selected by mutual information and others are abandoned which can reduce the complexity and computation of the network and capturing common representations of targets. While tracking, do not affect the precision. The major problem of MDNet also lies the last layer is removed and a new single branch is added in the time efficiency. Considering the computational complexity to the network to compute the scores in the test sequences. of MDNet is mainly caused by the large amount of convolution Parameters in the fully-connected layers are fine-tuned online operations and fine-tuning of the network during tracking, a during tracking.
    [Show full text]
  • Feature Selection
    Feature Selection Suhang Wang, Jiliang Tang and Huan Liu Arizona State University Abstract Data dimensionality is growing exponentially, which poses chal- lenges to the vast majority of existing mining and learning algorithms, such as the curse of dimensionality, large storage requirement, and high computational cost. Feature selection has been proven to be an effec- tive and efficient way to prepare high dimensional data for data mining and machine learning. The recent emergence of novel techniques and new types of data and features not only advances existing feature se- lection research but also makes feature selection evolve more rapidly, becoming applicable to a broader range of applications. In this article, we aim to provide a basic introduction to feature selection including basic concepts, classifications of existing systems, recent development, and applications. Synonyms: Feature subset selection, Feature weighting, Attributes selec- tion Definition (or Synopsis): Feature selection, as a dimensionality reduction technique, aims to choosing a small subset of the relevant features from the original ones by removing irrelevant, redundant or noisy features. Feature selection usually leads to better learning performance, i.e., higher learning accuracy, lower computational cost, and better model interpretability. Generally speaking, irrelevant features are features that cannot discrim- inate samples from different classes(supervised) or clusters(unsupervised). Removing irrelevant features will not affect learning performance. In fact, removal of irrelevant features may help learn a better model, as irrelevant features may confuse the learning system and cause memory and computa- tion inefficiency. For example, in figure 1(a), f1 is a relevant feature because f1 can discriminate class1 and class2.
    [Show full text]
  • Concrete Autoencoders
    Differentiable Feature Selection with Concrete Autoencoders Abubakar Abid★ Muhammed Fatih Balin★ James Zou Poster: Thu Jun 13th 06:30 - 09:00 PM @ Pacific Ballroom #188 Unsupervised Feature Selection (UFS) is Widely Used in Machine Learning ● Identify the subset of most informative features in dataset ● Simplifies the process of training models ● Especially useful if the data is difficult or expensive to collect Differentiable Feature Selection and Reconstruction with Concrete Autoencoders 2 Unsupervised Feature Selection (UFS) is Used Widely in Applied ML ● Example: the L1000 Landmark Genes [Lamb et al., 2006] All Genes L1000 Genes All Genes Samples Samples Samples Recons truction Feature Selection Differentiable Feature Selection and Reconstruction with Concrete Autoencoders 3 UFS Methods Typically Rely on Regularization Unsupervised Discriminative Feature Selection (UDFS) [Yang et al., 2011] Multi-Cluster Feature Selection (MCFS) All based on [Cai et al., 2010] L1 or L21 regularization Autoencoder Feature Selection (AEFS) [Han et al., 2017] Differentiable Feature Selection and Reconstruction with Concrete Autoencoders 4 What about directly backpropagating through discrete “feature selection” nodes? Differentiable Feature Selection and Reconstruction with Concrete Autoencoders 5 What about directly backpropagating through discrete “feature selection” nodes? Replace the weights of the encoder with parameters of a Concrete Random Variable (Maddison, 2016) Differentiable Feature Selection and Reconstruction with Concrete Autoencoders 6
    [Show full text]
  • A Comparative Study on the Effect of Feature Selection on Classification Accuracy
    Available online at www.sciencedirect.com Procedia Technology 1 ( 2012 ) 323 – 327 INSODE 2011 A comparative study on the effect of feature selection on classification accuracy Esra Mahsereci Karabuluta*, Selma Ayşe Özelb, Turgay İbrikçib,c a Gaziantep University, Gaziantep Vocational High School, Şehitkamil/Gaziantep, 27310, Turkey b Çukurova University, Electrical-Electronics Engineering Department, Balcalı/Adana, 01330, Turkey c Çukurova University,Computer Engineering Department, Balcalı/Adana, 01330, Turkey Abstract Feature selection has become interest to many research areas which deal with machine learning and data mining, because it provides the classifiers to be fast, cost-effective, and more accurate. In this paper the effect of feature selection on the accuracy of NaïveBayes, Artificial Neural Network as Multilayer Perceptron, and J48 decision tree classifiers is presented. These classifiers are compared with fifteen real datasets which are pre-processed with feature selection methods. Up to 15.55% improvement in classification accuracy is observed, and Multilayer Perceptron appears to be the most sensitive classifier to feature selection. Keywords: feature selection; classification; accuracy; Naïve Bayes; multilayer perceptron 1. Introduction Feature selection is the process of removing redundant or irrelevant features from the original data set. So the execution time of the classifier that processes the data reduces, also accuracy increases because irrelevant features can include noisy data affecting the classification accuracy negatively [1]. With feature selection the understandability can be improved and cost of data handling becomes smaller [2]. Feature selection algorithms are divided into three categories; filters, wrappers and embedded selectors. Filters evaluate each feature independent from the classifier, rank the features after evaluation and take the superior ones [3].
    [Show full text]