default search action
Carlos Eiras-Franco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Miguel Escarda
, Carlos Eiras-Franco, Brais Cancela
Performance and sustainability of BERT derivatives in dyadic data. Expert Syst. Appl. 262: 125647 (2025) - [j9]Mariano Garralda-Barrio
Adaptive incremental transfer learning for efficient performance modeling of big data workloads. Future Gener. Comput. Syst. 166: 107730 (2025) - [i4]Carlos Eiras-Franco, Anna Hedström, Marina M.-C. Höhne:
Evaluate with the Inverse: Efficient Approximation of Latent Explanation Quality Distribution. CoRR abs/2502.15403 (2025) - 2024
- [j8]Jorge Paz-Ruza
Sustainable transparency on recommender systems: Bayesian ranking of images for explainability. Inf. Fusion 111: 102497 (2024) - [j7]Mariano Garralda-Barrio
A novel framework for generic Spark workload characterization and similar pattern recognition using machine learning. J. Parallel Distributed Comput. 189: 104881 (2024) - [i3]Jorge Paz-Ruza
Beyond RMSE and MAE: Introducing EAUC to unmask hidden bias and unfairness in dyadic regression models. CoRR abs/2401.10690 (2024) - 2023
- [i2]Jorge Paz-Ruza
Sustainable Transparency in Recommender Systems: Bayesian Ranking of Images for Explainability. CoRR abs/2308.01196 (2023) - 2022
- [j6]Jorge Meira
Fast anomaly detection with locality-sensitive hashing and hyperparameter autotuning. Inf. Sci. 607: 1245-1264 (2022) - [c3]Jorge Paz-Ruza
Sustainable Personalisation and Explainability in Dyadic Data Systems. KES 2022: 1017-1026 - [i1]Iñigo López-Riobóo Botana
Explanation Method for Anomaly Detection on Mixed Numerical and Categorical Spaces. CoRR abs/2209.04173 (2022) - 2021
- [j5]Carlos Eiras-Franco
Scalable feature selection using ReliefF aided by locality-sensitive hashing. Int. J. Intell. Syst. 36(11): 6161-6179 (2021) - 2020
- [j4]Carlos Eiras-Franco
Fast Distributed kNN Graph Construction Using Auto-tuned Locality-sensitive Hashing. ACM Trans. Intell. Syst. Technol. 11(6): 71:1-71:18 (2020)
2010 – 2019
- 2019
- [j3]Carlos Eiras-Franco
A scalable decision-tree-based method to explain interactions in dyadic data. Decis. Support Syst. 127 (2019) - [j2]Carlos Eiras-Franco
Large scale anomaly detection in mixed numerical and categorical input spaces. Inf. Sci. 487: 115-127 (2019) - [c2]Carlos Eiras-Franco, Miguel Flores, Verónica Bolón-Canedo, Sonia Zaragoza
Case Study of Anomaly Detection and Quality Control of Energy Efficiency and Hygrothermal Comfort in Buildings. DATA 2019: 145-151 - 2017
- [c1]Carlos Eiras-Franco, Leslie Kanthan, Amparo Alonso-Betanzos, David Martínez-Rego:
Scalable approximate k-NN Graph construction based on Locality Sensitive Hashing. ESANN 2017 - 2016
- [j1]Carlos Eiras-Franco
Multithreaded and Spark parallelization of feature selection filters. J. Comput. Sci. 17: 609-619 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-21 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: