The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrés Cano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  19. Recursive Probability Trees for Bayesian Networks. [Citation Graph (, )][DBLP]


  20. A Bayesian Random Split to Build Ensembles of Classification Trees. [Citation Graph (, )][DBLP]


  21. Binary Probability Trees for Bayesian Networks Inference. [Citation Graph (, )][DBLP]


  22. An Importance Sampling Approach to Integrate Expert Knowledge When Learning Bayesian Networks From Data. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002