<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Michel Bierlaire | José Ángel Martín Baos</title><link>https://joseangelmartin.com/es/authors/michel-bierlaire/</link><atom:link href="https://joseangelmartin.com/es/authors/michel-bierlaire/index.xml" rel="self" type="application/rss+xml"/><description>Michel Bierlaire</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>es-es</language><lastBuildDate>Fri, 07 Feb 2025 00:00:00 +0000</lastBuildDate><item><title>Scalable kernel logistic regression with Nyström approximation: Theoretical analysis and application to discrete choice modelling</title><link>https://joseangelmartin.com/es/publication/mgr-25/</link><pubDate>Fri, 07 Feb 2025 00:00:00 +0000</pubDate><guid>https://joseangelmartin.com/es/publication/mgr-25/</guid><description/></item><item><title>Nyström-based approximations for kernel logistic regression: Application to transport choice modelling</title><link>https://joseangelmartin.com/es/talk/2023-07-wctr-2023/</link><pubDate>Mon, 17 Jul 2023 00:00:00 +0000</pubDate><guid>https://joseangelmartin.com/es/talk/2023-07-wctr-2023/</guid><description>&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
&lt;p&gt;The application of machine learning techniques, more specifically kernel-based techniques, to discrete choice modelling using large datasets is limited by the great number of parameters to be considered when building the kernel matrix and the size of the kernel matrix itself. The spatial and temporal complexity is such that these methods are not applicable to large sample sizes. However, there are techniques that allow generating a low-rank matrix approximation to the kernel matrix, one of them is the Nyström method. One limitation of the Nyström method is that the quality of the kernel matrix approximation depends on the proper choice of landmark points. In this work, four variants of this technique are implemented, a basic uniform method, one based on the K-means algorithm and two different implementations of a non-uniform method based on leverage scores. Later, in the experimentation, we conduct a comparison of these methods applied to two big transport mode choice datasets, which contain a large number of samples and variables. Finally, these results are compared with Multinomial Logit and other techniques currently relevant in the Machine Learning field.&lt;/p&gt;
&lt;!--
&lt;figure&gt;&lt;img src="main_slide.png"&gt;&lt;figcaption&gt;
&lt;h4&gt;image title&lt;/h4&gt;
&lt;/figcaption&gt;
&lt;/figure&gt;
--&gt;</description></item><item><title>A Unimodal Ordered Logit model for ranked choices</title><link>https://joseangelmartin.com/es/talk/2021-09-strc-2021/</link><pubDate>Sun, 12 Sep 2021 00:00:00 +0000</pubDate><guid>https://joseangelmartin.com/es/talk/2021-09-strc-2021/</guid><description>&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
&lt;p&gt;Ordinal scale responses capture qualitative user feedback which can be used to model individual choice preference, or are employed in traffic accident analysis to evaluate accident severity. We present a new choice model for ordinal scale responses in choice tasks that combines a Multinomial Logit model with a Poisson probability mass function. The Poisson distribution, which is suitable for modelling the occurrence of the number of events in a fixed time frame, independent of previous events, can be adapted into the unobserved error distribution of a standard MNL model to capture the natural ordering of the choices by imposing a unimodal constraint on the a posteriori choice probability. In this paper we describe the theoretical framework and the specification of the Unimodal Logit model. We apply our model to evaluate accident severity concerning road collisions. Our results are compared against the traditional ordered logit model and the MNL model.&lt;/p&gt;</description></item></channel></rss>