default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Gómez-Olmedo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Serafín Moral
, Andrés Cano, Manuel Gómez-Olmedo:
Imprecise probabilistic models based on hierarchical intervals. Inf. Sci. 638: 118995 (2023)- 2021
- [j19]Serafín Moral, Andrés Cano, Manuel Gómez-Olmedo:
Computation of Kullback-Leibler Divergence in Bayesian Networks. Entropy 23(9): 1122 (2021) - [j18]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) - 2020
- [j17]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Serafín Moral-García:
MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 28(5): 785-805 (2020) - [c22]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
Learning Sets of Bayesian Networks. IPMU (2) 2020: 151-164
2010 – 2019
- 2019
- [j16]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
A Bayesian approach to abrupt concept drift. Knowl. Based Syst. 185 (2019) - 2018
- [c21]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
- [j15]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) - [c20]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions. SUM 2017: 107-118 - 2016
- [j14]José M. Peña, Manuel Gómez-Olmedo:
Learning marginal AMP chain graphs under faithfulness revisited. Int. J. Approx. Reason. 68: 108-126 (2016) - [j13]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) - [j12]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) - 2015
- [j11]Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza:
An Extended Approach to Learning Recursive Probability Trees from Data. Int. J. Intell. Syst. 30(3): 355-383 (2015) - [j10]Dag Sonntag, José M. Peña, Manuel Gómez-Olmedo:
Approximate Counting of Graphical Models via MCMC Revisited. Int. J. Intell. Syst. 30(3): 384-420 (2015) - [c19]Rafael Cabañas, Alessandro Antonucci, Andrés Cano, Manuel Gómez-Olmedo:
Variable Elimination for Interval-Valued Influence Diagrams. ECSQARU 2015: 541-551 - 2014
- [j9]Andrés Cano, Manuel Gómez-Olmedo, Thomas Dyhre Nielsen:
Special Issue on PGM-2012. Int. J. Approx. Reason. 55(4): 925 (2014) - [c18]Rafael Cabañas, Anders L. Madsen, Andrés Cano, Manuel Gómez-Olmedo:
On SPI for Evaluating Influence Diagrams. IPMU (1) 2014: 506-516 - [c17]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 - [c16]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza:
Extended Probability Trees for Probabilistic Graphical Models. Probabilistic Graphical Models 2014: 113-128 - 2013
- [j8]Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral:
Locally averaged Bayesian Dirichlet metrics for learning the structure and the parameters of Bayesian networks. Int. J. Approx. Reason. 54(4): 526-540 (2013) - [j7]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza, Antonio Salmerón:
Inference in Bayesian Networks with Recursive Probability Trees: Data Structure Definition and Operations. Int. J. Intell. Syst. 28(7): 623-647 (2013) - [c15]Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen:
Approximate Lazy Evaluation of Influence Diagrams. CAEPIA 2013: 321-331 - [c14]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora Beatriz Pérez-Ariza, Antonio Salmerón:
Learning Recursive Probability Trees from Data. CAEPIA 2013: 332-341 - [c13]Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano:
Evaluating Asymmetric Decision Problems with Binary Constraint Trees. ECSQARU 2013: 85-96 - [c12]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 - 2012
- [j6]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza, Antonio Salmerón:
Learning recursive probability trees from probabilistic potentials. Int. J. Approx. Reason. 53(9): 1367-1387 (2012) - [j5]Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón:
Fast Factorisation of Probabilistic Potentials and its Application to Approximate Inference in Bayesian Networks. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 20(2): 223-243 (2012) - 2011
- [j4]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
Approximate inference in Bayesian networks using binary probability trees. Int. J. Approx. Reason. 52(1): 49-62 (2011) - [c11]Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral:
Locally Averaged Bayesian Dirichlet Metrics. ECSQARU 2011: 217-228 - [c10]Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral:
Learning with Bayesian networks and probability trees to approximate a joint distribution. ISDA 2011: 624-629 - 2010
- [c9]Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón:
Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning. SMPS 2010: 65-72
2000 – 2009
- 2009
- [c8]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza:
Recursive Probability Trees for Bayesian Networks. CAEPIA 2009: 242-251 - [c7]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
Binary Probability Trees for Bayesian Networks Inference. ECSQARU 2009: 180-191 - 2008
- [c6]Juan M. Fernández-Luna, Juan F. Huete, Manuel Gómez-Olmedo, Carlos J. Martín-Dancausa:
Development of the XML Digital Library from the Parliament of Andalucía for Intelligent Structured Retrieval. ISMIS 2008: 417-423 - 2007
- [j3]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Joaquín Abellán:
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. Int. J. Approx. Reason. 44(3): 261-280 (2007) - 2006
- [j2]Joaquín Abellán, Manuel Gómez-Olmedo:
Measures of divergence on credal sets. Fuzzy Sets Syst. 157(11): 1514-1531 (2006) - [j1]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
A forward-backward Monte Carlo method for solving influence diagrams. Int. J. Approx. Reason. 42(1-2): 119-135 (2006) - [c5]Joaquín Abellán, Manuel Gómez-Olmedo, Serafín Moral:
Some Variations on the PC Algorithm. Probabilistic Graphical Models 2006: 1-8 - [c4]Joaquín Abellán, Serafín Moral, Manuel Gómez-Olmedo, Andrés R. Masegosa:
Varying Parameter in Classification Based on Imprecise Probabilities. SMPS 2006: 231-239 - 2005
- [c3]Luis M. de Campos, Juan M. Fernández-Luna, Manuel Gómez-Olmedo, Juan F. Huete:
A Decision-Based Approach for Recommending in Hierarchical Domains. ECSQARU 2005: 123-135 - [c2]Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral:
Application of a hill-climbing algorithm to exact and approximate inference in credal networks. ISIPTA 2005: 88-97 - 2003
- [c1]Manuel Gómez-Olmedo, Andrés Cano:
Applying Numerical Trees to Evaluate Asymmetric Decision Problems. ECSQARU 2003: 196-207
Coauthor Index
aka: Serafín Moral-García
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-08-05 20:16 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:
