找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Web Information Systems Engineering -- WISE 2014; 15th International C Boualem Benatallah,Azer Bestavros,Yanchun Zhang Conference proceedin

[复制链接]
楼主: 决绝
发表于 2025-3-30 10:06:40 | 显示全部楼层
Automatically Annotating Structured Web Data Using a SVM-Based Multiclass Classifierign labels to data items. For data record extraction, a data section re-segmentation algorithm based on visual and content features is introduced to improve the performance of Web data record extraction. We have implemented the proposed approach and tested it with a large set of Web query result pag
发表于 2025-3-30 13:18:31 | 显示全部楼层
Mining Discriminative Itemsets in Data Streams model. Discriminative Itemsets are defined as Itemsets that are frequent in one data stream and their frequency in that stream is much higher than the rest of the streams in the dataset. In order to deal with the data structure size, we propose a pruning process that results in the compact tree str
发表于 2025-3-30 20:11:46 | 显示全部楼层
Mining Discriminative Itemsets in Data Streams model. Discriminative Itemsets are defined as Itemsets that are frequent in one data stream and their frequency in that stream is much higher than the rest of the streams in the dataset. In order to deal with the data structure size, we propose a pruning process that results in the compact tree str
发表于 2025-3-30 21:11:08 | 显示全部楼层
发表于 2025-3-31 01:53:15 | 显示全部楼层
Modelling Visit Similarity Using Click-Stream Data: A Supervised Approachgeting exists today, it is based on demographic attributes of the visitors. We show that dynamic visitor attributes extracted from their click-stream provide much better predictive capabilities of visitor intent. In this work, we propose a mechanism for identifying similar visitor sessions on a webs
发表于 2025-3-31 06:47:08 | 显示全部楼层
BOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtreesm for rooted labelled unordered trees called the .alanced-.ptimal-search .anonical .orm (BOCF) that can handle the isomorphism problem efficiently. Using BOCF, we define a tree structure guided scheme based enumeration approach that systematically enumerates only the valid subtrees. Finally, we pres
发表于 2025-3-31 09:48:59 | 显示全部楼层
发表于 2025-3-31 15:47:23 | 显示全部楼层
发表于 2025-3-31 19:07:37 | 显示全部楼层
Phrase Queries with Inverted + Direct Indexested index, potentially augmented by selected multi-word sequences (e.g., .-grams or frequent noun phrases). In this work, instead of augmenting the inverted index, we take a radically different approach and leverage the ., which provides efficient access to compact representations of documents. Mode
发表于 2025-4-1 01:14:28 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 03:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表