DOCSLIB.ORG

Feature Selection Using Feature Dissimilarity Measure and Density-Based Clustering: Application to Biological Data

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Feature Selection Using Feature Dissimilarity Measure and Density-Based Clustering: Application to Biological Data Feature selection using feature dissimilarity measure and density-based clustering: Application to biological data 1 2 3, DEBARKA SENGUPTA , INDRANIL AICH and SANGHAMITRA BANDYOPADHYAY * 1Genome Institute of Singapore, Singapore 138 672, Singapore 2HTL Co. India Pvt. Ltd., New Delhi 110 092, India 3Machine Intelligence Unit, Indian Statistical Institute, Kolkata 700 108, India *Corresponding author (Email, [email protected]) Reduction of dimensionality has emerged as a routine process in modelling complex biological systems. A large number of feature selection techniques have been reported in the literature to improve model performance in terms of accuracy and speed. In the present article an unsupervised feature selection technique is proposed, using maximum information compression index as the dissimilarity measure and the well-known density-based cluster identification technique DBSCAN for identifying the largest natural group of dissimilar features. The algorithm is fast and less sensitive to the user-supplied parameters. Moreover, the method automatically determines the required number of features and identifies them. We used the proposed method for reducing dimensionality of a number of benchmark data sets of varying sizes. Its performance was also extensively compared with some other well-known feature selection methods. [Sengupta D, Aich I and Bandyopadhyay S 2015 Feature selection using feature dissimilarity measure and density-based clustering: Application to biological data. J. Biosci. 40 721–730] DOI 10.1007/s12038-015-9556-y 1. Introduction methods pick up relevant features by observing their intrinsic properties 21. These methods generally assign Bioinformaticians frequently face the challenge of reduc- some score to each of the features while evaluating them ing the number of attributes of high-dimensional biolog- in isolation. These methods scale up well due to their ical data for improving the models involved in sequence simplicity. The major disadvantage of such methods is analysis, microarray analysis, spectral analysis, literature that they ignore the relationship of features with the mining, etc. 21. Feature selection is useful for multiple existing classes. GINI index, F-score, Relief-F 13 and reasons. The main objectives of feature selection are as Markov Blanket filter 14 are some popular filter follows: (a) accelerating the model creation task; (b) methods. Unlike filter methods, wrapper methods learn avoiding model over-fitting or under-fitting; (c) identify- from the natural grouping of data. These methods pro- ing the salient features, which are decisive of the target duce a subset of features that can efficiently differentiate categories. Feature selection is widely used in classifica- between classes or clusters. Wrapper methods can be tion, clustering, regression, etc. A typical feature selec- supervised as well as unsupervised in nature. Supervised tion process consists of four basic steps for finding the wrapper approaches utilize class label information to optimal set of features: subset generation, subset evalu- evaluate feature sub sets. Such methods are often com- ation, stopping criterion and result validation 4. Feature putationally expensive as they tend to do a rigorous selection methods can be categorized as either filter or search in the respective feature space. Genetic wrapper 11. A third category called hybrid can be in- algorithm-based supervised feature selection approaches troduced to encompass the rest of the methods. Filter (Pal and Wang 1996; Tan et al. 2006; Mukhopadhyay Keywords. Clustering; dissimilarity; eigenvalue; feature selection http://www.ias.ac.in/jbiosci J. Biosci. 40(4), October 2015, 721–730, * Indian Academy of Sciences 721 Published online: 28 September 2015 722 D Sengupta, I Aich and S Bandyopadhyay et al. 2009) are popular as wrapper methods. Unsuper- feature selection technique itself. To address these issues vised wrapper methods are becoming increasingly popu- we propose a feature selection method that works by lar because of their lower time requirement compared to discovering natural groups of dissimilar features. We the supervised ones. Principal Component Analysis show that the larger eigenvalue of the covariance matrix (PCA) and MICI (maximum information compression derived from a pair of features is inversely proportional index) (Mitra et al. 2002) are popular among these. An to their dissimilarity, thereby making it an appropriate interesting hybrid filter-wrapper approach is introduced distance for obtaining group of dissimilar features. It is in Ruiz et al. (2006), crossing a univariately pre-ordered to be noted here that the present method is inspired by feature ranking with an incrementally augmenting wrap- the work in (Mitra et al. 2002), with notable differences. per method. Moreover a comparison with (Mitra et al. 2002) is also Biological data sets usually contain hundreds and provided in the Results section. thousands of features. For microarray data sets contain An extensive comparison of the proposed method many thousands genes (about 5,000–30,000). These data with several state-of-the-art techniques, viz. MICI (max- sets are frequently use molecular classification of various imum information compression index) (Mitra et al. life-threatening diseases like cancers (Golub et al. 1999). 2002), mRMR (Max-Dependency, Max-Relevance and Reducing the dimensionality of biological data sets is Min-Redundancy) (Peng et al. 2005), SFFS, SFBS essential to avoid model over-fitting. Filter methods are (Pudil et al. 1994), SBS, SFS, and Branch and Bound preferably use to reduce dimensionality of such data (Devijver and Kittler 1982), demonstrate its significance sets. Some frequently used filter methods are F-score, and effectiveness. For ease of reference the proposed χ2, Euclidean distance, i-test, Information Gain, etc. 21. feature selection technique is named as Feature Selection Filter methods work well for simple cases, where dis- using Information Compression Index, or FSICI. tinction between different classes are quite obvious and The rest of this paper is organized as follows: In apparent. However, in many complex cases these section 2 we explain how the larger eigenvalue corre- methods fail to give much insight into the molecular sponding to the covariance matrix derived from a pair of differentiation. PCA is a reasonably fast, unsupervised features can be used to find cluster of dissimilar fea- wrapper method, which is commonly used in such cases. tures. In this section we also describe various compo- However, PCA fails discriminate classes when classes nents as well as the computational complexity of the overlap along the direction of maximum variance of algorithm. In section 3 we compare the performance of the instances. In practice, feature extraction based on FSICI with multiple established feature selection tech- PCA often suffer from the problem of under-fitting. niques. In this section we also provide statistical evi- Unsupervised methods are indispensable when labeled dence for superior performance of FSICI. A brief instances are not available. For example, single cell analysis is also done to evaluate sensitivity of the ap- RNA-sequence data analysis, which reveals tissue het- proach to the required parameters. We conclude the erogeneity require single cells to be mapped to known paper in section 4. cell types (Jaitin et al. 2014). Only filter or unsupervised wrapper techniques can be used to reduce dimensionality in such studies. 2. Method A disadvantage of the MICI (maximum information compression index) based approach lies with the use of The proposed feature selection technique involves three k-NN-based clustering algorithm for finding clusters of steps: First, all dissimilarities between all possible pairs of features based on their similarity (Mitra et al. 2002). It features are measured using the principle of linear projec- is a common knowledge that any method based on k-NN tions (described later in this section). Natural groups of principle is somewhat sensitive to the choice of k. dissimilar features are then identified using DBSCAN, the Moreover, their approach of selecting a representative density based clustering method (Ester et al. 1996). Fi- features from each of the clusters of similar features nally, the cluster containing the maximum number of tends to discard important (dissimilar) features when features is selected. The reasons for using DBSCAN for the clusters are large in size. In contrast, if clusters of clustering are following: (1) DBSCAN is capable of dissimilar features are identified, loss of important fea- determining outlier; (2) it does not require the possible tures can be minimized by selecting the largest among number of clusters as a input; and (3) it can discover the clusters. Additionally, it is always preferred that the arbitrary shaped clusters. The steps involved in the pro- number of features is determined automatically by the posed feature selection method are illustrated below: J. Biosci. 40(4), October 2015 Feature selection in biological data 723 2.1 Steps of FSICI quantify information loss between a pair of features. In the following derivation we show how the larger eigenvalue can 2.1.1 Measuring feature dissimilarity: Although correlation be used as a measure of feature dissimilarity. coefficient is one of the obvious choices for tracking linear Let x and y be two random variables and the covariance dependency between two variables x and y, it has the following matrix of x
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]
  • Enhancement of DBSCAN Algorithm and Transparency Clustering Of
    IJRECE VOL. 5 ISSUE 4 OCT.-DEC. 2017 ISSN: 2393-9028 (PRINT) | ISSN: 2348-2281 (ONLINE) Enhancement of DBSCAN Algorithm and Transparency Clustering of Large Datasets Kumari Silky1, Nitin Sharma2 1Research Scholar, 2Assistant Professor Institute of Engineering Technology, Alwar, Rajasthan, India Abstract: The data mining is the technique which can extract process of dividing the data into similar objects groups. A level useful information from the raw data. The clustering is the of simplification is achieved in case of less number of clusters technique of data mining which can group similar and dissimilar involved. But because of less number of clusters some of the type of information. The density based clustering is the type of fine details have been lost. With the use or help of clusters the clustering which can cluster data according to the density. The data is modeled. According to the machine learning view, the DBSCAN is the algorithm of density based clustering in which clusters search in a unsupervised manner and it is also as the EPS value is calculated which define radius of the cluster. The hidden patterns. The system that comes as an outcome defines a Euclidian distance will be calculated using neural networks data concept [3]. The clustering mechanism does not have only which calculate similarity in the more effective manner. The one step it can be analyzed from the definition of clustering. proposed algorithm is implemented in MATLAB and results are Apart from partitional and hierarchical clustering algorithms analyzed in terms of accuracy, execution time. number of new techniques has been evolved for the purpose of clustering of data.
    [Show full text]
  • Comparison of Dimensionality Reduction Techniques on Audio Signals
    Comparison of Dimensionality Reduction Techniques on Audio Signals Tamás Pál, Dániel T. Várkonyi Eötvös Loránd University, Faculty of Informatics, Department of Data Science and Engineering, Telekom Innovation Laboratories, Budapest, Hungary {evwolcheim, varkonyid}@inf.elte.hu WWW home page: http://t-labs.elte.hu Abstract: Analysis of audio signals is widely used and this work: car horn, dog bark, engine idling, gun shot, and very effective technique in several domains like health- street music [5]. care, transportation, and agriculture. In a general process Related work is presented in Section 2, basic mathe- the output of the feature extraction method results in huge matical notation used is described in Section 3, while the number of relevant features which may be difficult to pro- different methods of the pipeline are briefly presented in cess. The number of features heavily correlates with the Section 4. Section 5 contains data about the evaluation complexity of the following machine learning method. Di- methodology, Section 6 presents the results and conclu- mensionality reduction methods have been used success- sions are formulated in Section 7. fully in recent times in machine learning to reduce com- The goal of this paper is to find a combination of feature plexity and memory usage and improve speed of following extraction and dimensionality reduction methods which ML algorithms. This paper attempts to compare the state can be most efficiently applied to audio data visualization of the art dimensionality reduction techniques as a build- in 2D and preserve inter-class relations the most. ing block of the general process and analyze the usability of these methods in visualizing large audio datasets.
    [Show full text]
  • DBSCAN++: Towards Fast and Scalable Density Clustering
    DBSCAN++: Towards fast and scalable density clustering Jennifer Jang 1 Heinrich Jiang 2 Abstract 2, it quickly starts to exhibit quadratic behavior in high di- mensions and/or when n becomes large. In fact, we show in DBSCAN is a classical density-based clustering Figure1 that even with a simple mixture of 3-dimensional procedure with tremendous practical relevance. Gaussians, DBSCAN already starts to show quadratic be- However, DBSCAN implicitly needs to compute havior. the empirical density for each sample point, lead- ing to a quadratic worst-case time complexity, The quadratic runtime for these density-based procedures which is too slow on large datasets. We propose can be seen from the fact that they implicitly must compute DBSCAN++, a simple modification of DBSCAN density estimates for each data point, which is linear time which only requires computing the densities for a in the worst case for each query. In the case of DBSCAN, chosen subset of points. We show empirically that, such queries are proximity-based. There has been much compared to traditional DBSCAN, DBSCAN++ work done in using space-partitioning data structures such can provide not only competitive performance but as KD-Trees (Bentley, 1975) and Cover Trees (Beygelzimer also added robustness in the bandwidth hyperpa- et al., 2006) to improve query times, but these structures are rameter while taking a fraction of the runtime. all still linear in the worst-case. Another line of work that We also present statistical consistency guarantees has had practical success is in approximate nearest neigh- showing the trade-off between computational cost bor methods (e.g.
    [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]
  • Density-Based Clustering of Static and Dynamic Functional MRI Connectivity
    Rangaprakash et al. Brain Inf. (2020) 7:19 https://doi.org/10.1186/s40708-020-00120-2 Brain Informatics RESEARCH Open Access Density-based clustering of static and dynamic functional MRI connectivity features obtained from subjects with cognitive impairment D. Rangaprakash1,2,3, Toluwanimi Odemuyiwa4, D. Narayana Dutt5, Gopikrishna Deshpande6,7,8,9,10,11,12,13* and Alzheimer’s Disease Neuroimaging Initiative Abstract Various machine-learning classifcation techniques have been employed previously to classify brain states in healthy and disease populations using functional magnetic resonance imaging (fMRI). These methods generally use super- vised classifers that are sensitive to outliers and require labeling of training data to generate a predictive model. Density-based clustering, which overcomes these issues, is a popular unsupervised learning approach whose util- ity for high-dimensional neuroimaging data has not been previously evaluated. Its advantages include insensitivity to outliers and ability to work with unlabeled data. Unlike the popular k-means clustering, the number of clusters need not be specifed. In this study, we compare the performance of two popular density-based clustering methods, DBSCAN and OPTICS, in accurately identifying individuals with three stages of cognitive impairment, including Alzhei- mer’s disease. We used static and dynamic functional connectivity features for clustering, which captures the strength and temporal variation of brain connectivity respectively. To assess the robustness of clustering to noise/outliers, we propose a novel method called recursive-clustering using additive-noise (R-CLAN). Results demonstrated that both clustering algorithms were efective, although OPTICS with dynamic connectivity features outperformed in terms of cluster purity (95.46%) and robustness to noise/outliers.
    [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]
  • An Improvement for DBSCAN Algorithm for Best Results in Varied Densities
    Computer Engineering Department Faculty of Engineering Deanery of Higher Studies The Islamic University-Gaza Palestine An Improvement for DBSCAN Algorithm for Best Results in Varied Densities Mohammad N. T. Elbatta Supervisor Dr. Wesam M. Ashour A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Engineering Gaza, Palestine (September, 2012) 1433 H ii stnkmegnelnonkcA Apart from the efforts of myself, the success of any project depends largely on the encouragement and guidelines of many others. I take this opportunity to express my gratitude to the people who have been instrumental in the successful completion of this project. I would like to thank my parents for providing me with the opportunity to be where I am. Without them, none of this would be even possible to do. You have always been around supporting and encouraging me and I appreciate that. I would also like to thank my brothers and sisters for their encouragement, input and constructive criticism which are really priceless. Also, special thanks goes to Dr. Homam Feqawi who did not spare any effort to review and audit my thesis linguistically. My heartiest gratitude to my wonderful wife, Nehal, for her patience and forbearance through my studying and preparing this study. I would like to express my sincere gratitude to my advisor Dr. Wesam Ashour for the continuous support of my master study and research, for his patience, motivation, enthusiasm, and immense knowledge. His guidance helped me in all the time of research and writing of this thesis. I could not have imagined having a better advisor and mentor for my master study.
    [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]