Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Claudia Calabrese
Bo Liu
Hao Mao
Peter Malec
Portia E Taylor
Giovanni Venturelli
Tobias Müller
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ANDRÉS CANO
Author Info
Open Visualization
Name
Affiliation
Papers
ANDRÉS CANO
Univ Granada, CITIC UGR, Dept Comp Sci & Artificial Intelligence, E-18071 Granada, Spain
39
Collaborators
Citations
PageRank
25
193
20.06
Referers
Referees
References
273
329
408
Search Limit
100
329
Publications (39 rows)
Collaborators (25 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Value-Based Potentials: Exploiting Quantitative Information Regularity Patterns In Probabilistic Graphical Models
0
0.34
2021
Computation Of Kullback-Leibler Divergence In Bayesian Networks
0
0.34
2021
Mpe Computation In Bayesian Networks Using Mini-Bucket And Probability Trees Approximation
0
0.34
2020
A Bayesian approach to abrupt concept drift.
0
0.34
2019
Evaluating interval-valued influence diagrams.
4
0.47
2017
Estimating Conditional Probabilities by Mixtures of Low Order Conditional Distributions.
0
0.34
2017
Using Binary Trees For The Evaluation Of Influence Diagrams
1
0.36
2016
Improvements to Variable Elimination and Symbolic Probabilistic Inference for evaluating Influence Diagrams
0
0.34
2016
Variable Elimination for Interval-Valued Influence Diagrams.
1
0.37
2015
An Extended Approach to Learning Recursive Probability Trees from Data
0
0.34
2015
On SPI for Evaluating Influence Diagrams.
2
0.38
2014
Extended Probability Trees For Probabilistic Graphical Models
1
0.36
2014
On Spi-Lazy Evaluation Of Influence Diagrams
2
0.38
2014
Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees.
0
0.34
2013
Learning Recursive Probability Trees from Data.
1
0.38
2013
Inference In Bayesian Networks With Recursive Probability Trees: Data Structure Definition And Operations
3
0.46
2013
Fast Factorisation Of Probabilistic Potentials And Its Application To Approximate Inference In Bayesian Networks
3
0.43
2012
Learning recursive probability trees from probabilistic potentials
4
0.46
2012
Bayesian networks classifiers for gene-expression data.
2
0.35
2011
A method for integrating expert knowledge when learning Bayesian networks from data.
22
0.83
2011
A memory efficient semi-Naive Bayes classifier with grouping of cases
1
0.36
2011
Approximate inference in Bayesian networks using binary probability trees
9
0.52
2011
An importance sampling approach to integrate expert knowledge when learning Bayesian networks from data
3
0.43
2010
Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning
1
0.36
2010
Binary Probability Trees for Bayesian Networks Inference
0
0.34
2009
Recursive probability trees for Bayesian networks
7
0.55
2009
A Bayesian Random Split to Build Ensembles of Classification Trees
1
0.38
2009
Reasoning with imprecise probabilities
2
0.39
2007
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
13
0.70
2007
A forward-backward Monte Carlo method for solving influence diagrams
11
0.64
2006
Selective gaussian naïve bayes model for diffuse large-b-cell lymphoma classification: some improvements in preprocessing and variable elimination
1
0.35
2005
Methods to determine the branching attribute in bayesian multinets classifiers
5
0.41
2005
Applying Numerical Trees to Evaluate Asymmetric Decision Problems
5
0.58
2003
Strong Conditional Independence for Credal Sets
22
1.50
2002
Using probability trees to compute marginals with imprecise probabilities
30
1.61
2002
Lazy evaluation in penniless propagation over join trees
21
1.25
2002
Computing probability intervals with simulated annealing and probability trees
4
0.45
2002
Computing Intervals of Probabilities with Simulated Annealing and Probability Trees
0
0.34
2001
A Review of Propagation Algorithms for Imprecise Probabilities
11
0.98
1999
1