Abstract
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.
The support of the Informatics Commercialisation initiative of Enterprise Ireland is gratefully acknowledged; this work was also supported by Science Foundation Ireland under Grant No. 00/PI.1/C075. We are grateful to Dr. Lorraine McGinty and Mr. James Reilly for making their Laptops and Cameras data available to us.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic CSPs — Application to configuration. Artificial Intelligence 135(1–2), 199–234 (2002)
Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys 24(3), 292–318 (1992)
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)
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)
Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 5th edn. Addison-Wesley, Reading (2006)
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)
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)
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)
Wilson, N.: Decision Diagrams for the Computation of Semiring Valuations. In: Procs. of the 19th IJCAI, pp. 331–336 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicholson, R., Bridge, D., Wilson, N. (2006). Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation. In: Roth-Berghofer, T.R., Göker, M.H., Güvenir, H.A. (eds) Advances in Case-Based Reasoning. ECCBR 2006. Lecture Notes in Computer Science(), vol 4106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11805816_12
Download citation
DOI: https://doi.org/10.1007/11805816_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36843-4
Online ISBN: 978-3-540-36846-5
eBook Packages: Computer ScienceComputer Science (R0)