Abstract
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.
This work is supported by grant from GM.
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
Bellman S., Lohse G. L., and Johnson E. J. Predictors of Online Buying: Findings from the Wharton Virtual Test Market. Communications of the ACM, 42(12): 32–38, 1999.
Brin S. and Page L. The Anatomy of a Large-Scale Hypertextual Web Search Engine. Proc. of WWW-7, 1998, pp. 107–117.
Charu C. Aggrawal, Wolf J. L, Wu K., and Yu P. S. Horting Hatches an Egg: A New Graph-Theoretic Approach to Collaborative Filtering. Proc. of ACM KDD’99 Conference, CA, 1999.
Chen L., and Sycara K. WebMate: A Personal Agent for Browsing and Searching. Proc. of ICMAS 1998, pp. 132–139.
Goffinet L. and Noirhomme-Fraiture M. Automatic Hypertext Link Generation based on Similarity Measures between Documents. Research Paper, RP-96-034, Institut d’Informatique, FUNDP, 1995.
Good N, Schafer J. B, Konstan J. A, Borchers A, Sarwar B, Herlocker J, Riedl J. Combining Collaborative Filtering with Personal Agents for Better Recommendations. Proc. of AAAI-99, pp. 439–446, 1999.
Herlocker J.L, Konstan J. A, Riedl J. Explaining Collaborative Filtering Recommendations. CSCW. ACM 2000 Conference on Computer Supported Cooperative Work, 2000, pp. 241–250.
Holte, R. C. and Drummond, C. A learning apprentice for browsing. In Working Notes of the AAAI Spring Symp. on Software Agents, CA, pp. 37–42, 1994.
Lieberman H.. Letizia: An Agent that Assists Web Browsing. Proc. of IJCAI-95, Montreal, CA, 1995.
Lin R. Attaining Fast and Successful Search in E-Commerce Environments. A Master’s Thesis, Bar-Ilan University, June 2002.
Lohse G. L., and Spiller P. Electronic Shopping: The Effect of Customer Interfaces on Traffic and Sales. Communications of the ACM, 41(7): 81–87, 1998.
Sarwar B., Karypis G., Konstan J., and Riedl. J. Analysis of Recommendation Algorithms for E-Commerce. Proc. of ACM E-Commerce, 2000, pp. 158–167.
Shardanand U. and Maes P. Social Information Filtering: Algorithms for Automating “Word of Mouth”. Proc. of CHI-95, ACM Press, New York, 1995, pp. 210–217.
Siegel, S. Nonparametric Statistics for the Behavioral Sciences. New York: McGraw-Hill, 1956, pp. 75–83.
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
Lin, R., Kraus, S., Tew, J. (2003). Attaining Fast and Successful Searches in E-commerce Environments. In: Sebastiani, F. (eds) Advances in Information Retrieval. ECIR 2003. Lecture Notes in Computer Science, vol 2633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36618-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-36618-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01274-0
Online ISBN: 978-3-540-36618-8
eBook Packages: Springer Book Archive