Siamak Mehrkanoon

Prof. Siamak Mehrkanoon


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
22 June 2012 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SMSiamak Mehrkanoon
Siamak Mehrkanoon
TFTillmann Falck
Tillmann Falck
JSJohan Suykens
Johan Suykens
In this paper, a new approach based on least squares support vector machines (LS-SVMs) is proposed for solving linear and nonlinear ordinary differential equations (ODEs). The approximate solution is presented in closed form by means of LS-SVMs, whose parameters are adjusted to minimize an appropriate error function. For the linear and nonlinear cases, these parameters are obtained by solving a system of linear and nonlinear equations, respectively. The method is well suited to solving mildly stiff, nonstiff, and singular ODEs with initial and boundary conditions. Numerical results demonstrate the efficiency of the proposed method over existing methods.

1 June 2017 in Mechanical Systems and Signal Processing
Verified
Journal Article
Closed access
RLRocco Langone
Rocco Langone
EREdwin Reynders
Edwin Reynders
SMSiamak Mehrkanoon
Siamak Mehrkanoon
JSJohan Suykens
Johan Suykens

1 July 2015 in Neurocomputing
Verified
Journal Article
Closed access
SMSiamak Mehrkanoon
Siamak Mehrkanoon
JSJohan Suykens
Johan Suykens

1 June 2016 in Neural Computation
Verified
Journal Article
Closed access
YFYunlong Feng
Yunlong Feng
YYYuning Yang
Yuning Yang
XHXiaolin Huang
Xiaolin Huang
SMSiamak Mehrkanoon
Siamak Mehrkanoon
JSJohan Suykens
Johan Suykens
This letter addresses the robustness problem when learning a large margin classifier in the presence of label noise. In our study, we achieve this purpose by proposing robustified large margin support vector machines. The robustness of the proposed robust support vector classifiers (RSVC), which is interpreted from a weighted viewpoint in this work, is due to the use of nonconvex classification losses. Besides the robustness, we also show that the proposed RSCV is simultaneously smooth, which again benefits from using smooth classification losses. The idea of proposing RSVC comes from M-estimation in statistics since the proposed robust and smooth classification losses can be taken as one-sided cost functions in robust statistics. Its Fisher consistency property and generalization ability are also investigated. Besides the robustness and smoothness, another nice property of RSVC lies in the fact that its solution can be obtained by solving weighted squared hinge loss–based support vector machine problems iteratively. We further show that in each iteration, it is a quadratic programming problem in its dual space and can be solved by using state-of-the-art methods. We thus propose an iteratively reweighted type algorithm and provide a constructive proof of its convergence to a stationary point. Effectiveness of the proposed classifiers is verified on both artificial and real data sets.

29 May 2014 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SMSiamak Mehrkanoon
Siamak Mehrkanoon
CACarlos Alzate
Carlos Alzate
Raghvendra MallRaghvendra Mall
Raghvendra Mall
RLRocco Langone
Rocco Langone
JSJohan Suykens
Johan Suykens
This paper proposes a multiclass semisupervised learning algorithm by using kernel spectral clustering (KSC) as a core model. A regularized KSC is formulated to estimate the class memberships of data points in a semisupervised setting using the one-versus-all strategy while both labeled and unlabeled data points are present in the learning process. The propagation of the labels to a large amount of unlabeled data points is achieved by adding the regularization terms to the cost function of the KSC formulation. In other words, imposing the regularization term enforces certain desired memberships. The model is then obtained by solving a linear system in the dual. Furthermore, the optimal embedding dimension is designed for semisupervised clustering. This plays a key role when one deals with a large number of clusters.

1 November 2014 in Neurocomputing
Verified
Journal Article
Closed access
SMSiamak Mehrkanoon
Siamak Mehrkanoon
XHXiaolin Huang
Xiaolin Huang
JSJohan Suykens
Johan Suykens