Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation
- 600 Downloads
We show how case bases can be compiled into Decision Diagrams, which represent the cases with reduced redundancy. Numerous computations can be performed efficiently on the Decision Diagrams. The ones we illustrate are: counting characteristics of the case base; computing the distance between a user query and all cases in the case base; and retrieving the k best cases from the case base. Through empirical investigation on four case bases, we confirm that Decision Diagrams are more efficient than a conventional algorithm. Finally, we argue that Decision Diagrams are also flexible in that they support a wide range of computations, additional to the retrieval of the k nearest neighbours.
KeywordsCase Base Recommender System Constraint Satisfaction Problem Operation Count Complete Path
Unable to display preview. Download preview PDF.
- 3.Burkhard, H.-D., Lenz, M.: Case Retrieval Nets: Basic ideas and extensions. In: Burkhard, H.-D., Lenz, M. (eds.) Procs. of the 4th German Workshop on CBR, Humboldt University, pp. 103–110 (1996)Google Scholar
- 5.Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 5th edn. Addison-Wesley, Reading (2006)Google Scholar
- 6.McSherry, D.: Explanation of Retrieval Mismatches in Recommender System Dialogues. In: Aha, D.W. (ed.) Procs. of the Workshop on Mixed-Initiative Case-Based Reasoning, pp. 191–199. Norwegian University of Science and Technology (2003)Google Scholar
- 8.Wess, S., Althoff, K.-D., Derwand, G.: Using k-d Trees to Improve the Retrieval Step in Case-Based Reasoning. In: Wess, S., Richter, M., Althoff, K.-D., et al. (eds.) EWCBR 1993. LNCS, vol. 837, pp. 167–181. Springer, Heidelberg (1994)Google Scholar
- 9.Wilson, N.: Decision Diagrams for the Computation of Semiring Valuations. In: Procs. of the 19th IJCAI, pp. 331–336 (2005)Google Scholar