| Discovering a cover set of ARsi with hierarchy from quantitative databases | |
| Yan, P ; Chen, GQ | |
| 2010-05-11 ; 2010-05-11 | |
| 关键词 | association rules fuzzy implication hierarchy rule cover set ASSOCIATION RULES Computer Science, Information Systems |
| 中文摘要 | This paper extends the work on discovering fuzzy association rules with degrees of support and implication (ARsi). The effort is twofold: one is to discover ARsi with hierarchy so as to express more semantics due to the fact that hierarchical relationships usually exist among fuzzy sets associated with the attribute concerned; the other is to generate a "core" set of rules, namely the rule cover set, that are of more interest in a sense that all other rules could be derived by the cover set. Corresponding algorithms for ARsi with hierarchy and the cover set are proposed along with pruning strategies incorporated to improve the computational efficiency. Some data experiments are conducted as well to show the effectiveness of the approach. (c) 2005 Elsevier Inc. All rights reserved. |
| 语种 | 英语 ; 英语 |
| 出版者 | ELSEVIER SCIENCE INC ; NEW YORK ; 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/26221]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | Yan, P,Chen, GQ. Discovering a cover set of ARsi with hierarchy from quantitative databases[J],2010, 2010. |
| APA | Yan, P,&Chen, GQ.(2010).Discovering a cover set of ARsi with hierarchy from quantitative databases.. |
| MLA | Yan, P,et al."Discovering a cover set of ARsi with hierarchy from quantitative databases".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论