A method for personalized clustering in data intensive web applications
Proceedings of the joint international workshop on Adaptivity, personalization & the semantic web
Service-Oriented data and process models for personalization and collaboration in e-business
EC-Web'06 Proceedings of the 7th international conference on E-Commerce and Web Technologies
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
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.