通过增量个人分析和基于支持的用户细分实现Web个性化

Yiyu Yao, Yi Zeng, N. Zhong, Xiangji Huang
{"title":"通过增量个人分析和基于支持的用户细分实现Web个性化","authors":"Yiyu Yao, Yi Zeng, N. Zhong, Xiangji Huang","doi":"10.1109/WI.2007.111","DOIUrl":null,"url":null,"abstract":"Online personalised \"my*\" services are gaining popularity due to a growing customer need for information filtering and customisation. However, current systems mostly rely on some general usage and customer interaction in selecting components from prespecified blocks of content. The demand is great for high-quality unsupervised services on the customer side and for enabling techniques on the vendor side. Furthermore, individual profiles and, thus, personalised content should reflect changing individual behaviour. How do we efficiently build and maintain up-to-date personalised services for a large number of individuals? A compact and efficient, incrementally updatable representation of individual profiles is crucial. In addition, methods are required for efficient comparison of such profiles. Here we propose a methodology for building up-to-date personalised services. Individual profiles are represented as space-efficient prefix trees that are inherently easy to update incrementally. To measure the similarity of profiles, and also for the purpose of segmentation, we define a support-based metric that exploits the advantages of the tree-based structure. We evaluate our method on anonymised web data of 10,000 customers of an investment bank collected over 1.5 years.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Web Personalisation Through Incremental Individual Profiling and Support-based User Segmentation\",\"authors\":\"Yiyu Yao, Yi Zeng, N. Zhong, Xiangji Huang\",\"doi\":\"10.1109/WI.2007.111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online personalised \\\"my*\\\" services are gaining popularity due to a growing customer need for information filtering and customisation. However, current systems mostly rely on some general usage and customer interaction in selecting components from prespecified blocks of content. The demand is great for high-quality unsupervised services on the customer side and for enabling techniques on the vendor side. Furthermore, individual profiles and, thus, personalised content should reflect changing individual behaviour. How do we efficiently build and maintain up-to-date personalised services for a large number of individuals? A compact and efficient, incrementally updatable representation of individual profiles is crucial. In addition, methods are required for efficient comparison of such profiles. Here we propose a methodology for building up-to-date personalised services. Individual profiles are represented as space-efficient prefix trees that are inherently easy to update incrementally. To measure the similarity of profiles, and also for the purpose of segmentation, we define a support-based metric that exploits the advantages of the tree-based structure. We evaluate our method on anonymised web data of 10,000 customers of an investment bank collected over 1.5 years.\",\"PeriodicalId\":192501,\"journal\":{\"name\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI.2007.111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2007.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

摘要

由于客户对信息过滤和定制的需求日益增长,网上个性化的“my*”服务越来越受欢迎。然而,当前的系统在从预先指定的内容块中选择组件时,主要依赖于一些一般用法和客户交互。对于客户端的高质量无监督服务和供应商端的启用技术的需求很大。此外,个人资料和个性化内容应该反映个人行为的变化。我们如何有效地为大量的个人建立和维护最新的个性化服务?单个概要文件的紧凑、高效、可增量更新的表示是至关重要的。此外,还需要对这些剖面进行有效比较的方法。在这里,我们提出了一种构建最新的个性化服务的方法。单个配置文件被表示为具有空间效率的前缀树,其本质上易于增量更新。为了测量轮廓的相似性,也为了分割的目的,我们定义了一个基于支持的度量,它利用了基于树的结构的优点。我们在一家投资银行收集的超过1.5年的10,000名客户的匿名网络数据上评估我们的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Web Personalisation Through Incremental Individual Profiling and Support-based User Segmentation
Online personalised "my*" services are gaining popularity due to a growing customer need for information filtering and customisation. However, current systems mostly rely on some general usage and customer interaction in selecting components from prespecified blocks of content. The demand is great for high-quality unsupervised services on the customer side and for enabling techniques on the vendor side. Furthermore, individual profiles and, thus, personalised content should reflect changing individual behaviour. How do we efficiently build and maintain up-to-date personalised services for a large number of individuals? A compact and efficient, incrementally updatable representation of individual profiles is crucial. In addition, methods are required for efficient comparison of such profiles. Here we propose a methodology for building up-to-date personalised services. Individual profiles are represented as space-efficient prefix trees that are inherently easy to update incrementally. To measure the similarity of profiles, and also for the purpose of segmentation, we define a support-based metric that exploits the advantages of the tree-based structure. We evaluate our method on anonymised web data of 10,000 customers of an investment bank collected over 1.5 years.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信