Abstract
Recommendation systems offer the most similar point cases to a target query. Among those cases similar to the query, some may be similar and others dissimilar to each other. Offering only the most similar cases wrt. the query leads to the well known problem that the customers may have only a few number of choices. To address the problem of offering adiverse set of cases, several approaches have been proposed. In a different line of CBR research, the concept of generalized cases has been systematically studied, which can be applied to represent parameterizable products. First approaches to retrieving the most similar point cases from a case base of generalized cases have been proposed. However, until now no algorithm is known to retrieve a diverse set of point cases from a case base of generalized cases. This is the topic of this paper. We present a new branch and bound method to build a retrieval set of point cases such that its diversity is sufficient and each case in the retrieval set is a representative for a set of similar point cases.
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
Bazaraa, M. S., Sherali, H.D., Shetty, C.M.: NonLinear Programming, Theory and Algorithms. Second Edition. 408–474. Wiley, 1993.
Bergmann, R.: Experience Management: Foundations, Development Methodology, and Internet-Based Applications. Lecture Notes in Artificial Intelligence, Vol. 2432, Springer, 2002.
Bergmann, R., Richter, M.M., Schmitt, S., Stahl, A., Vollrath, I.: Utility-Oriented Matching: A New Research Direction for Case-Based Reasoning. 9th German Workshop on Case-Based Reasoning (GWCBR’2001), 2001.
Bergmann, R., Vollrath, I.: Generalized cases: Representation and steps towards efficient similarity assessment. In W. Burgard, Th. Christaller & A. B. Cremers (Eds.) KI-99: Advances in Artificial Intelligence Lecture Notes in Artificial Intelligence, 1701, Springer, 195–206, 1999.
Lewis, J.: Intellectual property (IP) components. Artisan Components, Inc., [web page], http://www.artisan.com/ip.html, 1997.
McSherry, D.: Diversity-Conscious Retrieval. In: S. Craw & A. Preece (Eds.) European Conference on Case-Based Reasoning (ECCBR’02). Lecture Notes in Artificial Intelligence, Springer, 219–233, 2002.
McSherry, D.: Increasing Recommendation Diversity Without Loss of Similarity. Proceedings of the 6th UK Workshop on Case-Based Reasoning, pp. 23–31, 2001.
Mougouie, B.: Optimization of Distance/Similarity Functions under Linear and Nonlinear Constraints with application in Case-Based Reasoning, Master thesis, University of Kaiserslautern, Germany, 2001.
Mougouie, B., Bergmann, R.: Similarity Assessment for Generalized Cases by Optimization Methods. In: S. Craw & A. Preece (Eds.) Advances in Case-Based Reasoning, 6th European Conference (ECCBR 2002). Lecture Notes in Artificial Intelligence, 2416, Springer, 249–263, 2002.
Mougouie B., Richter M. M.: Generalized Cases, Similarity and Optimization. In: D. Hutter, W. Stephan (Eds.), Deduction and beyond, LNAI 2605, Springer-Verlag, 2003.
Schaaf, M., Maximini, R., Bergmann, R., Tautz, C., Traphoener, R.: Supporting Electronic Design Reuse by Integrating Quality-Criteria into CBR-based IP Selection. In: S. Craw & A. Preece (Eds.) Advances in Case-Based Reasoning, 6th European Conference (ECCBR 2002). Lecture Notes in Artificial Intelligence, 2416, Springer, 628–641, 2002.
Schaaf, M., Visarius, M., Bergmann, R., Maximini, R., Spinelli, M., Lessmann, J., Hardt, W., Ihmor, S., Thronicke, W.: IPCHL— A Description Language for Semantic IP Characterization. Forum on Specification an Design Languages (FDL’2002),2002.
Smyth, B., McClave, P.: Similarity vs. Diversity. In: Aha, D.W, Watson, I. (eds.): Case-Based Reasoning Research and Development, Springer, pp. 347–361, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mougouie, B., Richter, M.M., Bergmann, R. (2003). Diversity-Conscious Retrieval from Generalized Cases: A Branch and Bound Algorithm. In: Ashley, K.D., Bridge, D.G. (eds) Case-Based Reasoning Research and Development. ICCBR 2003. Lecture Notes in Computer Science(), vol 2689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45006-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-45006-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40433-0
Online ISBN: 978-3-540-45006-1
eBook Packages: Springer Book Archive