| 两类关联约简构造性算法研究 |
| |
| 引用本文： | 姚荷岚,苗夺谦,周杰.两类关联约简构造性算法研究[J].计算机工程与应用,2010,46(29):127-130. |
| |
| 作者姓名： | 姚荷岚 苗夺谦 周杰 |
| |
| 作者单位： | 同济大学,嵌入式系统与服务计算教育部重点实验室,上海,201804;同济大学,电子与信息工程学院,计算机科学与技术系,上海,201804 |
| |
| 基金项目： | 国家自然科学基金，教育部博士点专项基金 |
| |
| 摘 要： | 关联约简由Dominik首次提出，其采用粗糙集理论属性约简思想，从全局属性依赖的角度，挖掘出信息系统中所隐含的关联规则。由于求取给定信息系统所有关联约简和最优关联约简已被证明为NP-难问题，针对特定属性（事务）给出了两类关联约简构造性算法：Multi-Single算法和Single-Multi算法，从而挖掘出针对特定事务的关联规则，有益于综合评价各事务在信息系统中的作用。实例分析表明了所提算法的有效性。
|
| 关 键 词： | 关联约简 关联规则 粗糙集 属性约简 |
| 收稿时间： | 2009-7-3 |
| 修稿时间： | 2009-9-27
|
Constructive algorithms for two kinds of association reducts |
| |
| YAO He-lan,MIAO Duo-qian,ZHOU Jie.Constructive algorithms for two kinds of association reducts[J].Computer Engineering and Applications,2010,46(29):127-130. |
| |
| Authors: | YAO He-lan MIAO Duo-qian ZHOU Jie |
| |
| Affiliation: | 1.Key Laboratory of Embedded System ＆ Service Computing,Ministry of Education of China,Tongji University,Shanghai 201804,China; 2.Department of Computer Science and Technology,Tongji University,Shanghai 201804,China) |
| |
| Abstract: | The concept of association reduct is firstly introduced by Dominik, which adopts the notion of attribute reduction in rough sets.It aims to mine all association rules from the perspective of global dependencies between attributes in an information system.Since obtaining all association reducts or most informative association reduets has been proved to be NP-hard, two kinds of constructive algorithms for a specific attribute （or considered as a transaction） are put forward, namely, Multi-Single algorithm and Single-Multi algorithm.With these algorithms, some special association rules can be mined, which will be beneficial for evaluating transactions in a given information system.The validity of the proposed algorithms is illustrated by an example. |
| |
| Keywords: | association reducts association rules rough sets attribute reduction |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
