找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 決絕
51#
發(fā)表于 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
52#
發(fā)表于 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
53#
發(fā)表于 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
54#
發(fā)表于 2025-3-30 21:11:08 | 只看該作者
55#
發(fā)表于 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
56#
發(fā)表于 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
57#
發(fā)表于 2025-3-31 09:48:59 | 只看該作者
58#
發(fā)表于 2025-3-31 15:47:23 | 只看該作者
59#
發(fā)表于 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
60#
發(fā)表于 2025-4-1 01:14:28 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-20 09:29
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
墨竹工卡县| 和静县| 吉林省| 民丰县| 马山县| 东至县| 高雄市| 平遥县| 应用必备| 广河县| 吉隆县| 子长县| 苍山县| 霍邱县| 通化县| 元江| 图木舒克市| 铜梁县| 全椒县| 永寿县| 东阳市| 凌云县| 游戏| 梅河口市| 治多县| 交口县| 平武县| 西吉县| 黄平县| 无极县| 潜山县| 临湘市| 乃东县| 根河市| 万年县| 理塘县| 甘德县| 石景山区| 彰化市| 奉贤区| 杂多县|