首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Association Rule Granulation using Rough Sets on Intuitionistic Fuzzy Approximation Spaces and Granular Computing
  • 本地全文:下载
  • 作者:B. K. Tripathy ; D. P. Acharjya
  • 期刊名称:Annals. Computer Science Series
  • 印刷版ISSN:1583-7165
  • 电子版ISSN:2065-7471
  • 出版年度:2011
  • 卷号:9
  • 期号:1
  • 页码:125-144
  • 出版社:Mirton Publishing House, Timisoara
  • 摘要:Association rule granulation is a common data mining technique used to extract knowledge from the universe. To characterize the elements of the universe and to extract knowledge about the universe we classify the elements of the universe based on indiscernibility relation. However, in many information systems we find numerical attribute values that are almost similar instead of full identical. To handle such type of information system, we use (alfa, beta)-indiscernibility due to rough set on intuitionistic fuzzy approximation space with ordering rules. So, the classification results in a set of classes called granules and are basic building blocks of the knowledge about the universe. Granular computing processes these granules and produces possible patterns and associations. In this paper we study the concept of almost indiscernibility and knowledge granulation along with the association rules using granular computing method. We process the granules obtained as the result of classification and find the association rules between them
  • 关键词:Association rules; indiscernibility; rough sets;ordering rules; granule; granular computing
国家哲学社会科学文献中心版权所有