找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Data Warehousing and Knowledge Discovery; 4th International Co Yahiko Kambayashi,Werner Winiwarter,Masatoshi Arik Conference proceedings 20

[復(fù)制鏈接]
樓主: foresight
11#
發(fā)表于 2025-3-23 10:05:36 | 只看該作者
An Algorithm for Building User-Role Profiles in a Trust Environment1ole Based Access Control Methods (RBAC). RBAC architectures do not deal with each user separately, but with discrete roles that users can acquire in the system. The goal of this paper is to present a classification algorithm that during its training phase, classifies roles of the users in clusters.
12#
發(fā)表于 2025-3-23 16:31:50 | 只看該作者
Neural-Based Approaches for Improving the Accuracy of Decision Treesme. The dependencies among attributes are not considered in those algorithms. Unfortunately, in the real world, most datasets contain attributes, which are dependent. Generally, these dependencies are classified into two types: categorical- type and numerical-type dependencies. Thus, it is very impo
13#
發(fā)表于 2025-3-23 20:42:32 | 只看該作者
14#
發(fā)表于 2025-3-23 22:53:18 | 只看該作者
15#
發(fā)表于 2025-3-24 05:11:29 | 只看該作者
16#
發(fā)表于 2025-3-24 06:53:23 | 只看該作者
17#
發(fā)表于 2025-3-24 13:04:48 | 只看該作者
Outlier Detection Using Replicator Neural Networksa mining to identify problems with the data itself, and to fraud detection where groups of outliers are often of particular interest. We use replicator neural networks (RNNs) to provide a measure of the outlyingness of data records. The performance of the RNNs is assessed using a ranked score measur
18#
發(fā)表于 2025-3-24 15:24:44 | 只看該作者
The Closed Keys Base of Frequent Itemsetse representations of frequent itemsets have been investigated. In this paper, we present yet another concise representation of frequent itemsets, called the closed keys representation, with the following characteristics: (i) it allows to determine if an itemset is frequent, and if so, the support of
19#
發(fā)表于 2025-3-24 21:46:14 | 只看該作者
New Representation and Algorithm for Drawing RNA Structure with Pseudoknots*nd a possibly nonplanar graph) with inner cycles within a pseudoknot as well as possible outer cycles formed between a pseudoknot and other structural elements. Thus, drawing RNA pseudoknot structures is computationally more difficult than depicting RNA secondary structures. Although several algorit
20#
發(fā)表于 2025-3-25 00:09:21 | 只看該作者
 關(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|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 23:14
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
津市市| 满城县| 山东省| 襄汾县| 申扎县| 临朐县| 承德市| 韩城市| 大理市| 枣庄市| 安福县| 万全县| 咸宁市| 来安县| 镇宁| 晋宁县| 舞钢市| 定州市| 邢台县| 遂川县| 电白县| 大竹县| 阜宁县| 镇雄县| 义乌市| 资阳市| 永登县| 沛县| 杭州市| 广安市| 六盘水市| 启东市| 台州市| 中西区| 珲春市| 崇左市| 秦皇岛市| 米脂县| 集安市| 浮梁县| 巩义市|