default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael Cabañas 0001
Person information
- affiliation: University of Almería, Spain
- affiliation (2019 - 2021): Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Manno-Lugano, Switzerland
- affiliation (PhD 2017): University of Granada,Department of Computer Science and Artificial Intelligence CITIC, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Marco Zaffalon, Alessandro Antonucci
, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient computation of counterfactual bounds. Int. J. Approx. Reason. 171: 109111 (2024)- [i12]Rafael Cabañas, Ana D. Maldonado, María Morales, Pedro Aguilera Aguilera, Antonio Salmerón:
Counterfactual Reasoning with Probabilistic Graphical Models for Analyzing Socioecological Systems. CoRR abs/2401.10101 (2024) - 2023
- [j9]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber:
Approximating counterfactual bounds while fusing observational, biased and randomised data sources. Int. J. Approx. Reason. 162: 109023 (2023) - [i11]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Efficient Computation of Counterfactual Bounds. CoRR abs/2307.08304 (2023) - [i10]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber:
Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sources. CoRR abs/2307.16577 (2023) - 2022
- [c15]Luis A. Ortega, Rafael Cabañas, Andrés R. Masegosa:
Diversity and Generalization in Neural Network Ensembles. AISTATS 2022: 11720-11743 - [c14]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. PGM 2022: 289-300 - [i9]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti:
Bounding Counterfactuals under Selection Bias. CoRR abs/2208.01417 (2022) - [i8]Marco Zaffalon, Alessandro Antonucci, David Huber, Rafael Cabañas:
Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data. CoRR abs/2212.02932 (2022) - 2021
- [j8]Andrés R. Masegosa, Rafael Cabañas, Helge Langseth, Thomas D. Nielsen, Antonio Salmerón:
Probabilistic Models with Deep Neural Networks. Entropy 23(1): 117 (2021) - [j7]Manuel Gómez-Olmedo, Rafael Cabañas, Andrés Cano, Serafín Moral, Ofelia P. Retamero:
Value-based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models. Int. J. Intell. Syst. 36(11): 6913-6943 (2021) - [c13]Rafael Cabañas, Alessandro Antonucci:
CREPO: An Open Repository to Benchmark Credal Network Algorithms. ISIPTA 2021: 352-356 - [i7]Rafael Cabañas, Alessandro Antonucci:
CREPO: An Open Repository to Benchmark Credal Network Algorithms. CoRR abs/2105.04158 (2021) - [i6]Luis A. Ortega, Rafael Cabañas, Andrés R. Masegosa:
Diversity and Generalization in Neural Network Ensembles. CoRR abs/2110.13786 (2021) - 2020
- [j6]Javier Cózar, Rafael Cabañas, Antonio Salmerón, Andrés R. Masegosa:
InferPy: Probabilistic modeling with deep neural networks made easy. Neurocomputing 415: 408-410 (2020) - [c12]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
Structural Causal Models Are (Solvable by) Credal Networks. PGM 2020: 581-592 - [c11]Rafael Cabañas, Alessandro Antonucci, David Huber, Marco Zaffalon:
CREDICI: A Java Library for Causal Inference by Credal Networks. PGM 2020: 597-600 - [c10]Rafael Cabañas, Javier Cózar, Antonio Salmerón, Andrés R. Masegosa:
Probabilistic Graphical Models with Neural Networks in InferPy. PGM 2020: 601-604 - [c9]David Huber, Rafael Cabañas, Alessandro Antonucci, Marco Zaffalon:
CREMA: A Java Library for Credal Network Inference. PGM 2020: 613-616 - [i5]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
Structural Causal Models Are (Solvable by) Credal Networks. CoRR abs/2008.00463 (2020) - [i4]Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas:
EM Based Bounding of Unidentifiable Queries in Structural Causal Models. CoRR abs/2011.02912 (2020)
2010 – 2019
- 2019
- [j5]Andrés R. Masegosa, Ana M. Martínez, Darío Ramos-López, Rafael Cabañas, Antonio Salmerón, Helge Langseth, Thomas D. Nielsen, Anders L. Madsen:
AMIDST: A Java toolbox for scalable probabilistic machine learning. Knowl. Based Syst. 163: 595-597 (2019) - [j4]Rafael Cabañas, Antonio Salmerón, Andrés R. Masegosa:
InferPy: Probabilistic modeling with Tensorflow made easy. Knowl. Based Syst. 168: 25-27 (2019) - [i3]Andrés R. Masegosa, Rafael Cabañas, Helge Langseth, Thomas D. Nielsen, Antonio Salmerón:
Probabilistic Models with Deep Neural Networks. CoRR abs/1908.03442 (2019) - [i2]Javier Cózar, Rafael Cabañas, Andrés R. Masegosa, Antonio Salmerón:
InferPy: Probabilistic Modeling with Deep Neural Networks Made Easy. CoRR abs/1908.11161 (2019) - 2018
- [c8]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral:
Virtual Subconcept Drift Detection in Discrete Data Using Probabilistic Graphical Models. IPMU (3) 2018: 616-628 - 2017
- [j3]Rafael Cabañas, Alessandro Antonucci, Andrés Cano, Manuel Gómez-Olmedo:
Evaluating interval-valued influence diagrams. Int. J. Approx. Reason. 80: 393-411 (2017) - [i1]Andrés R. Masegosa, Ana M. Martínez, Darío Ramos-López, Rafael Cabañas, Antonio Salmerón, Thomas D. Nielsen, Helge Langseth, Anders L. Madsen:
AMIDST: a Java Toolbox for Scalable Probabilistic Machine Learning. CoRR abs/1704.01427 (2017) - 2016
- [j2]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen:
Improvements to Variable Elimination and Symbolic Probabilistic Inference for evaluating Influence Diagrams. Int. J. Approx. Reason. 70: 13-35 (2016) - [j1]Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano:
Using Binary Trees for the Evaluation of Influence Diagrams. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 24(1): 59-90 (2016) - [c7]Rafael Cabañas, Ana M. Martínez, Andrés R. Masegosa, Darío Ramos-López, Antonio Salmerón, Thomas D. Nielsen, Helge Langseth, Anders L. Madsen:
Financial Data Analysis with PGMs Using AMIDST. ICDM Workshops 2016: 1284-1287 - 2015
- [c6]Rafael Cabañas, Alessandro Antonucci, Andrés Cano, Manuel Gómez-Olmedo:
Variable Elimination for Interval-Valued Influence Diagrams. ECSQARU 2015: 541-551 - 2014
- [c5]Rafael Cabañas, Anders L. Madsen, Andrés Cano, Manuel Gómez-Olmedo:
On SPI for Evaluating Influence Diagrams. IPMU (1) 2014: 506-516 - [c4]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen:
On SPI-Lazy Evaluation of Influence Diagrams. Probabilistic Graphical Models 2014: 97-112 - 2013
- [c3]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen:
Approximate Lazy Evaluation of Influence Diagrams. CAEPIA 2013: 321-331 - [c2]Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano:
Evaluating Asymmetric Decision Problems with Binary Constraint Trees. ECSQARU 2013: 85-96 - [c1]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen:
Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees. SCAI 2013: 65-74
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 2024-09-04 00:30 CEST 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:
