Andrés Cano

	2009
20		Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral: Binary Probability Trees for Bayesian Networks Inference. ECSQARU 2009: 180-191
19		Andrés Cano, Andrés R. Masegosa, Serafín Moral: A Bayesian Random Split to Build Ensembles of Classification Trees. ECSQARU 2009: 469-480
	2007
18		Joaquín Abellán, Andrés Cano, Andrés R. Masegosa, Serafín Moral: A Semi-naive Bayes Classifier with Grouping of Cases. ECSQARU 2007: 477-488
17		Andrés Cano, Fabio Gagliardi Cozman, Thomas Lukasiewicz: Reasoning with imprecise probabilities. Int. J. Approx. Reasoning 44(3): 197-199 (2007)
16		Andrés Cano, Manuel Gómez, 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. Reasoning 44(3): 261-280 (2007)
	2006
15		Andrés Cano, Manuel Gómez, Serafín Moral: A forward-backward Monte Carlo method for solving influence diagrams. Int. J. Approx. Reasoning 42(1-2): 119-135 (2006)
	2005
14		Andrés Cano, Javier Gomez Castellano, Andrés R. Masegosa, Serafín Moral: Selective Gaussian Naïve Bayes Model for Diffuse Large-B-Cell Lymphoma Classification: Some Improvements in Preprocessing and Variable Elimination. ECSQARU 2005: 908-920
13		Andrés Cano, Javier Gomez Castellano, Andrés R. Masegosa, Serafín Moral: Methods to Determine the Branching Attribute in Bayesian Multinets Classifiers. ECSQARU 2005: 932-943
12		Andrés Cano, Manuel Gómez, Serafín Moral: Application of a hill-climbing algorithm to exact and approximate inference in credal networks. ISIPTA 2005: 88-97
	2003
11		Manuel Gómez, Andrés Cano: Applying Numerical Trees to Evaluate Asymmetric Decision Problems. ECSQARU 2003: 196-207
10		Andrés Cano, Serafín Moral, Antonio Salmerón: Novel strategies to approximate probability trees in penniless propagation. Int. J. Intell. Syst. 18(2): 193-203 (2003)
	2002
9		Serafín Moral, Andrés Cano: Strong Conditional Independence for Credal Sets. Ann. Math. Artif. Intell. 35(1-4): 295-321 (2002)
8		Andrés Cano, Serafín Moral: Using probability trees to compute marginals with imprecise probabilities. Int. J. Approx. Reasoning 29(1): 1-46 (2002)
7		Andrés Cano, Serafín Moral, Antonio Salmerón: Different strategies to approximate probability trees in penniless propagation. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 15: (2002)
6		Andrés Cano, Juan M. Fernández-Luna, Serafín Moral: Computing probability intervals with simulated annealing and probability trees. Journal of Applied Non-Classical Logics 12(2): 151-171 (2002)
5		Andrés Cano, Serafín Moral, Antonio Salmerón: Lazy evaluation in penniless propagation over join trees. Networks 39(4): 175-185 (2002)
	2001
4		Andrés Cano, Serafín Moral: Computing Intervals of Probabilities with Simulated Annealing and Probability Trees. ECSQARU 2001: 278-289
	2000
3		Andrés Cano, Serafín Moral, Antonio Salmerón: Penniless propagation in join trees. Int. J. Intell. Syst. 15(11): 1027-1059 (2000)
	1999
2		Andrés Cano, Serafín Moral: A Review of Propagation Algorithms for Imprecise Probabilities. ISIPTA 1999: 51-60
	1994
1		Andrés Cano, Serafín Moral: Heuristic Algorithms for the Triangulation of Graphs. IPMU 1994: 98-107

Coauthor Index

1	Joaquín Abellán	[16] [18]
2	Javier Gomez Castellano	[13] [14]
3	Fabio Gagliardi Cozman	[17]
4	Juan M. Fernández-Luna	[6]
5	Manuel Gómez	[11] [12] [15] [16]
6	Manuel Gómez-Olmedo	[20]
7	Thomas Lukasiewicz	[17]
8	Andrés R. Masegosa	[13] [14] [18] [19]
9	Serafín Moral	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [13] [14] [15] [16] [18] [19] [20]
10	Antonio Salmerón	[3] [5] [7] [10]