Apprentissage de préférences en espace combinatoire et application à la recommandation en configuration interactive. (Preferences learning in combinatorial spaces and application to recommandation in interactive configuration)

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Unknown venue

• Publication date

  2018-10-10

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Surprise: A Python library for recommender systems

  2020cited by this paper
• Bayesian network hybrid learning using an elite-guided genetic algorithm

  2019cited by this paper
• Learning Lexicographic Preference Trees From Positive Examples

  2018cited by this paper
• Recommandation par inférence bayésienne. Application à la configuration de produit

  2018cited by this paper
• An empirical study of testing independencies in Bayesian networks using rp-separation

  2018cited by this paper
• Quotient Normalized Maximum Likelihood Criterion for Learning Bayesian Network Structures

  2018cited by this paper
• Online Learning of Acyclic Conditional Preference Networks from Noisy Data

  2017cited by this paper
• Lexicographic preferences for predictive modeling of human decision making: A new machine learning method with an application in accounting

  2017cited by this paper
• A Simple Method for Testing Independencies in Bayesian Networks

  2016cited by this paper
• The Complexity of Learning Acyclic CP-Nets

  2016cited by this paper
• Recommendation for product configuration: an experimental evaluation

  2016cited by this paper
• An Empirical-Bayes Score for Discrete Bayesian Networks

  2016cited by this paper
• MODELING, LEARNING AND REASONING ABOUT PREFERENCE TREES OVER COMBINATORIAL DOMAINS

  2016cited by this paper
• Testing Independencies in Bayesian Networks with i-Separation

  2016cited by this paper
• Compilation de préférences : application à la configuration de produit

  2015cited by this paper
• The Netflix Recommender System

  2015cited by this paper
• Learning Partial Lexicographic Preference Trees over Combinatorial Domains

  2015cited by this paper
• The Optimal Sample Complexity of PAC Learning

  2015cited by this paper
• The proof and measurement of association between two things.

  2015cited by this paper
• Représentation et apprentissage de préférences

  2015cited by this paper
• Probabilistic Sentential Decision Diagrams

  2014cited by this paper
• Multiple Quantitative Trait Analysis Using Bayesian Networks

  2014cited by this paper
• A Vertex Separator-based Algorithm for Hypergraph Bipartitioning

  2014cited by this paper
• Learning Conditional Lexicographic Preference Trees

  2014cited by this paper
• Possibilistic Networks: A New Setting for Modeling Preferences

  2014cited by this paper
• Learning CP-Net Preferences Online from User Queries

  2013cited by this paper
• Global Inverse Consistency for Interactive Constraint Satisfaction

  2013cited by this paper
• Probabilistic Conditional Preference Networks

  2013cited by this paper
• WCP-Nets: A Weighted Extension to CP-Nets for Web Service Selection

  2012cited by this paper
• Order-independent constraint-based causal structure learning

  2012cited by this paper
• Using and Learning GAI-Decompositions for Representing Ordinal Rankings

  2012cited by this paper
• Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains

  2012cited by this paper
• Dynamic and Probabilistic CP-nets

  2012cited by this paper
• Nested Markov Properties for Acyclic Directed Mixed Graphs

  2012cited by this paper
• Complexity Results and Approximation Strategies for MAP Explanations

  2011cited by this paper
• Computational techniques for a simple theory of conditional preferences

  2011cited by this paper
• On Graphical Modeling of Preference and Importance

  2011cited by this paper
• Introduction to Recommender Systems Handbook

  2011cited by this paper
• Learning Lexicographic Preference Models

  2010cited by this paper
• Learning conditionally lexicographic preference relations

  2010cited by this paper
• Predicting Partial Orders: Ranking with Abstention

  2010cited by this paper
• Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets

  2010cited by this paper
• Recommender Systems: Introduction

  2010cited by this paper
• Learning Bayesian Networks with the bnlearn R Package

  2009cited by this paper
• Wiley Interdisciplinary Reviews

  2009cited by this paper
• Learning Conditional Preference Networks with Queries

  2009cited by this paper
• How to Complete an Interactive Configuration Process?

  2009cited by this paper
• Ceteris Paribus Preference Elicitation with Predictive Guarantees

  2009cited by this paper
• GAI-networks: optimization, ranking and collective choice in combinatorial domains

  2008cited by this paper
