Jose Dorronsoro

Prof. Jose Dorronsoro

Universidad Autónoma de Madrid, Madrid, Spain

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

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

Representative Publications

View All Publications
1 July 1997 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro
FGF. Ginel
F. Ginel
CSC. Sgnchez
C. Sgnchez
CCC.S. Cruz
C.S. Cruz
This paper presents an online system for fraud detection of credit card operations based on a neural classifier. Since it is installed in a transactional hub for operation distribution, and not on a card-issuing institution, it acts solely on the information of the operation to be rated and of its immediate previous history, and not on historic databases of past cardholder activities. Among the main characteristics of credit card traffic are the great imbalance between proper and fraudulent operations, and a great degree of mixing between both. To ensure proper model construction, a nonlinear version of Fisher's discriminant analysis, which adequately separates a good proportion of fraudulent operations away from other closer to normal traffic, has been used. The system is fully operational and currently handles more than 12 million operations per year with very satisfactory results.

1 January 2007
Verified
Book Chapter
Closed access
PDF file
ÁJÁlvaro Barbero Jiménez
Álvaro Barbero Jiménez
JLJorge López Lázaro
Jorge López Lázaro
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro

11 October 2019 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
ACAlejandro Catalina
Alejandro Catalina
CACarlos M. Alaiz
Carlos M. Alaiz
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro

1 August 2009 in Neurocomputing
Verified
Journal Article
Closed access
ÁJÁlvaro Barbero Jiménez
Álvaro Barbero Jiménez
JLJorge López Lázaro
Jorge López Lázaro
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro

1 May 2012 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JLJorge Lopez
Jorge Lopez
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro
In this brief, we give a new proof of the asymptotic convergence of the sequential minimum optimization (SMO) algorithm for both the most violating pair and second order rules to select the pair of coefficients to be updated. The proof is more self-contained, shorter, and simpler than previous ones and has a different flavor, partially building upon Gilbert's original convergence proof of its algorithm to solve the minimum norm problem for convex hulls. It is valid for both support vector classification (SVC) and support vector regression, which are formulated under a general problem that encompasses them. Moreover, this general problem can be further extended to also cover other support vector machines (SVM)-related problems such as -SVC or one-class SVMs, while the convergence proof of the slight variant of SMO needed for them remains basically unchanged.

11 April 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Open access
DDDavid Diaz-Vico
David Diaz-Vico
Jose DorronsoroJose Dorronsoro
Jose Dorronsoro
While being one of the first and most elegant tools for dimensionality reduction, Fisher linear discriminant analysis (FLDA) is not currently considered among the top methods for feature extraction or classification. In this paper, we will review two recent approaches to FLDA, namely, least squares Fisher discriminant analysis (LSFDA) and regularized kernel FDA (RKFDA) and propose deep FDA (DFDA), a straightforward nonlinear extension of LSFDA that takes advantage of the recent advances on deep neural networks. We will compare the performance of RKFDA and DFDA on a large number of two-class and multiclass problems, many of them involving class-imbalanced data sets and some having quite large sample sizes; we will use, for this, the areas under the receiver operating characteristics (ROCs) curve of the classifiers considered. As we shall see, the classification performance of both methods is often very similar and particularly good on imbalanced problems, but building DFDA models is considerably much faster than doing so for RKFDA, particularly in problems with quite large sample sizes.