找回密碼
 To register

QQ登錄

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

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

打印 上一主題 下一主題

Titlebook: Rough Set and Knowledge Technology; 6th International Co JingTao Yao,Sheela Ramanna,Zbigniew Suraj Conference proceedings 2011 Springer-Ver

[復(fù)制鏈接]
樓主: 大小
51#
發(fā)表于 2025-3-30 10:22:30 | 只看該作者
52#
發(fā)表于 2025-3-30 15:58:59 | 只看該作者
An Efficient Fuzzy Rough Approach for Feature Selection deal with the continuous values. However, the cost of computation of the approach is too high to be worked out as the number of selected features increases. In this paper, a new computational method is proposed to approximate the conditional mutual information between the selected features and the
53#
發(fā)表于 2025-3-30 17:30:48 | 只看該作者
Partitions, Coverings, Reducts and Rule Learning in Rough Set Theoryance relations or coverings to an incomplete table. Such associations are sometimes misleading. We argue that Pawlak three-step approach for data analysis indeed uses both partitions and coverings for a complete information table. A slightly different formulation of Pawlak approach is given based on
54#
發(fā)表于 2025-3-30 23:21:17 | 只看該作者
55#
發(fā)表于 2025-3-31 04:04:51 | 只看該作者
56#
發(fā)表于 2025-3-31 07:06:39 | 只看該作者
Mining Incomplete Data—A Rough Set Approacheralization of the elementary set well-known in rough set theory, may be computed using such blocks. For incomplete data sets three different types of global approximations: singleton, subset and concept are defined. Additionally, for incomplete data sets a local approximation is defined as well.
57#
發(fā)表于 2025-3-31 10:52:27 | 只看該作者
Applications of Approximate Reducts to the Feature Selection Problem We also propose a new algorithm, called Rough Attribute Ranker. In our approach, the usefulness of features is measured by their impact on quality of the reducts that contain them. We experimentally compare the reduct-based methods with several classic attribute rankers using synthetic, as well as real-life high dimensional datasets.
58#
發(fā)表于 2025-3-31 14:52:29 | 只看該作者
A Constructive Feature Induction Mechanism Founded on Evolutionary Strategies with Fitness Functionsem being solved is founded on coefficients for values of existing attributes determined empirically using evolutionary strategies with fitness functions based on parameters calculated from decision trees generated for extended decision tables.
59#
發(fā)表于 2025-3-31 21:16:38 | 只看該作者
60#
發(fā)表于 2025-3-31 23:28:39 | 只看該作者
https://doi.org/10.1007/978-3-642-24425-4complex networks; decision support systems; fuzzy rough sets; quality of service (QoS); similarity measu
 關(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, 2026-1-20 00:45
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
南丰县| 上饶县| 张家口市| 华池县| 柳州市| 开鲁县| 阳东县| 洛扎县| 湖北省| 页游| 辉县市| 大荔县| 阿鲁科尔沁旗| 深圳市| 手游| 开原市| 枝江市| 都匀市| 武强县| 当涂县| 云梦县| 修文县| 永登县| 库尔勒市| 永丰县| 益阳市| 永州市| 偃师市| 巫山县| 田阳县| 雷山县| 固原市| 手游| 图木舒克市| 磐安县| 鹰潭市| 鲁山县| 萍乡市| 定远县| 哈尔滨市| 孟津县|