找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Web Technologies and Applications; 13th Asia-Pacific We Xiaoyong Du,Wenfei Fan,Mohamed A. Sharaf Conference proceedings 2011 Springer Berli

[复制链接]
楼主: cerebral-cortex
发表于 2025-3-23 12:58:58 | 显示全部楼层
Web User Profiling on Proxy Logs and Its Evaluation in Personalizationr 40GB click streams over a 4 month period. We evaluate clustering-based recommendation effectiveness to confirm the optimality of the framework. The results show high hit precision compared with existing methods.
发表于 2025-3-23 14:48:37 | 显示全部楼层
发表于 2025-3-23 20:08:28 | 显示全部楼层
发表于 2025-3-24 00:36:08 | 显示全部楼层
发表于 2025-3-24 05:04:12 | 显示全部楼层
发表于 2025-3-24 09:31:23 | 显示全部楼层
Effective Hybrid Recommendation Combining Users-Searches Correlations Using Tensors latent relationships between such similar instances, consisting of users and searches. Non redundant rules from such associations of user-searches are then used for making recommendations to the users.
发表于 2025-3-24 11:14:37 | 显示全部楼层
Maintaining Internal Consistency of Report for Real-Time OLAP with Layer-Based Viewan OLAP query from being changed through using lock mechanism, and avoid the confliction between read and write operations with the help of layer mechanism. Our approach can effectively deal with report consistency issue, while at the same time avoiding the query contention between read and write operations under real-time OLAP environment.
发表于 2025-3-24 16:51:16 | 显示全部楼层
Maintaining Internal Consistency of Report for Real-Time OLAP with Layer-Based Viewan OLAP query from being changed through using lock mechanism, and avoid the confliction between read and write operations with the help of layer mechanism. Our approach can effectively deal with report consistency issue, while at the same time avoiding the query contention between read and write operations under real-time OLAP environment.
发表于 2025-3-24 21:02:12 | 显示全部楼层
Role Discovery for Graph Clusteringew graph clustering method, named ., which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.
发表于 2025-3-25 03:06:47 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 11:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表