Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation

  • Ross Nicholson
  • Derek Bridge
  • Nic Wilson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4106)


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.


Case Base Recommender System Constraint Satisfaction Problem Operation Count Complete Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic CSPs — Application to configuration. Artificial Intelligence 135(1–2), 199–234 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys 24(3), 292–318 (1992)CrossRefGoogle Scholar
  3. 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
  4. 4.
    Doyle, M., Cunningham, P.: A Dynamic Approach to Reducing Dialog in On-Line Decision Guides. In: Blanzieri, E., Portinale, L. (eds.) EWCBR 2000. LNCS, vol. 1898, pp. 49–60. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 5th edn. Addison-Wesley, Reading (2006)Google Scholar
  6. 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
  7. 7.
    Ricci, F., Arslan, B., Mirzadeh, N., Venturini, A.: ITR: A Case-Based Travel Advisory System. In: Craw, S., Preece, A.D. (eds.) ECCBR 2002. LNCS, vol. 2416, pp. 613–641. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 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. 9.
    Wilson, N.: Decision Diagrams for the Computation of Semiring Valuations. In: Procs. of the 19th IJCAI, pp. 331–336 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ross Nicholson
    • 1
  • Derek Bridge
    • 1
  • Nic Wilson
    • 1
  1. 1.University College CorkCorkIreland

Personalised recommendations