• Factorized normalized maximum likelihood criterion for learning Bayesian network structures

  2008cited by this paper
• Techniques for Efficient Interactive Configuration of Distribution Networks

  2007cited by this paper
• Hierarchical CP-networks

  2007cited by this paper
• Learning Bayesian networks using genetic algorithm

  2007cited by this paper
• A simulated annealing‐based method for learning Bayesian networks from statistical data

  2006cited by this paper
• Relations binaires et modélisation des préférences

  2006cited by this paper
• On the Complexity of Learning Lexicographic Strategies

  2006cited by this paper
• The max-min hill-climbing Bayesian network structure learning algorithm

  2006cited by this paper
• Speculative Markov blanket discovery for optimal feature selection

  2005cited by this paper
• The computational complexity of dominance and consistency in CP-nets

  2005cited by this paper
• Local Utility Elicitation in GAI Models

  2005cited by this paper
• mCP Nets: Representing and Reasoning with Preferences of Multiple Agents

  2004cited by this paper
• GAI Networks for Utility Elicitation

  2004cited by this paper
• Expressive Power and Succinctness of Propositional Languages for Preference Representation

  2004cited by this paper
• A Bayesian Method for the Induction of Probabilistic Networks from Data

  2004cited by this paper
• Toward efficient agnostic learning

  2004cited by this paper
• CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments

  2004cited by this paper
• Industry Report: Amazon.com Recommendations: Item-to-Item Collaborative Filtering

  2003cited by this paper
• Learning Bayesian Network Model Structure from Data

  2003cited by this paper
• A New Look at the Semantics and Optimization Methods of CP-Networks

  2003cited by this paper
• Apprentissage artificiel - Concepts et algorithmes

  2003cited by this paper
• A Bayesian Network Scoring Metic that Is Based on Globally Uniform Parameter Priors

  2002cited by this paper
• Value Elimination: Bayesian Interence via Backtracking Search

  2002cited by this paper
• Introducing Variable Importance Tradeoffs into CP-Nets

  2002cited by this paper
• Enhancing Web-Based Configuration with Recommendations and Cluster-Based Help

  2002cited by this paper
• Consistency restoration and explanations in dynamic CSPs Application to configuration

  2002cited by this paper
• Active Learning for Structure in Bayesian Networks

  2001cited by this paper
• Preference-Based Configuration of Web Page Content

  2001cited by this paper
• Item-based collaborative filtering recommendation algorithms

  2001cited by this paper
• UCP-Networks: A Directed Graphical Representation of Conditional Utilities

  2001cited by this paper
• Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees

  2001cited by this paper
• Conditions Under Which Conditional Independence and Scoring Methods Lead to Identical Selection of Bayesian Network Models

  2001cited by this paper
• Propositional Distances and Preference Representation

  2001cited by this paper
• Recursive conditioning

  2001cited by this paper
• Active Learning for Parameter Estimation in Bayesian Networks

  2000cited by this paper
• Conformant Planning via Symbolic Model Checking

  2000cited by this paper
• Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison

  1999cited by this paper
• Bayes-Ball: The Rational Pastime (for Determining Irrelevance and Requisite Information in Belief Networks and Influence Diagrams)

  1998cited by this paper
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

  1998cited by this paper
• Configuring Large Systems Using Generative Constraint Satisfaction

  1998cited by this paper
• Variety for sale: Mass customization or mass confusion?

  1998cited by this paper
• Clustering Methods for Collaborative Filtering

  1998cited by this paper
• Reasoning the fast and frugal way: models of bounded rationality.

  1996cited by this paper
• Valued Constraint Satisfaction Problems: Hard and Easy Problems

  1995cited by this paper
• Toward a Logic for Qualitative Decision Theory

  1994cited by this paper
• Learning Bayesian networks: The combination of knowledge and statistical data

  1994cited by this paper
• A simple approach to Bayesian network computations

  1994cited by this paper
• An algorithm directly finding the K most probable configurations in Bayesian networks

  1994cited by this paper
• Learning Bayesian Networks is

  1994cited by this paper
• Minimum Description Length Principle

  1994cited by this paper
• Finding MAPs for Belief Networks is NP-Hard

  1994cited by this paper

• No citing papers are available for this paper.