The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Serafín Moral: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Serafín Moral, Nic Wilson
    Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:269-274 [Conf]
  2. Nic Wilson, Serafín Moral
    A Logical View of Probability. [Citation Graph (0, 0)][DBLP]
    ECAI, 1994, pp:386-390 [Conf]
  3. Nic Wilson, Serafín Moral
    Fast Markov Chain Algorithms for Calculating Dempster-Shafer Belief. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:672-678 [Conf]
  4. 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]
  5. 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]
  6. José E. Cano, Miguel Delgado, Serafín Moral
    Propagation of Uncertainty in Dependence Graphs. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 1991, pp:42-47 [Conf]
  7. 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]
  8. M. Julia Flores, José A. Gámez, Serafín Moral
    Abductive Inference in Bayesian Networks: Finding a Partition of the Explanation Space. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2005, pp:63-75 [Conf]
  9. Irene Martínez, Serafín Moral, Carmelo Rodríguez, Antonio Salmerón
    Approximate Factorisation of Probability Trees. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2005, pp:51-62 [Conf]
  10. Serafín Moral
    Imprecise Probability in Graphical Models: Achievements and Challenges. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2005, pp:1-2 [Conf]
  11. Serafín Moral
    A Formal Language for Convex Sets of Probabilities. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 1993, pp:274-281 [Conf]
  12. Serafín Moral, Rafael Rumí, Antonio Salmerón
    Mixtures of Truncated Exponentials in Hybrid Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2001, pp:156-167 [Conf]
  13. Serafín Moral, Rafael Rumí, Antonio Salmerón
    Approximating Conditional MTE Distributions by Means of Mixed Trees. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2003, pp:173-183 [Conf]
  14. Serafín Moral, Antonio Salmerón
    Dynamic Importance Sampling Computation in Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2003, pp:137-148 [Conf]
  15. Serafín Moral, Antonio Salmerón
    A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation. [Citation Graph (0, 0)][DBLP]
    ESCQARU, 1999, pp:305-315 [Conf]
  16. Antonio Salmerón, Serafín Moral
    Importance Sampling in Bayesian Networks Using Antithetic Variables. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2001, pp:168-179 [Conf]
  17. Luis M. de Campos, José A. Gámez, Serafín Moral
    Partial Abductive Inference in Bayesian Networks By Using Probability Trees. [Citation Graph (0, 0)][DBLP]
    ICEIS (2), 2003, pp:83-91 [Conf]
  18. Luis M. de Campos, Juan F. Huete, Serafín Moral
    Uncertainty Management Using Probability Intervals. [Citation Graph (0, 0)][DBLP]
    IPMU, 1994, pp:190-199 [Conf]
  19. Andrés Cano, Serafín Moral
    Heuristic Algorithms for the Triangulation of Graphs. [Citation Graph (0, 0)][DBLP]
    IPMU, 1994, pp:98-107 [Conf]
  20. Serafín Moral, Luis M. de Campos
    Updating Uncertain Information. [Citation Graph (0, 0)][DBLP]
    IPMU, 1990, pp:58-67 [Conf]
  21. Joaquín Abellán, Serafín Moral
    Building classification trees using the total uncertainty criterion. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 2001, pp:1-8 [Conf]
  22. Joaquín Abellán, Serafín Moral
    Maximum of Entropy in Credal Classification. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 2003, pp:1-15 [Conf]
  23. Joaquín Abellán, Serafín Moral
    New Score for Independence Based on the Imprecise Dirichlet Model. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 2005, pp:1-10 [Conf]
  24. Joaquín Abellán, Serafín Moral
    A Non-specificity Measure for Convex Sets of Probability Distributions. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 1999, pp:1-7 [Conf]
  25. 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]
  26. 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]
  27. Serafín Moral
    Epistemic Irrelevance on Sets of Desirable Gambles. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 2001, pp:247-254 [Conf]
  28. Inés Couso, Serafín Moral, Peter Walley
    Examples of Independence for Imprecise Probabilities. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 1999, pp:121-130 [Conf]
  29. Luis M. de Campos, M. Teresa Lamata, Serafín Moral
    Logical Connectives for Combining Fuzzy Measures. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:11-18 [Conf]
  30. Irene Martínez, Serafín Moral, Carmelo Rodríguez, Antonio Salmerón
    Factorisation of Probability Trees and its Application to Inference in Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    Probabilistic Graphical Models, 2002, pp:- [Conf]
  31. Serafín Moral, Rafael Rumí, Antonio Salmerón
    Estimating Mixtures of Truncated Exponentials from Data. [Citation Graph (0, 0)][DBLP]
    Probabilistic Graphical Models, 2002, pp:- [Conf]
  32. Luis M. de Campos, Serafín Moral
    Independence Concepts for Convex Sets of Probabilities. [Citation Graph (0, 0)][DBLP]
    UAI, 1995, pp:108-115 [Conf]
  33. José E. Cano, Serafín Moral, Juan F. Verdegay-López
    Combination of Upper and Lower Probabilities. [Citation Graph (0, 0)][DBLP]
    UAI, 1991, pp:61-68 [Conf]
  34. Luis D. Hernández, Serafín Moral
    Inference with Idempotent Valuations. [Citation Graph (0, 0)][DBLP]
    UAI, 1997, pp:229-237 [Conf]
  35. Serafín Moral
    Calculating Uncertainty Intervals from Conditional Convex Sets of Probabilities. [Citation Graph (0, 0)][DBLP]
    UAI, 1992, pp:199-206 [Conf]
  36. Serafín Moral, Luis M. de Campos
    Partially Specified Belief Functions. [Citation Graph (0, 0)][DBLP]
    UAI, 1993, pp:492-499 [Conf]
  37. 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]
  38. Philippe Besnard, Yves Moinard, Wilmer Pereira, Michael Clarke, Nic Wilson, Miguel Delgado, Serafín Moral, Juan Cano, Didier Dubois, Henri Prade, Luis Fariñas del Cerro, Jérôme Lang, Stéphane Amarger, John Fox, Paul Krause, Michael Dohnal, Christine Froidevaux, Jérôme Mengin, Ramon López de Mántaras, Lluis Godo, E. H. Mamdani, John Bigham, Simon Parsons, Rudolf Kruse, Olivier Paillet, Pierre Siegel, Philippe Smets, Yen-Teh Hsia, Alessandro Saffiotti, Robert Kennes, Hong Xu, Elizabeth Umkehrer, Kurt Sundermeyer, Chris Whitney
    DRUMS: Defeasible Reasoning and Uncertainty Management Systems. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1993, v:6, n:1, pp:27-46 [Journal]
  39. Serafín Moral
    Epistemic irrelevance on sets of desirable gambles. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:45, n:1-2, pp:197-214 [Journal]
  40. 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]
  41. Serafín Moral
    Comments on 'a behavioural model for vague probability assessments' (G. de Cooman). [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2005, v:154, n:3, pp:359-363 [Journal]
  42. Joaquín Abellán, Serafín Moral
    Upper entropy of credal sets. Applications to credal classification. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2005, v:39, n:2-3, pp:235-255 [Journal]
  43. Luis M. de Campos, José A. Gámez, Serafín Moral
    Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2001, v:27, n:2, pp:121-142 [Journal]
  44. Luis M. de Campos, José A. Gámez, Serafín Moral
    Partial abductive inference in Bayesian belief networks by simulated annealing. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2001, v:27, n:3, pp:263-283 [Journal]
  45. José E. Cano, Miguel Delgado, Serafín Moral
    An axiomatic framework for propagating uncertainty in directed acyclic networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 1993, v:8, n:4, pp:253-280 [Journal]
  46. 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]
  47. José E. Cano, Luis D. Hernández, Serafín Moral
    Importance sampling algorithms for the propagation of probabilities in belief networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 1996, v:15, n:1, pp:77-92 [Journal]
  48. 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]
  49. Fabio Gagliardi Cozman, Serafín Moral
    Reasoning with imprecise probabilities. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2000, v:24, n:2-3, pp:121-123 [Journal]
  50. Luis D. Hernández, Serafín Moral, Antonio Salmerón
    A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 1998, v:18, n:1-2, pp:53-91 [Journal]
  51. Serafín Moral, Antonio Salmerón
    Dynamic importance sampling in Bayesian networks based on probability trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2005, v:38, n:3, pp:245-261 [Journal]
  52. 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]
  53. Joaquín Abellán, Serafín Moral
    Building classification trees using the total uncertainty criterion. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2003, v:18, n:12, pp:1215-1225 [Journal]
  54. Isabelle Bloch, Anthony Hunter, Alain Appriou, André Ayoun, Salem Benferhat, Philippe Besnard, Laurence Cholvy, Roger Cooke, Frédéric Cuppens, Didier Dubois, Hélène Fargier, Michel Grabisch, Rudolf Kruse, Jérôme Lang, Serafín Moral, Henri Prade, Alessandro Saffiotti, Philippe Smets, Claudio Sossai
    Fusion: General concepts and characteristics. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2001, v:16, n:10, pp:1107-1134 [Journal]
  55. 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]
  56. 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]
  57. Laurence Cholvy, Serafín Moral
    Merging databases: Problems and examples. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2001, v:16, n:10, pp:1193-1221 [Journal]
  58. José Del Sagrado, Serafín Moral
    Qualitative combination of Bayesian networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2003, v:18, n:2, pp:237-249 [Journal]
  59. Joaquín Abellán, Serafín Moral
    A Non-Specificity Measure for Convex Sets of Probability Distributions. [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2000, v:8, n:3, pp:357-368 [Journal]
  60. Joaquín Abellán, Serafín Moral
    Maximum of Entropy for Credal Sets. [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003, v:11, n:5, pp:587-598 [Journal]
  61. Luis M. de Campos, José A. Gámez, Serafín Moral
    Simplifying Explanations in Bayesian Belief Networks. [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2001, v:9, n:4, pp:461-490 [Journal]
  62. Joaquín Abellán, Serafín Moral
    Corrigendum: "a Non-specificity Measure for Convex Sets of Probability Distributions". [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2005, v:13, n:4, pp:467- [Journal]
  63. Joaquín Abellán, Serafín Moral
    An Algorithm to Compute the Upper Entropy for Order-2 Capacities. [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2006, v:14, n:2, pp:141-154 [Journal]
  64. Juan F. Verdegay-López, Serafín Moral
    Network of probabilities associated with a capacity of order-2. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2000, v:125, n:1-4, pp:187-206 [Journal]
  65. 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]
  66. Jürg Kohlas, Rolf Haenni, Serafín Moral
    Propositional Information Systems. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:5, pp:651-681 [Journal]
  67. 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]
  68. Luis M. de Campos, José A. Gámez, Serafín Moral
    Partial abductive inference in Bayesian belief networks using a genetic algorithm. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1999, v:20, n:11-13, pp:1211-1217 [Journal]
  69. Luis M. de Campos, José A. Gámez, Serafín Moral
    Partial abductive inference in Bayesian belief networks - an evolutionary computation approach by using problem-specific genetic operators. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2002, v:6, n:2, pp:105-131 [Journal]
  70. 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]

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


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


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


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


  75. The Independency tree model: a new approach for clustering and factorisation. [Citation Graph (, )][DBLP]


  76. Some Variations on the PC Algorithm. [Citation Graph (, )][DBLP]


  77. Varying Parameter in Classification Based on Imprecise Probabilities. [Citation Graph (, )][DBLP]


Search in 0.091secs, Finished in 0.096secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002