找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam; Volume 2 Andrzej Skowron,Zbigniew Suraj Book 2013 Springer-Verl

[复制链接]
楼主: Lincoln
发表于 2025-3-30 12:16:31 | 显示全部楼层
发表于 2025-3-30 15:37:40 | 显示全部楼层
Uncertainty Problem Processing with Covering Generalized Rough Sets, the application of covering generalized rough set theory is discussed rarely. In this chapter, two typical uncertainty problems, incomplete information processing, and fuzzy decision making, are discussed from the view of covering generalized rough set theory.
发表于 2025-3-30 19:32:50 | 显示全部楼层
发表于 2025-3-30 23:19:11 | 显示全部楼层
发表于 2025-3-31 00:53:31 | 显示全部楼层
The Impact Rules of Recommendation Sources for Adoption Intention of Micro-blog Based on DRSA with s and potential users. The analysis is grounded in the taxonomy of induction-related activities using a DRSA with flow network graph to infer the usage of micro-blogs decision rules. Finally, the study of the nature of micro-blog reflects essential practical and academic value in real world.
发表于 2025-3-31 05:51:29 | 显示全部楼层
发表于 2025-3-31 11:30:39 | 显示全部楼层
发表于 2025-3-31 13:59:45 | 显示全部楼层
Comparison of Greedy Algorithms for Decision Tree Optimization,nterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics.
发表于 2025-3-31 19:01:05 | 显示全部楼层
Comparison of Greedy Algorithms for Decision Tree Optimization,struction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of no
发表于 2025-3-31 22:29:57 | 显示全部楼层
A Review of the Knowledge Granulation Methods: Discrete vs. Continuous Algorithms,d with the Rough Set Theory, which was proposed by Professor Zdzisław Pawlak in 1982. Granular rough computing is a paradigm in which one deals with granules that are aggregates of objects connected together by some form of similarity. In the rough set theory granules are traditionally defined as in
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 11:03
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表