版塊導航: 正在加載中...

登錄注冊

應《網(wǎng)絡安全法》要求，自2017年10月1日起，未進行實名認證將不得使用互聯(lián)網(wǎng)跟帖服務。為保障您的帳號能夠正常使用，請盡快對帳號進行手機號驗證，感謝您的理解與支持！

24小時熱門版塊排行榜

返回列表

本帖產(chǎn)生 1 個，點擊這里進行查看

dance2012

銀蟲 (正式寫手)

應助: 4 (幼兒園)
金幣: 275.9
散金: 1411
紅花: 11
帖子: 848
在線: 415.4小時
蟲號: 2487378
注冊: 2013-05-29
性別: GG
專業(yè): 組合數(shù)學

[求助] 求文獻是否EI收錄？謝謝

1.Bin Yang, William Zhu. Covering-based rough sets on covering-circuit matroids. in FSKD 2014, 48-53.

回復此樓

» 猜你喜歡

284求調(diào)劑已經(jīng)有10人回復
一志愿山東大學藥學學碩求調(diào)劑已經(jīng)有4人回復
07化學280分求調(diào)劑已經(jīng)有4人回復
298-一志愿中國農(nóng)業(yè)大學-求調(diào)劑已經(jīng)有12人回復
求材料，環(huán)境專業(yè)調(diào)劑已經(jīng)有3人回復
335求調(diào)劑已經(jīng)有5人回復
求調(diào)劑已經(jīng)有7人回復
一志愿吉大化學322求調(diào)劑已經(jīng)有4人回復
環(huán)境學碩288求調(diào)劑已經(jīng)有8人回復
341求調(diào)劑(一志愿湖南大學070300) 已經(jīng)有6人回復

NPs，NGs！

1樓 2015-02-28 20:30:07

已閱回復此樓關(guān)注TA 給TA發(fā)消息送TA紅花 TA的回帖

Paulwolf

榮譽版主 (文壇精英)

非線性控制領域新人一枚

專家經(jīng)驗: +178
應助: 317 (大學生)
貴賓: 4.423
金幣: 310300
散金: 17942
紅花: 554
沙發(fā): 3382
帖子: 35712
在線: 4027.9小時
蟲號: 3131175
注冊: 2014-04-12
專業(yè): 控制理論與方法
管轄: 學術(shù)會議

【答案】應助回帖

★ ★ ★ ★ ★
感謝參與，應助指數(shù) +1
dance2012: 金幣+5, ★★★★★最佳答案, 謝謝 2015-02-28 20:34:04
sunshan4379: LS-EPI+1, 感謝應助！ 2015-03-01 10:33:44

Accession number:
20150200418393
Title: Covering-based rough sets on covering-circuit matroids
Authors: Yang, Bin1 Email author yangbin-0906tdcq@126.com; Zhu, William1 Email author williamfengzhu@gmail.com
Author affiliation: 1 Lab of Granular Computing, Minnan Normal University, Zhangzhou, China
Corresponding author: Yang, Bin
Source title: 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2014
Abbreviated source title: Int. Conf. Fuzzy Syst. Knowl. Discov., FSKD
Issue date: December 9, 2014
Publication year: 2014
Pages: 49-54
Article number: 6980805
Language: English
ISBN-13: 9781479951482
Document type: Conference article (CA)
Conference name: 2014 11th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2014
Conference date: August 19, 2014 - August 21, 2014
Conference location: Xiamen, China
Conference code: 109675
Publisher: Institute of Electrical and Electronics Engineers Inc.
Abstract: Rough set theory has been proposed by Pawlak as a useful and powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. Matroid theory is a branch of combinatorial mathematics and widely used in optimization. Therefore, it is a good idea to integrate rough sets with matroids. In this paper, four types of covering approximation operators and their relationships are studied from the viewpoint of matroids. First, we define a new type of matroids named covering-circuit matroids whose all circuits form a covering. Second, for a covering-circuit matroid, we study the properties of the circuits of it from the perspective of coverings. Third, four types of covering approximation operators are represented by the circuits of the covering-circuit matroids. Moreover, we also investigate the relationships among four covering upper approximation operators. Finally, the conditions under which every type of covering upper approximation operator is the closure operator of the matroid are revealed. These results show many potential connections between covering-based rough sets and matroids. © 2014 IEEE.
Number of references: 21
Main heading: Rough set theory
Controlled terms: Approximation algorithms  -  Combinatorial mathematics  -  Electric network analysis  -  Formal logic  -  Matrix algebra  -  Networks (circuits)  -  Set theory
Uncontrolled terms: Approximation operators  -  Circuit matroid  -  Closure operators  -  covering  -  matroid  -  Matroid theory  -  Upper approximation
Classification code: 703.1 Electric Networks -  703.1.1 Electric Network Analysis -  721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory -  921 Mathematics
DOI: 10.1109/FSKD.2014.6980805
Database: Compendex
Compilation and indexing terms, © 2015 Elsevier Inc.

回復此樓

2樓2015-02-28 20:30:41