On the equivalence of optimal recommendation sets and myopically optimal query sets

&
Artificial Intelligence 286 (C):103328 (2020)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2020.103328

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Optimal Multi-issue Negotiation in Open and Dynamic Environments.Fenghui Ren & Minjie Zhang - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), Pricai 2008: Trends in Artificial Intelligence. Springer. pp. 321--332.
Optimal modular feedforward neural networks based on functional networks.A. S. Cofino & J. M. Gutiérrez - 2001 - In P. Bouquet (ed.), Lecture Notes in Artificial Intelligence. Kluwer Academic Publishers. pp. 2083--308.
Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.
Belief structures, possibility theory and decomposable confidence measures on finite sets.Didier Dubois - 1986 - Computers and Artificial Intelligence (5):403--416.
Social Structure, Economic Performance and Pareto Optimality.Paul D. Thistle - 1998 - Theory and Decision 45 (2):161-173.
Metrics for evaluating the serendipity of recommendation lists.Tomoko Murakami, Koichiro Mori & Ryohei Orihara - 2008 - In Satoh (ed.), New Frontiers in Artificial Intelligence. Springer. pp. 40--46.
Exact query reformulation with first-order ontologies and databases.Enrico Franconi, Volha Kerhet & Nhung Ngo - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 202--214.
Immunity and Hyperimmunity for Sets of Minimal Indices.Frank Stephan & Jason Teutsch - 2008 - Notre Dame Journal of Formal Logic 49 (2):107-125.
On the computational power of random strings.Adam R. Day - 2009 - Annals of Pure and Applied Logic 160 (2):214-228.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,562,871)

6 months
4 (#862,833)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references