Andrés Cano - RankMe

56 papers C 14Journal 28Unranked 13

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Imprecise probabilistic models based on hierarchical intervals. Inf. Sci. Serafín Moral, Andrés Cano, Manuel Gómez-Olmedo
2023	J	`jnl`	The Twelfth International Symposium on Imprecise Probabilities: Theories and Applications (ISIPTA-21). Int. J. Approx. Reason. Andrés Cano, Jasper De Bock, Enrique Miranda
2021	J	`jnl`	Computation of Kullback-Leibler Divergence in Bayesian Networks. Entropy Serafín Moral, Andrés Cano, Manuel Gómez-Olmedo
2021	—	`ed.`	International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2021, 6-9 July 2021, University of Granada, Granada, Spain. ISIPTA Andrés Cano, Jasper De Bock, Enrique Miranda, Serafín Moral
2021	J	`jnl`	Value-based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models. Int. J. Intell. Syst. Manuel Gómez-Olmedo, Rafael Cabañas, Andrés Cano, Serafín Moral, Ofelia P. Retamero
2020	—	`conf`	Learning Sets of Bayesian Networks. IPMU (2) Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2020	J	`jnl`	MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation. Int. J. Uncertain. Fuzziness Knowl. Based Syst. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Serafín Moral-García
2019	J	`jnl`	A Bayesian approach to abrupt concept drift. Knowl. Based Syst. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2018	—	`conf`	Virtual Subconcept Drift Detection in Discrete Data Using Probabilistic Graphical Models. IPMU (3) Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral
2017	—	`conf`	Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions. SUM Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2017	J	`jnl`	Evaluating interval-valued influence diagrams. Int. J. Approx. Reason. Rafael Cabañas, Alessandro Antonucci, Andrés Cano, Manuel Gómez-Olmedo
2016	J	`jnl`	Improvements to Variable Elimination and Symbolic Probabilistic Inference for evaluating Influence Diagrams. Int. J. Approx. Reason. Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen
2016	J	`jnl`	Using Binary Trees for the Evaluation of Influence Diagrams. Int. J. Uncertain. Fuzziness Knowl. Based Syst. Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano
2015	J	`jnl`	An Extended Approach to Learning Recursive Probability Trees from Data. Int. J. Intell. Syst. Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza
2015	C	`conf`	Variable Elimination for Interval-Valued Influence Diagrams. ECSQARU Rafael Cabañas, Alessandro Antonucci, Andrés Cano, Manuel Gómez-Olmedo
2014	—	`conf`	Extended Probability Trees for Probabilistic Graphical Models. Probabilistic Graphical Models Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza
2014	—	`conf`	On SPI for Evaluating Influence Diagrams. IPMU (1) Rafael Cabañas, Anders L. Madsen, Andrés Cano, Manuel Gómez-Olmedo
2014	—	`conf`	On SPI-Lazy Evaluation of Influence Diagrams. Probabilistic Graphical Models Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen
2014	J	`jnl`	Special Issue on PGM-2012. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Thomas Dyhre Nielsen
2013	—	`conf`	Approximate Lazy Evaluation of Influence Diagrams. CAEPIA Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen
2013	C	`conf`	Evaluating Asymmetric Decision Problems with Binary Constraint Trees. ECSQARU Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano
2013	—	`conf`	Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees. SCAI Rafael Cabañas, Andrés Cano, Manuel Gómez-Olmedo, Anders L. Madsen
2013	J	`jnl`	Inference in Bayesian Networks with Recursive Probability Trees: Data Structure Definition and Operations. Int. J. Intell. Syst. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza, Antonio Salmerón
2013	—	`conf`	Learning Recursive Probability Trees from Data. CAEPIA Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora Beatriz Pérez-Ariza, Antonio Salmerón
2013	J	`jnl`	Locally averaged Bayesian Dirichlet metrics for learning the structure and the parameters of Bayesian networks. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral
2012	J	`jnl`	Fast Factorisation of Probabilistic Potentials and its Application to Approximate Inference in Bayesian Networks. Int. J. Uncertain. Fuzziness Knowl. Based Syst. Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón
2012	J	`jnl`	Learning recursive probability trees from probabilistic potentials. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza, Antonio Salmerón
2011	J	`jnl`	A Method for Integrating Expert Knowledge When Learning Bayesian Networks From Data. IEEE Trans. Syst. Man Cybern. Part B Andrés Cano, Andrés R. Masegosa, Serafín Moral
2011	J	`jnl`	A memory efficient semi-Naive Bayes classifier with grouping of cases. Intell. Data Anal. Joaquín Abellán, Andrés Cano, Andrés R. Masegosa, Serafín Moral
2011	J	`jnl`	Approximate inference in Bayesian networks using binary probability trees. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2011	C	`conf`	Bayesian networks classifiers for gene-expression data. ISDA Luis M. de Campos, Andrés Cano, Javier G. Castellano, Serafín Moral
2011	C	`conf`	Learning with Bayesian networks and probability trees to approximate a joint distribution. ISDA Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral
2011	C	`conf`	Locally Averaged Bayesian Dirichlet Metrics. ECSQARU Andrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral
2010	C	`conf`	An Importance Sampling Approach to Integrate Expert Knowledge When Learning Bayesian Networks From Data. IPMU Andrés Cano, Andrés R. Masegosa, Serafín Moral
2010	—	`conf`	Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning. SMPS Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón
2009	C	`conf`	A Bayesian Random Split to Build Ensembles of Classification Trees. ECSQARU Andrés Cano, Andrés R. Masegosa, Serafín Moral
2009	C	`conf`	Binary Probability Trees for Bayesian Networks Inference. ECSQARU Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2009	—	`conf`	Recursive Probability Trees for Bayesian Networks. CAEPIA Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Cora B. Pérez-Ariza
2007	C	`conf`	A Semi-naive Bayes Classifier with Grouping of Cases. ECSQARU Joaquín Abellán, Andrés Cano, Andrés R. Masegosa, Serafín Moral
2007	J	`jnl`	Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral, Joaquín Abellán
2007	J	`jnl`	Reasoning with imprecise probabilities. Int. J. Approx. Reason. Andrés Cano, Fábio Gagliardi Cozman, Thomas Lukasiewicz
2006	J	`jnl`	A forward-backward Monte Carlo method for solving influence diagrams. Int. J. Approx. Reason. Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2005	—	`conf`	Application of a hill-climbing algorithm to exact and approximate inference in credal networks. ISIPTA Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral
2005	C	`conf`	Methods to Determine the Branching Attribute in Bayesian Multinets Classifiers. ECSQARU Andrés Cano, Francisco Javier García Castellano, Andrés R. Masegosa, Serafín Moral
2005	C	`conf`	Selective Gaussian Naïve Bayes Model for Diffuse Large-B-Cell Lymphoma Classification: Some Improvements in Preprocessing and Variable Elimination. ECSQARU Andrés Cano, Francisco Javier García Castellano, Andrés R. Masegosa, Serafín Moral
2003	C	`conf`	Applying Numerical Trees to Evaluate Asymmetric Decision Problems. ECSQARU Manuel Gómez-Olmedo, Andrés Cano
2003	J	`jnl`	Novel strategies to approximate probability trees in penniless propagation. Int. J. Intell. Syst. Andrés Cano, Serafín Moral, Antonio Salmerón
2002	J	`jnl`	Computing probability intervals with simulated annealing and probability trees. J. Appl. Non Class. Logics Andrés Cano, Juan M. Fernández-Luna, Serafín Moral
2002	J	`jnl`	Different strategies to approximate probability trees in penniless propagation. Inteligencia Artif. Andrés Cano, Serafín Moral, Antonio Salmerón
2002	J	`jnl`	Lazy evaluation in penniless propagation over join trees. Networks Andrés Cano, Serafín Moral, Antonio Salmerón
2002	J	`jnl`	Strong Conditional Independence for Credal Sets. Ann. Math. Artif. Intell. Serafín Moral, Andrés Cano
2002	J	`jnl`	Using probability trees to compute marginals with imprecise probabilities. Int. J. Approx. Reason. Andrés Cano, Serafín Moral
2001	C	`conf`	Computing Intervals of Probabilities with Simulated Annealing and Probability Trees. ECSQARU Andrés Cano, Serafín Moral
2000	J	`jnl`	Penniless propagation in join trees. Int. J. Intell. Syst. Andrés Cano, Serafín Moral, Antonio Salmerón
1999	—	`conf`	A Review of Propagation Algorithms for Imprecise Probabilities. ISIPTA Andrés Cano, Serafín Moral
1994	C	`conf`	Heuristic Algorithms for the Triangulation of Graphs. IPMU Andrés Cano, Serafín Moral