找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Advances in Databases and Information Systems; 11th East European C Yannis Ioannidis,Boris Novikov,Boris Rachev Conference proceedings 2007

[復(fù)制鏈接]
樓主: CRUST
51#
發(fā)表于 2025-3-30 09:29:02 | 只看該作者
52#
發(fā)表于 2025-3-30 14:13:35 | 只看該作者
https://doi.org/10.1007/978-3-642-67071-8ed search, vertical search, entity search, and Deep-Web search. I envision another big leap forward by automatically harvesting and organizing knowledge from the Web, represented in terms of explicit entities and relations as well as ontological concepts. This will be made possible by the confluence
53#
發(fā)表于 2025-3-30 20:33:18 | 只看該作者
54#
發(fā)表于 2025-3-31 00:11:05 | 只看該作者
Anne Poljak,Mark Raftery,Patsie Pollyre of the different IOW coordination problems is amenable to protocols. Hence, this paper show how these protocols could be modelled and made accessible to partners involved in an IOW. More precisely, the paper proposes a coordination protocol ontology for IOW and explains how workflow partners can
55#
發(fā)表于 2025-3-31 03:51:29 | 只看該作者
56#
發(fā)表于 2025-3-31 07:10:33 | 只看該作者
Yasunobu Okada,Emi Maeno,Shin-ichiro Moriccurrences of an individual record in the non-target table and non-determinate relations between tables. Most traditional data mining methods only deal with a single table and discretize columns that contain continuous numbers into nominal values. In a relational database, multiple records with nume
57#
發(fā)表于 2025-3-31 10:44:36 | 只看該作者
R. Schnetter,B. Brück,K. Gerke,G. Seiboldors used for achieving a high accuracy in classification is given in advance and is highly dependent on the data set used. If the size of data set is large, the sequential or binary search of NNs is inapplicable due to the increased computational costs. Therefore, indexing schemes are frequently use
58#
發(fā)表于 2025-3-31 15:20:30 | 只看該作者
A. Vermeglio,J. Ravenel,G. Peltierre actually performing any classification. As a result, these methods are ineffective on (a) very large datasets stored in databases or data warehouses, (b) data whose partitioning into classes cannot be captured by global models and is sensitive to local characteristics, and (c) data that arrives c
59#
發(fā)表于 2025-3-31 18:21:15 | 只看該作者
60#
發(fā)表于 2025-3-31 23:55:59 | 只看該作者
R. Schliebs,T. Feist,S. Ro?ner,V. Bigly domain experts but is constructed by modelling experts. However, this is infeasible in many cases, e.g., if the system is to be generated ad hoc from a conceptual schema..This paper presents an iterative process that helps domain experts to create a conceptual schema without the need for a modelli
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 11:44
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
贵定县| 卫辉市| 万源市| 大名县| 萨嘎县| 砚山县| 临邑县| 迁安市| 甘德县| 巫溪县| 上林县| 伊宁县| 闽清县| 灯塔市| 南投市| 陇西县| 江都市| 葫芦岛市| 革吉县| 淅川县| 许昌县| 资兴市| 隆德县| 历史| 嵩明县| 措美县| 友谊县| 思南县| 萝北县| 灵寿县| 绍兴市| 罗城| 株洲县| 和林格尔县| 南平市| 鄂托克旗| 郎溪县| 青川县| 犍为县| 宕昌县| 湄潭县|