找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: foresight
发表于 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.
发表于 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
发表于 2025-3-23 20:42:32 | 显示全部楼层
发表于 2025-3-23 22:53:18 | 显示全部楼层
发表于 2025-3-24 05:11:29 | 显示全部楼层
发表于 2025-3-24 06:53:23 | 显示全部楼层
发表于 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
发表于 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
发表于 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
发表于 2025-3-25 00:09:21 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 09:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表