2004 IEEE International Conference on E-Commerce Technology (CEC'04)
A Computational Geometry Approach to Web Personalization
San Diego, California
July 06-July 09
ISBN: 0-7695-2098-7
In this paper we present an algorithm for efficient personalized clustering. The algorithm combines the orthogonal range search with the k-windows algorithm. It offers a real-time solution for the delivery of personalized services in online shopping environments, since it allows on-line consumers to model their preferences along multiple dimensions, search for product information, and then use the clustered list of products and services retrieved for making their purchase decisions.
Citation:
Maria Rigou, Spiros Sirmakessis, Athanasios Tsakalidis, "A Computational Geometry Approach to Web Personalization," cec, pp.377-380, 2004 IEEE International Conference on E-Commerce Technology (CEC'04), 2004