Various embodiments select features from a feature space. In one embodiment, a set of training samples and a set of test samples are received. A first centered Gram matrix of a given dimension is determined for each of a set of feature vectors that include at least one of the set of training samples and at least one of the set of test samples. A second centered Gram matrix of the given dimension is determined for a target value vector that includes target values from the set of training samples. A set of columns and rows associated with the at least one of the test samples in the second centered Gram matrix is set to 0. A subset of features is selected from a set of features based on the first and second centered Gram matrices.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer implemented method for selecting features from a feature space, the computer implemented method comprising: receiving, by a processor, a set of training samples and a set of test samples, wherein each of the set of training samples comprises a set of features and a target value, and wherein the set of test samples comprises the set of features absent the class value; determining a first centered Gram matrix of a given dimension for each of a set of feature vectors comprising at least one of the set of training samples and at least one of the set of test samples; determining a second centered Gram matrix of the given dimension for a target value vector comprising the target values from the set of training samples; and selecting a subset of features from the set of features based on the first and second centered Gram matrices. 2. The computer implemented method of claim 1, wherein determining each of the first centered Gram matrices comprises: determining, for each of the set of feature vectors, a Gram matrix based on computing, a Gaussian kernel function on each pair of vector elements in the feature vector; and multiplying a centering matrix on each side of the Gram matrix. 3. The computer implemented method of claim 1, wherein determining the second centered Gram matrix comprises: generating the target value vector with a first n values being the target values from the set of training samples, and a remaining n′ values being set to infinity, where n′ is a number of test samples in the set of test samples; determining a Gram matrix based on computing, a Gaussian kernel function of size (n+n′)×(n+n′) on each pair of vector elements in the target value vector; setting a set of columns and rows in the Gram matrix with index [n+1, . . . , n+n′] to 0; and multiplying, after the setting, a centering matrix on each side of the Gram matrix. 4. The computer implemented method of claim 1, further comprising: concatenating each column in the second centered Gram matrix into a vector of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples. 5. The computer implemented method of claim 4, further comprising: concatenating each column in each of the first centered Gram matrices into one of a set of d vectors of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples. 6. The computer implemented method of claim 5, further comprising: generating a single matrix based on each of the set of d vectors, where each column of the single matrix is one of the set of d vectors, and where the single matrix is of a size (n+n′)×(n+n′)×d. 7. The computer implemented method of claim 6, wherein the subset of features are selected from the single matrix and the single vector. 8. The computer implemented method of claim 1, wherein the selecting is based on:  min α ∈ • d  1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 + λ   α  1 ,   s . t .  α 1 , …  , α d ≥ 0 , where 1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 = 1 2  HSIC  ( y training , y training ) - ∑ k = 1 d   α k  HSIC  ( u k training , y training ) + 1 2  ∑ k , l = 1 d   α k  α l  HSIC  ( u k training + test , u l training + test ) ,   and where ∥·∥ Frob is a Frobenius norm, K(k)=ΓK′(k)Γ is the first centered Gram matrix, L′=ΓL′Γ is the second centered Gram matrix, K′i,j(k)=K′(xk,i,xk,j) and L′i,j=L′(yi,yj) for 1≦i,j≦n are Gram matrices, n is the number of samples, K′(x,x′) and L′(y,y′) are kernel functions, Γ = I n - 1 n  1 n  1 n • is a centering matrix, In is the n-dimensional identity matrix, 1n is an n-dimensional vector with all ones, d is a total number of features, and HSIC is a Hilbert-Schmidt independence criterion. 9. An information processing system for selecting features from a feature space, the information processing system comprising: a memory; a processor communicatively coupled to the memory; and a feature selection module communicatively coupled to the memory and the processor, wherein the feature selection module programs the processor to perform a method comprising: receiving a set of training samples and a set of test samples, wherein each of the set of training samples comprises a set of features and a target value, and wherein the set of test samples comprises the set of features absent the target value; determining a first centered Gram matrix of a given dimension for each of a set of feature vectors comprising at least one of the set of training samples and at least one of the set of test samples; determining a second centered Gram matrix of the given dimension for a target value vector comprising the target values from the set of training samples; and selecting a subset of features from the set of features based on the first and second centered Gram matrices. 10. The information processing system of claim 9, wherein determining each of the first centered Gram matrices comprises: determining, for each of the set of feature vectors, a Gram matrix based on computing, a Gaussian kernel function on each pair of vector elements in the feature vector; and multiplying a centering matrix on each side of the Gram matrix, wherein determining the second centered Gram matrix comprises: generating the target value vector with a first n values being the target values from the set of training samples, and a remaining n′ values being set to infinity, where n′ is a number of test samples in the set of test samples; determining a Gram matrix based on computing, a Gaussian kernel function of size (n+n′)×(n+n′) on each pair of vector elements in the target value vector; setting a set of columns and rows in the Gram matrix with index [n+1, . . . , n+n′] to 0; and multiplying, after the setting, a centering matrix on each side of the Gram matrix. 11. The information processing system of claim 9, wherein the method further comprises: concatenating each column in the second centered Gram matrix into a vector of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples. 12. The information processing system of claim 11, wherein the method further comprises concatenating each column in each of the first centered Gram matrices into one of a set of d vectors of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples; and generating a single matrix based on each of the set of d vectors, where each column of the single matrix is one of the set of d vectors, and where the single matrix is of a size (n+n′)×(n+n′)×d. 13. The information processing system of claim 9, wherein the selecting is based on: min α ∈ • d  1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 + λ   α  1 ,   s . t .  α 1 , …  , α d ≥ 0 , where 1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 = 1 2  HSIC  ( y training , y training ) - ∑ k = 1 d   α k  HSIC  ( u k training , y training ) + 1 2  ∑ k , l = 1 d   α k  α l  HSIC  ( u k training + test , u l training + test ) ,   and where ∥·∥Frob is a Frobenius norm, K(k)=ΓK′(k)Γ is the first centered Gram matrix, L′=ΓL′Γ is the second centered Gram matrix, K′i,j(k)=K′(xk,i,xk,j) and L′i,j=L′(yi,yj) for 1≦i,j≦n are Gram matrices, n is the number of samples, K′(x,x′) and L′(y,y′) are kernel functions, Γ = I n - 1 n  1 n  1 n • is a centering matrix, In is the n-dimensional identity matrix, 1n is an n-dimensional vector with all ones, d is a total number of features, and HSIC is a Hilbert-Schmidt independence criterion. 14. A computer program product for selecting features from a feature space, the computer program product comprising: a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit, the instructions programming the processing circuit to perform a method comprising: receiving, by a processor, a set of training samples and a set of test samples, wherein each of the set of training samples comprises a set of features and a target value, and wherein the set of test samples comprises the set of features absent the target value; determining a first centered Gram matrix of a given dimension for each of a set of feature vectors comprising at least one of the set of training samples and at least one of the set of test samples; determining a second centered Gram matrix of the given dimension for a target value vector comprising the target values from the set of training samples; selecting a subset of features from the set of features based on the first and second centered Gram matrices. 15. The non-transitory computer program product of claim 14, wherein determining each of the first centered Gram matrices comprises: determining, for each of the set of feature vectors, a Gram matrix based on computing, a Gaussian kernel function on each pair of vector elements in the feature vector; and multiplying a centering matrix on each side of the Gram matrix. 16. The non-transitory computer program product of claim 14, wherein determining the second centered Gram matrix comprises: generating the target value vector with a first n values being the target values from the set of training samples, and a remaining n′ values being set to infinity, where n′ is a number of test samples in the set of test samples; determining a Gram matrix based on computing, a Gaussian kernel function of size (n+n′)×(n+n′) on each pair of vector elements in the target value vector; setting a set of columns and rows in the Gram matrix with index [n+1, . . . , n+n′] to 0; and multiplying, after the setting, a centering matrix on each side of the Gram matrix. 17. The non-transitory computer program product of claim 14, wherein the method further comprises: concatenating each column in the second centered Gram matrix into a vector of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples. 18. The non-transitory computer program product of claim 17, wherein the method further comprises: concatenating each column in each of the first centered Gram matrices into one of a set of d vectors of size (n+n′)×(n+n′), where n corresponds to a number of target values in the set of training samples and n′ corresponds to a number of test samples in the set of test samples; and generating a single matrix based on each of the set of d vectors, where each column of the single matrix is one of the set of d vectors, and where the single matrix is of a size (n+n′)×(n+n′)×d. 19. The non-transitory computer program product of claim 18, wherein the subset of features are selected from the single matrix and the single vector. 20. The non-transitory computer program product of claim 14, wherein the selecting is based on: min α ∈ • d  1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 + λ   α  1 ,   s . t .  α 1 , …  , α d ≥ 0 , where 1 2   L _ ′ - ∑ k = 1 d   α k  K _ ′  ( k )  Frob 2 = 1 2  HSIC  ( y training , y training ) - ∑ k = 1 d   α k  HSIC  ( u k training , y training ) + 1 2  ∑ k , l = 1 d   α k  α l  HSIC  ( u k training + test , u l training + test ) ,   and where ∥·∥Frob is a Frobenius norm, K(k)=ΓK′(k)Γ is the first centered Gram matrix, L′=ΓL′Γ is the second centered Gram matrix, K′i,j(k)=K′(xk,i,xk,j) and L′i,j=L′(yi,yj) for 1≦i,j≦n are Gram matrices, n is the number of samples, K′(x,x′) and L′(y,y′) are kernel functions, Γ = I n - 1 n  1 n  1 n • is a centering matrix, In is the n-dimensional identity matrix, 1n is an n-dimensional vector with all ones, d is a total number of features, and HSIC is a Hilbert-Schmidt independence criterion.