Examinando por Autor "Ortega, Felipe"

Mostrando 1 - 3 de 3

Actas de las Terceras Jornadas Nacionales de Investigación en Ciberseguridad
(Servicio de Publicaciones de la Universidad Rey Juan Carlos, 2017) Beltrán, Marta; Ortega, Felipe
Adapting support vector optimisation algorithms to textual gender classification
(Springer, 2024-04-13) Gómez, Javier; Alfaro, Cesar; Ortega, Felipe; Moguerza, Javier M.; Algar, Maria Jesus; Moreno, Raul
In this paper, we focus on the problem of determining the gender of the person described in a biographical text. Since support vector machine classifiers are well suited for text classification tasks, we present a new stopping criterion for support vector optimisation algorithms tailored to this problem. This new approach exploits the geometric properties of the vector representation of such content. An experiment on a set of English and Spanish biographical articles retrieved from Wikipedia illustrates this approach and compares it to other machine learning classification algorithms. The proposed method allows real-time classification algorithm training. Moreover, these results confirm the advantage of leveraging additional gender information in strongly inflected languages, like Spanish, for this task
Unconventional application of k-means for distributed approximate similarity search
(Elsevier, 2022) Ortega, Felipe; Algar, Maria Jesus; Martín de Diego, Isaac; Martínez Moguerza, Javier
Similarity search based on a distance function in metric spaces is a fundamental problem for many applications. Queries for similar objects lead to the well-known machine learning task of nearest-neighbours identification. Many data indexing strategies, collectively known as Metric Access Methods (MAM), have been proposed to speed up these queries. Moreover, since exact approaches to solving similarity queries can be complex and timeconsuming, alternative options have emerged to reduce query execution time, such as returning approximate results or resorting to distributed computing platforms. In this paper, we introduce MASK (Multilevel Approximate Similarity search with k-means), an unconventional application of the k-means algorithm as the foundation of a multilevel index structure for approximate similarity search suitable for metric spaces. We show that this method leverages inherent properties of k-means for this purpose, like representing high-density data areas with fewer prototypes. An implementation of this new indexing procedure is evaluated using a synthetic dataset and two real-world datasets in highdimensional and high-sparsity spaces. Experimental tests show that MASK performs better than alternative algorithms for approximate similarity search. Results are promising and underpin the applicability of this novel indexing method in multiple domains.