The following pages link to José A. Gámez (Q205486):
Displaying 37 items.
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood (Q408599) (← links)
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
- Learning compact zero-order TSK fuzzy rule-based systems for high-dimensional problems using an apriori \(+\) local search approach (Q781936) (← links)
- (Q895533) (redirect page) (← links)
- A scalable pairwise class interaction framework for multidimensional classification (Q895535) (← links)
- Domains of competence of the semi-naive Bayesian network classifiers (Q903594) (← links)
- Tackling the rank aggregation problem with evolutionary algorithms (Q907462) (← links)
- Learning weighted linguistic fuzzy rules by using specifically-tailored hybrid estimation of distribution algorithms (Q962877) (← links)
- Ant colony optimization for learning Bayesian networks. (Q1399508) (← links)
- Partial evaluation in rank aggregation problems (Q1652087) (← links)
- (Q1733689) (redirect page) (← links)
- Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
- Modelling and inference with conditional Gaussian probabilistic decision graphs (Q1951284) (← links)
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes (Q1951294) (← links)
- A probabilistic graphical model-based approach for the Label Ranking Problem (Q2297788) (← links)
- Structural fusion/aggregation of Bayesian networks via greedy equivalence search learning algorithm (Q2297797) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- Initial approaches to the application of islands-based parallel EDAs in continuous domains (Q2498691) (← links)
- Searching for the best elimination sequence in Bayesian networks by using ant colony optimization (Q2778119) (← links)
- Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes (Q3011945) (← links)
- SIMPLIFYING EXPLANATIONS IN BAYESIAN BELIEF NETWORKS (Q3427943) (← links)
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning (Q3524969) (← links)
- Use of Explanation Trees to Describe the State Space of a Probabilistic-Based Abduction Problem (Q3562273) (← links)
- (Q3595873) (← links)
- HODE: Hidden One-Dependence Estimator (Q3638171) (← links)
- (Q4329345) (← links)
- (Q4415707) (← links)
- Triangulation of Bayesian networks by retriangulation (Q4419295) (← links)
- (Q4535164) (← links)
- OC1-DE: A Differential Evolution Based Approach for Inducing Oblique Decision Trees (Q5077565) (← links)
- Euro-Par 2004 Parallel Processing (Q5311354) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5473696) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5473705) (← links)
- Partial abductive inference in Bayesian belief networks by simulated annealing (Q5944536) (← links)
- Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption (Q5944733) (← links)
- Multi-dimensional Bayesian network classifiers for partial label ranking (Q6178701) (← links)
- Ensemble learning for the partial label ranking problem (Q6181961) (← links)
