Web个性化的计算几何方法

Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004. Pub Date : 2004-07-06 DOI:10.1109/ICECT.2004.1319762

Maria Rigou, S. Sirmakessis, A. Tsakalidis

{"title":"Web个性化的计算几何方法","authors":"Maria Rigou, S. Sirmakessis, A. Tsakalidis","doi":"10.1109/ICECT.2004.1319762","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":194289,"journal":{"name":"Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A computational geometry approach to Web personalization\",\"authors\":\"Maria Rigou, S. Sirmakessis, A. Tsakalidis\",\"doi\":\"10.1109/ICECT.2004.1319762\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":194289,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECT.2004.1319762\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECT.2004.1319762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文提出了一种高效的个性化聚类算法。该算法将正交范围搜索与k窗算法相结合。它为在线购物环境中个性化服务的交付提供了实时解决方案，因为它允许在线消费者沿着多个维度建模他们的偏好，搜索产品信息，然后使用检索到的产品和服务的聚集列表来做出购买决策。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A computational geometry approach to Web personalization

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.

自引率

0.00%

发文量