Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional stores, there is little or no guidance that helps the customers as they search. In this paper, we propose a new approach for searching in online stores. This approach is based on algorithms commonly used in recommendation systems, but which are rarely used for searches in online stores. We employ this approach for both keyword and browse searches, and present an implementation of this approach. We compared several search guide algorithms experimentally, and the experiments' results show that the suggested algorithms are applicable to the domain of online stores. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Lin, R., Kraus, S., & Tew, J. (2003). Attaining fast and successful searches in E-commerce environments. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2633, 120–134. https://doi.org/10.1007/3-540-36618-0_9
Mendeley helps you to discover research relevant for your work.