轻快来事
发表于 2025-3-30 12:16:31
http://reply.papertrans.cn/84/8320/831911/831911_51.png
Obliterate
发表于 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.
penance
发表于 2025-3-30 19:32:50
http://reply.papertrans.cn/84/8320/831911/831911_53.png
Bravura
发表于 2025-3-30 23:19:11
http://reply.papertrans.cn/84/8320/831911/831911_54.png
cardiopulmonary
发表于 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.
TOM
发表于 2025-3-31 05:51:29
http://reply.papertrans.cn/84/8320/831911/831911_56.png
悬崖
发表于 2025-3-31 11:30:39
http://reply.papertrans.cn/84/8320/831911/831911_57.png
MEAN
发表于 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.
FLAX
发表于 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
GOUGE
发表于 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