JOSE ANTONIO
LOZANO ALONSO
PROFESORADO CATEDRATICO/A DE UNIVERSIDAD
ARITZ
PEREZ MARTINEZ
Investigador/a en el periodo 2012-2014
Publicaciones en las que colabora con ARITZ PEREZ MARTINEZ (29)
2024
-
A probabilistic generative model to discover the treatments of coexisting diseases with missing data
Computer methods and programs in biomedicine, Vol. 243, pp. 107870
-
Fast K-Medoids With the l1-Norm
IEEE Transactions on Artificial Intelligence, Vol. 5, Núm. 4, pp. 1769-1777
2023
-
Fast computation of cluster validity measures for bregman divergences and benefits
Pattern Recognition Letters, Vol. 170, pp. 100-105
-
LASSO for streaming data with adaptative filtering
Statistics and Computing, Vol. 33, Núm. 1
-
Learning the progression patterns of treatments using a probabilistic generative model
Journal of Biomedical Informatics, Vol. 137
2022
-
An Efficient Split-Merge Re-Start for the K-Means Algorithm
IEEE Transactions on Knowledge and Data Engineering, Vol. 34, Núm. 4, pp. 1618-1627
-
An active adaptation strategy for streaming time series classification based on elastic similarity measures
Neural Computing and Applications, Vol. 34, Núm. 16, pp. 13237-13252
2021
-
A Cheap Feature Selection Approach for the K-Means Algorithm
IEEE Transactions on Neural Networks and Learning Systems, Vol. 32, Núm. 5, pp. 2195-2208
-
A machine learning approach to predict healthcare cost of breast cancer patients
Scientific Reports, Vol. 11, Núm. 1
2020
-
An efficient K-means clustering algorithm for tall data
Data Mining and Knowledge Discovery, Vol. 34, Núm. 3, pp. 776-811
-
Identifying common treatments from Electronic Health Records with missing information. An application to breast cancer
PLoS ONE, Vol. 15, Núm. 12 December
-
Robust image classification against adversarial attacks using elastic similarity measures between edge count sequences
Neural Networks, Vol. 128, pp. 61-72
2019
-
On-line Elastic Similarity Measures for time series
Pattern Recognition, Vol. 88, pp. 506-517
2018
-
Adversarial sample crafting for time series classification with elastic similarity measures
Studies in Computational Intelligence (Springer Verlag), pp. 26-39
-
Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models
Proceedings of Machine Learning Research
-
Are the Artificially Generated Instances Uniform in Terms of Difficulty?
2018 IEEE Congress on Evolutionary Computation, CEC 2018 - Proceedings
2017
-
An efficient approximation to the K-means clustering for massive data
Knowledge-Based Systems, Vol. 117, pp. 56-69
-
Nature-inspired approaches for distance metric learning in multivariate time series classification
2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
-
On-Line Dynamic Time Warping for Streaming Time Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2016
-
Efficient approximation of probability distributions with k-order decomposable models
International Journal of Approximate Reasoning, Vol. 74, pp. 58-87