找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Web-Age Information Management; WAIM 2016 Internatio Shaoxu Song,Yongxin Tong Conference proceedings 2016 Springer International Publishing

[复制链接]
楼主: audiogram
发表于 2025-4-1 01:54:06 | 显示全部楼层
Efficient and Load Balancing Strategy for Task Scheduling in Spatial Crowdsourcinga set of spatial tasks tagged with location and time for workers according to their location. In most cases, existing approaches usually take the matching algorithm as a fundamental step to solve this problem which aims to maximize the number of completed tasks. However, in the present of many spati
发表于 2025-4-1 07:39:24 | 显示全部楼层
Preference-Aware Top-k Spatio-Textual Queries-textual objects ranked according to the warefare of the facilities in conditional range. Suppose a tourist that looks for motels that have nearby a highly rated Japanese restaurant that serves sushi. The proposed query considers not only the spatial location and textual description of spatial-textu
发表于 2025-4-1 13:21:13 | 显示全部楼层
发表于 2025-4-1 14:39:26 | 显示全部楼层
Result Diversification in Event-Based Social Networksent-based social networks (EBSNs), search result diversification in an event that covers as many user intents as possible. Most existing result diversification algorithms recognize an user may search for information by issuing the different query as much as possible. In this paper, we leverage many
发表于 2025-4-1 20:54:19 | 显示全部楼层
Preference-Aware Top-k Spatio-Textual Queries-textual objects ranked according to the warefare of the facilities in conditional range. Suppose a tourist that looks for motels that have nearby a highly rated Japanese restaurant that serves sushi. The proposed query considers not only the spatial location and textual description of spatial-textu
发表于 2025-4-1 22:45:55 | 显示全部楼层
Result Diversification in Event-Based Social Networksent-based social networks (EBSNs), search result diversification in an event that covers as many user intents as possible. Most existing result diversification algorithms recognize an user may search for information by issuing the different query as much as possible. In this paper, we leverage many
发表于 2025-4-2 04:04:35 | 显示全部楼层
Conference proceedings 2016 Nanchang, China, in June 2016.The three workshops were as follows:. .• The International Workshop on Spatiotemporal Data Management and Mining for the Web (SDMMW 2016)..• The International Workshop on Semi-structured Big Data Management and Applications (SemiBDMA 2016)...• The International Worksho
发表于 2025-4-2 08:44:39 | 显示全部楼层
An Improved Slope One Algorithm Combining KNN Method Weighted by User Similarityrs is calculated and added on the fly. Experiments on the MovieLens data set show that the proposed algorithm can achieve better recommendation quality and prediction accuracy. Besides, the stability of the algorithm is also relatively satisfying.
发表于 2025-4-2 11:13:29 | 显示全部楼层
发表于 2025-4-2 18:10:10 | 显示全部楼层
Using Convex Combination Kernel Function to Extract Entity Relation in Specific Fieldthe feature matrix to different high-dimensional matrix, and the different classification models can be obtained. The experiments are conducted on the domain dataset from Web and the experimental results show that our approach outperforms state-of-the-art learning models such as ME or Convolution tree kernel.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 21:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表