QQ客服 官方微博 反馈留言

	图支配集问题的粗糙集属性约简方法; An Attribute Reduction Method Based on Rough Sets for Dominating Sets of Graph
	谭安辉 ; 李进金 ; 陈锦坤 ; 林国平
	2015-06-15
关键词	粗糙集 信息系统 属性约简 图 支配集 信息熵 Rough Set Information System Attribute Reduction Graph Dominating Set Information Entropy
英文摘要	探讨粗糙集的属性约简和图的支配集问题之间的联系.通过构造信息系统,将粗糙集的属性约简问题与图的支配集问题相联系,从而把图的支配集问题转化为粗糙集的属性约简问题.首先证明图的极小支配集恰是其构造的信息系统的属性约简,然后提出一种基于信息熵的最小支配集算法,最后通过实例验证该算法的可行性和有效性.; The relationship between attribute reduction problem in rough sets and dominating set problem in graph is discussed.By constructing an information system,the attribute reduction problem in rough sets is associated with the dominating set problem in graph,so as to transformed the dominating set problem into the attribute reduction problem.Firstly,it is proved that the minimal dominating set of a graph is exactly the attribute reduction of the constructed information system.Then,a minimum dominating set algorithm based on information entropy is proposed.Finally,A practical example illustrates the feasibility and efficiency of the proposed algorithm.; 国家自然科学基金项目(No.61379021;11301367;11061004)资助
语种	zh_CN
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/119934]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	谭安辉,李进金,陈锦坤,等. 图支配集问题的粗糙集属性约简方法, An Attribute Reduction Method Based on Rough Sets for Dominating Sets of Graph[J],2015.
APA	谭安辉,李进金,陈锦坤,&林国平.(2015).图支配集问题的粗糙集属性约简方法..
MLA	谭安辉,et al."图支配集问题的粗糙集属性约简方法".(2015).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。