全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

?全覆盖粒计算模型的粒化、知识逼近及其算子性质研究

DOI: 10.13232/j.cnki.jnju.2015.01.015, PP. 105-110

Keywords: 粒计算,全覆盖,邻域系统,内点算子,闭包算子

Full-Text   Cite this paper   Add to My Lib

Abstract:

?粒计算(grc)作为处理不精确、不确定、不完备信息的重要工具,其基本思想是粒化、粒的运算和粒运算结果的融合.部分覆盖是粒计算理论框架中的一种重要模型,在电脑安全、搜索引擎和客户评估等领域具有潜在应用价值.全覆盖是部分覆盖的一种特例,已有的研究是从粗糙集理论的角度开展的,这是一种点集拓扑观念下的全覆盖.本文在pre-topology理论的框架下,从粒化、知识逼近和算子性质三个方面,首先介绍了邻域系统的相关定义,并在邻域系统基础之上提出了粒、全覆盖粒计算、全覆盖近似空间的概念;然后借助pre-topology空间中内点和闭包算子的概念,在全覆盖近似空间中利用已定义的粒重新诠释了内点和闭包算子,对全覆盖粒计算模型中的任意对象进行知识逼近,并用算例来说明;最后探究了全覆盖粒计算模型中这对逼近算子满足的基本性质,并证明了所提性质,为以后设计基于全覆盖粒计算模型的特征选择算法提供了理论基础.

References

[1]  hobbsjr.granularity.in:proceedingsofthe9thinternationaljointconferenceonartificialintelligence,morgankaufmannpublishersinc,1985:432~435.
[2]  linty.granularcomputing:fromroughsetsandneighbourhoodsystemstoinformationgranulationandcomputingwithwords.europeancongressonintelligenttechniquesandsoftcomputing,1997:1602~1606.
[3]  linty.granularcomputingonbinaryrelationsi:dataminingandneighbourhoodsystems,ii:roughsetrepresentationsandbelieffunctions,roughsetsinknowledgediscovery.physica-verlag,1998:107~140.
[4]  linty.uncertaintyandknowledgetheoriesneweraingranularcomputing.in:2012ieeeinternationalconferenceongranularcomputing,ieee,2012:2~11.
[5]  yaoyy.threeperspectivesofgranularcomputing.journalofnanchanginstituteoftechnology,2006,25(2):16~21.
[6]  wanggy,huf,huangh,etal.agranularcomputingmodelbasedontolerancerelation.thejournalofchinauniversitiesofpostsandtelecommunications,2005,12(3):86~90.
[7]  王国胤,张清华,马希骜等.知识不确定性问题粒计算模型.软件学报,2011(04):676~694.
[8]  qianyh,liangjy,yaoyy,etal.mgrs:amulti-granulationroughset.informationsciences,2010,180(6):949~970.
[9]  王丽娟,杨习贝,杨静宇等.一种新的不完备多粒度粗糙集.南京大学学报(自然科学),2012,48(4):436~444.
[10]  linty.granularcomputing:practices,theories,andfuturedirections.encyclopediaofcomplexityandsystemsscience,2008:4339~4355.
[11]  zakowskiw.approximationsinthespace(u,π).demonstratiomathematica,1983,16(40):761~769.
[12]  bonikowskiz,bryniarskie,wybraniec-skardowskau.extensionsandintentionsintheroughsettheory.informationsciences,1998,107(1):149~167.
[13]  tsangecc,chend,leejwt,etal.ontheupperapproximationsofcoveringgeneralizedroughsets.in:proceedingsof2004internationalconferenceonmachinelearningandcybernetics,ieee,2004,7:4200~4203.
[14]  zadehla.fuzzysetsandinformationgranularity,advancesinfuzzysettheoryandapplications.amsterdam:north-hollandpublishing,1979:745.
[15]  苗夺谦,王国胤,刘清等.粒计算:过去、现在与展望.北京:科学出版社,2007:373.
[16]  pawlakz.roughsets.internationaljournalofinformationandcomputersciences,1982,11(5):341~356.
[17]  zadehl.a.fuzzylogic=computingwithwords.ieeetransactionsonfuzzysystems,1996(4):103~111.
[18]  张铃,张钹.模糊商空间理论(模糊粒度计算方法).软件学报,2003,14(4):770~776.
[19]  yaoyy.apartitionmodelofgranularcomputing.lncstransactionsonroughsets,springer,2004(1):232~253.
[20]  zhuw.relationshipbetweengeneralizedroughsetsbasedonbinaryrelationandcovering.informationsciences,2009,179(3):210~225.
[21]  zhuw,wangfy.anewtypeofcoveringroughsets.intelligentsystems,2006(6):444~449.
[22]  zhuw,wangfy.reductionandaxiomizationofcoveringgeneralizedroughsets.informationsciences,2003,152,217~230.
[23]  linty,syauyr.granularmathematicsfoundationandcurrentstate.in:2012ieeeinternationalconferenceongranularcomputing,ieee,2011:4~12.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133