Learning utility functions from preference relations on graphs

Géraldine Bous ()
Additional contact information
Géraldine Bous: SAP Research Sophia Antipolis, Business Intelligence Practice

A chapter in Operations Research Proceedings 2011, 2012, pp 109-114 from Springer

Abstract: Abstract The increasing popularity of graphs as fundamental data structures, due to their inherent flexibility in modeling information and its structure, has led to the development of methods to efficiently store, search and query graphs. Graphs are nonetheless complex entities whose analysis is cognitively challenging. This calls for the development of decision support systems that build upon a measure of ‘usefulness’ of graphs. We address this problem by introducing and defining the concept of ‘graph utility’. As the direct specification of utility functions is itself a difficult problem, we explore the problem of learning utility functions for graphs on the basis of user preferences that are extracted from pairwise graph comparisons.

Keywords: Utility Function; Recommendation System; Marginal Utility; Utility Model; Query Graph (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_18

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_18

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().