Carlos Alaíz

Dr. Carlos Alaíz

Universidad Autónoma de Madrid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 2017 in Physical Review E
Verified
Journal Article
Closed access
PDF file
MFMichaël Fanuel
Michaël Fanuel
Carlos AlaízCarlos Alaíz
Carlos Alaíz
JSJohan Suykens
Johan Suykens
Communities in directed networks have often been characterized as regions with a high density of links, or as sets of nodes with certain patterns of connection. Our approach for community detection combines the optimization of a quality function and a spectral clustering of a deformation of the combinatorial Laplacian, the so-called magnetic Laplacian. The eigenfunctions of the magnetic Laplacian, which we call magnetic eigenmaps, incorporate structural information. Hence, using the magnetic eigenmaps, dense communities including directed cycles can be revealed as well as “role” communities in networks with a running flow, usually discovered thanks to mixture models. Furthermore, in the spirit of the Markov stability method, an approach for studying communities at different energy levels in the network is put forward, based on a quantum mechanical system at finite temperature.

1 January 2018 in Applied and Computational Harmonic Analysis
Verified
Journal Article
Closed access
MFMichaël Fanuel
Michaël Fanuel
Carlos AlaízCarlos Alaíz
Carlos Alaíz
ÁFÁngela Fernández
Ángela Fernández
JSJohan Suykens
Johan Suykens

10 January 2024 in Neurocomputing
Verified
Journal Article
Open access
CRCarlos Ruiz
Carlos Ruiz
Carlos AlaízCarlos Alaíz
Carlos Alaíz
JDJosé R. Dorronsoro
José R. Dorronsoro

23 June 2017 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Carlos AlaízCarlos Alaíz
Carlos Alaíz
MFMichaëel Fanuel
Michaëel Fanuel
JSJohan Suykens
Johan Suykens
In this brief, kernel principal component analysis (KPCA) is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is indeed a solution, and not a mere saddle point. Although these insights do not imply any algorithmic improvement, they can be used to further understand the method, formulate possible extensions, and properly address them. As an example, a new convex optimization problem for semisupervised classification is proposed, which seems particularly well suited whenever the number of known labels is small. Our formulation resembles a least squares support vector machine problem with a regularization parameter multiplied by a negative sign, combined with a variational principle for KPCA. Our primal optimization principle for semisupervised learning is solved in terms of the Lagrange multipliers. Numerical experiments in several classification tasks illustrate the performance of the proposed model in problems with only a few labeled data.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
Carlos AlaízCarlos Alaíz
Carlos Alaíz
ÁBÁlvaro Barbero
Álvaro Barbero
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro

5 January 2019 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
ACAlejandro Catalina
Alejandro Catalina
ATAlberto Torres-Barrán
Alberto Torres-Barrán
Carlos AlaízCarlos Alaíz
Carlos Alaíz
JDJosé R. Dorronsoro
José R. Dorronsoro