Carlos Alzate
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Carlos Alzate has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Johan A. K. Suykens
ESAT-STADIUS, KU Leuven
9 shared publications - Carolina Varon
KU Leuven
1 shared publication - J. Debosscher
Instituut voor Sterrenkunde, Katholieke Universiteit Leuven, Celestijnenlaan 200D, 3001 Leuven, Belgium
1 shared publication J.A.K. Suykens
1 shared publication- Rocco Langone
KU Leuven ESAT-STADIUS
1 shared publication
Latest Publications
- 1 May 2013
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 392 (10) , 2588-2606
Kernel spectral clustering with memory effect
- 1 May 2013
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 392 (10) , 2588-2606
Kernel spectral clustering with memory effect
- 1 November 2012
- Published by Elsevier in Neural Networks
- Vol. 35, 21-30
Hierarchical kernel spectral clustering
- 1 November 2012
- Published by Elsevier in Neural Networks
- Vol. 35, 21-30
Hierarchical kernel spectral clustering
- Open Access
- 5 July 2011
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 531, A156
Kernel spectral clustering of time series in the CoRoT exoplanet database
Astronomy & Astrophysics (A&A) is an international journal which publishes papers on all aspects of astronomy and astrophysics
- 5 July 2011
- Published by EDP Sciences in Astronomy & Astrophysics
- Vol. 531, A156
Open AccessKernel spectral clustering of time series in the CoRoT exoplanet database
Astronomy & Astrophysics (A&A) is an international journal which publishes papers on all aspects of astronomy and astrophysics
- 1 April 2011
- Published by Elsevier in Neurocomputing
- Vol. 74 (9) , 1382-1390
Sparse kernel spectral clustering models for large-scale data analysis
- 1 April 2011
- Published by Elsevier in Neurocomputing
- Vol. 74 (9) , 1382-1390
Sparse kernel spectral clustering models for large-scale data analysis
- 12 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 32 (2) , 335-347
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual least-squares support vector machine (LS-SVM) formulations. The formulation allows the extension to out-of-sample points. In this way, the proposed clustering model can be trained, validated, and tested. The clustering information is contained on the eigendecomposition of a modified similarity matrix derived from the data. This eigenvalue problem corresponds to the dual solution of a primal optimization problem formulated in a high-dimensional feature space. A model selection criterion called the balanced line fit (BLF) is also proposed. This criterion is based on the out-of-sample extension and exploits the structure of the eigenvectors and the corresponding projections when the clusters are well formed. The BLF criterion can be used to obtain clustering parameters in a learning framework. Experimental results with difficult toy problems and image segmentation show improved performance in terms of generalization to new samples and computation times.
- 12 December 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 32 (2) , 335-347
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual least-squares support vector machine (LS-SVM) formulations. The formulation allows the extension to out-of-sample points. In this way, the proposed clustering model can be trained, validated, and tested. The clustering information is contained on the eigendecomposition of a modified similarity matrix derived from the data. This eigenvalue problem corresponds to the dual solution of a primal optimization problem formulated in a high-dimensional feature space. A model selection criterion called the balanced line fit (BLF) is also proposed. This criterion is based on the out-of-sample extension and exploits the structure of the eigenvectors and the corresponding projections when the clusters are well formed. The BLF criterion can be used to obtain clustering parameters in a learning framework. Experimental results with difficult toy problems and image segmentation show improved performance in terms of generalization to new samples and computation times.
- 18 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 19 (9) , 1583-1598
Kernel Component Analysis Using an Epsilon-Insensitive Robust Loss Function
Kernel principal component analysis (PCA) is a technique to perform feature extraction in a high-dimensional feature space, which is nonlinearly related to the original input space. The kernel PCA formulation corresponds to an eigendecomposition of the kernel matrix: eigenvectors with large eigenvalues correspond to the principal components in the feature space. Starting from the least squares support vector machine (LS-SVM) formulation to kernel PCA, we extend it to a generalized form of kernel component analysis (KCA) with a general underlying loss function made explicit. For classical kernel PCA, the underlying loss function is L 2 . In this generalized form, one can plug in also other loss functions. In the context of robust statistics, it is known that the L 2 loss function is not robust because its influence function is not bounded. Therefore, outliers can skew the solution from the desired one. Another issue with kernel PCA is the lack of sparseness: the principal components are dense expansions in terms of kernel functions. In this paper, we introduce robustness and sparseness into kernel component analysis by using an epsilon-insensitive robust loss function. We propose two different algorithms. The first method solves a set of nonlinear equations with kernel PCA as starting points. The second method uses a simplified iterative weighting procedure that leads to solving a sequence of generalized eigenvalue problems. Simulations with toy and real-life data show improvements in terms of robustness together with a sparse representation.
- 18 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 19 (9) , 1583-1598
Kernel Component Analysis Using an Epsilon-Insensitive Robust Loss Function
Kernel principal component analysis (PCA) is a technique to perform feature extraction in a high-dimensional feature space, which is nonlinearly related to the original input space. The kernel PCA formulation corresponds to an eigendecomposition of the kernel matrix: eigenvectors with large eigenvalues correspond to the principal components in the feature space. Starting from the least squares support vector machine (LS-SVM) formulation to kernel PCA, we extend it to a generalized form of kernel component analysis (KCA) with a general underlying loss function made explicit. For classical kernel PCA, the underlying loss function is L 2 . In this generalized form, one can plug in also other loss functions. In the context of robust statistics, it is known that the L 2 loss function is not robust because its influence function is not bounded. Therefore, outliers can skew the solution from the desired one. Another issue with kernel PCA is the lack of sparseness: the principal components are dense expansions in terms of kernel functions. In this paper, we introduce robustness and sparseness into kernel component analysis by using an epsilon-insensitive robust loss function. We propose two different algorithms. The first method solves a set of nonlinear equations with kernel PCA as starting points. The second method uses a simplified iterative weighting procedure that leads to solving a sequence of generalized eigenvalue problems. Simulations with toy and real-life data show improvements in terms of robustness together with a sparse representation.
- 1 March 2008
- Published by Elsevier in Neural Networks
- Vol. 21 (2-3) , 170-181
A regularized kernel CCA contrast function for ICA
- 1 March 2008
- Published by Elsevier in Neural Networks
- Vol. 21 (2-3) , 170-181
A regularized kernel CCA contrast function for ICA
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21614393,p. 2920-2925
ICA through an LS-SVM based Kernel CCA Measure for Independence
A new measure for independence based on canonical correlation in high dimensional feature spaces is presented. This measure can be used as a contrast function for independent component analysis (ICA). The formulation fits in the least squares support vector machines (LS-SVM) framework as a primal-dual interpretation of kernel canonical correlation analysis (CCA) in the context of constrained optimization problems. Regularization is incorporated naturally in the primal formulation leading to a dual generalized eigenvalue problem. Due to the primal-dual nature of the proposed approach, the measure for independence can be calculated for out-of-sample data points which is important for parameter selection ensuring statistical reliability of the estimated measure. Simulations results with small toy datasets performing model selection on a validation set showed good performance avoiding overfltting. Experiments with image demixing using approximated kernel matrices via incomplete Cholesky decomposition showed good results together with a reduced computational cost.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21614393,p. 2920-2925
ICA through an LS-SVM based Kernel CCA Measure for Independence
A new measure for independence based on canonical correlation in high dimensional feature spaces is presented. This measure can be used as a contrast function for independent component analysis (ICA). The formulation fits in the least squares support vector machines (LS-SVM) framework as a primal-dual interpretation of kernel canonical correlation analysis (CCA) in the context of constrained optimization problems. Regularization is incorporated naturally in the primal formulation leading to a dual generalized eigenvalue problem. Due to the primal-dual nature of the proposed approach, the measure for independence can be calculated for out-of-sample data points which is important for parameter selection ensuring statistical reliability of the estimated measure. Simulations results with small toy datasets performing model selection on a validation set showed good performance avoiding overfltting. Experiments with image demixing using approximated kernel matrices via incomplete Cholesky decomposition showed good results together with a reduced computational cost.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-213
Image Segmentation using a Weighted Kernel PCA Approach to Spectral Clustering
In classical graph-based image segmentation, a data-driven matrix is constructed representing similarities between every pair of pixels. The eigenvectors of such matrices contain relevant information about the clusters present on the image. An approach to image segmentation using spectral clustering with out-of-sample extensions is presented. This approach is based on the weighted kernel PCA framework. An advantage of the proposed method is the possibility to train and validate the clustering model on subsampled parts of the image to be segmented. The cluster indicators for the remaining pixels can then be inferred using the out-of-sample extension. This subsampling scheme can be used to reduce the computation time of the segmentation. Simulation results with grayscale and color images show improvements in terms of computation times together with visually appealing clusters
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-213
Image Segmentation using a Weighted Kernel PCA Approach to Spectral Clustering
In classical graph-based image segmentation, a data-driven matrix is constructed representing similarities between every pair of pixels. The eigenvectors of such matrices contain relevant information about the clusters present on the image. An approach to image segmentation using spectral clustering with out-of-sample extensions is presented. This approach is based on the weighted kernel PCA framework. An advantage of the proposed method is the possibility to train and validate the clustering model on subsampled parts of the image to be segmented. The cluster indicators for the remaining pixels can then be inferred using the out-of-sample extension. This subsampling scheme can be used to reduce the computation time of the segmentation. Simulation results with grayscale and color images show improvements in terms of computation times together with visually appealing clusters
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21614393,p. 138-144
A Weighted Kernel PCA Formulation with Out-of-Sample Extensions for Spectral Clustering Methods
A new formulation to spectral clustering methods based on the weighted kernel principal component analysis is presented. This formulation fits in the Least Squares Support Vector Machines (LS-SVM) framework as a primal-dual interpretation in the context of constrained optimization problems. Starting from the LS-SVM formulation to kernel PCA, a weighted approach is derived. An advantage of this method is the possibility to apply the trained clustering model to out-of-sample (test) data points without using approximation techniques such as the Nystrom method. Links with some existing spectral clustering techniques are given, showing that these techniques are particular cases of weighted kernel PCA. Simulation results with toy and real-life data show improvements in terms of generalization to new samples.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21614393,p. 138-144
A Weighted Kernel PCA Formulation with Out-of-Sample Extensions for Spectral Clustering Methods
A new formulation to spectral clustering methods based on the weighted kernel principal component analysis is presented. This formulation fits in the Least Squares Support Vector Machines (LS-SVM) framework as a primal-dual interpretation in the context of constrained optimization problems. Starting from the LS-SVM formulation to kernel PCA, a weighted approach is derived. An advantage of this method is the possibility to apply the trained clustering model to out-of-sample (test) data points without using approximation techniques such as the Nystrom method. Links with some existing spectral clustering techniques are given, showing that these techniques are particular cases of weighted kernel PCA. Simulation results with toy and real-life data show improvements in terms of generalization to new samples.