Collaborative expert portfolio management

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 179-184

  Stern, David ^a   Herbrich, Ralf ^a   Graepel, Thore ^a   Samulowitz, Horst ^b   Pulina, Luca ^c   Tacchella, Armando ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; COMBINATORIAL MATHEMATICS; FINANCIAL DATA PROCESSING; INVESTMENTS;

COMBINATORIAL AUCTION; COMBINATORIAL PROBLEM; DECISION-THEORETIC; FEATURE-BASED DESCRIPTION; NONSTATIONARY DATA; PERFORMANCE FEEDBACK; PORTFOLIO MANAGEMENTS; TASK CHARACTERISTICS;

COLLABORATIVE FILTERING;

EID: 77958573404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Breese, J. S.; Heckerman, D.; and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th ACM Conference on Uncertainty in Artificial Intelligence, 34-52.
2. Chu, W., and Ghahramani, Z. 2005. Gaussian processes for ordinal regression. Journal of Machine Learning Research 1019-1041.
3. Gomes, C. P., and Selman, B. 1997. Algorithm portfolio design: Theory vs. practice. In Proceedings of the 13th ACM Conference on Uncertainty in Artificial Intelligence, 190-197.
4. Gomes, C. P.; Selman, B.; Crato, N.; and Kautz, H. 2000. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1-2):67-100.
5. Hooker, J. N. 2006. Integrated Methods for Optimization. Springer-Verlag New York.
6. Horvitz, E.; Ruan, Y; Gomes, C; Kautz, H.; Selman, B.; and Chickering, M. 2001. A Bayesian approach to tackling hard computational problems. In Proceedings of the 17th ACM Conference on Uncertainty in Artificial Intelligence, 235-244.
7. Kschischang, F. R.; Frey, B.; and Loeliger, H.-A. 2001. Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory 47(2):498-519.
8. Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2009. Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM.
9. Minka, T. 2005. Divergence measures and message passing. Technical Report MSR-TR-2007-173, Microsoft Research Ltd.
10. Pulina, L., and Tacchella, A. 2008. Time to learn or time to forget? strengths and weaknesses of a self-adaptive approach to reasoning in quantified Boolean formulas. In International Conference on Principles and Practice of Constraint Programming (Doctoral Programme).
11. Pulina, L., and Tacchella, A. 2009. A self-adaptive multi-engine solver for quantified Boolean formulas. Constraints Journal 80-116.
12. Rice, J. R. 1976. The algorithm selection problem. In Advances in computers, volume 15. New York: Academic Press. 65-118.
13. Samulowitz, H. 2008. Solving Quantified Boolean Formulas. Ph.D. Dissertation, University of Toronto.
14. Smith-Miles, K. A. 2008. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1):l-25.
15. Stern, D.; Herbrich, R.; and Graepel, T. 2009. Matchbox: Large scale online Bayesian recommendations. In HW '09: Proceedings of the 18th International Conference on World Wide Web, 111-120. New York, NY, USA: ACM Press.
16. Streeter, M. J., and Smith, S. F. 2008. New techniques for algorithm portfolio design. In Proceedings of the 24th ACM Conference on Uncertainty in Artificial Intelligence, 519-527.
17. Varian, H. R., and Resnick, P. 1997. Recommendersystems. Communications of the ACM 40:56-58.
18. Xu, L.; Hutter, F; Hoos, H.; and Leyton-Brown, K. 2008. Satzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32:565-606.