一种基于粗糙集的面向知识聚类技术

S. Hirano, S. Tsumoto
{"title":"一种基于粗糙集的面向知识聚类技术","authors":"S. Hirano, S. Tsumoto","doi":"10.1109/CMPSAC.2001.960679","DOIUrl":null,"url":null,"abstract":"Presents a knowledge-oriented clustering method based on rough set theory. The method evaluates the simplicity of classification knowledge during the clustering process and produces readable clusters reflecting the global features of objects. The method uses a newly-introduced measure, the indiscernibility degree, to evaluate the importance of equivalence relations that are related to the roughness of the classification knowledge. The indiscernibility degree is defined as the ratio of equivalence relations that gives a common classification to the two objects under consideration. The two objects can be classified into the same class if they have a high indiscernibility degree, even in the presence of equivalence relations which differentiate these objects. Ignorance of such equivalence relations is related to the generalization of knowledge, and it yields simple clusters that can be represented by simple knowledge. An experiment was performed on artificially created numerical data sets. The results showed that objects were classified into the expected clusters if modification was performed, whereas they were classified into many small categories without modification.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A knowledge-oriented clustering technique based on rough sets\",\"authors\":\"S. Hirano, S. Tsumoto\",\"doi\":\"10.1109/CMPSAC.2001.960679\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a knowledge-oriented clustering method based on rough set theory. The method evaluates the simplicity of classification knowledge during the clustering process and produces readable clusters reflecting the global features of objects. The method uses a newly-introduced measure, the indiscernibility degree, to evaluate the importance of equivalence relations that are related to the roughness of the classification knowledge. The indiscernibility degree is defined as the ratio of equivalence relations that gives a common classification to the two objects under consideration. The two objects can be classified into the same class if they have a high indiscernibility degree, even in the presence of equivalence relations which differentiate these objects. Ignorance of such equivalence relations is related to the generalization of knowledge, and it yields simple clusters that can be represented by simple knowledge. An experiment was performed on artificially created numerical data sets. The results showed that objects were classified into the expected clusters if modification was performed, whereas they were classified into many small categories without modification.\",\"PeriodicalId\":269568,\"journal\":{\"name\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"volume\":\"148 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.2001.960679\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.2001.960679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

提出了一种基于粗糙集理论的面向知识的聚类方法。该方法在聚类过程中评估分类知识的简单性,并产生反映对象全局特征的可读聚类。该方法使用了一种新引入的度量,即不可分辨度,来评价与分类知识的粗糙度相关的等价关系的重要性。不可分辨度的定义是等价关系的比率,使所考虑的两个对象具有共同的分类。如果两个对象具有很高的不可区分度,即使存在区分这两个对象的等价关系,也可以将它们归类为同一类。忽略这种等价关系与知识的泛化有关,它产生了可以用简单知识表示的简单聚类。在人工创建的数值数据集上进行了实验。结果表明,如果对目标进行修改,则可以将目标分类到预期的聚类中,而不进行修改则可以将目标分类到许多小的类别中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A knowledge-oriented clustering technique based on rough sets
Presents a knowledge-oriented clustering method based on rough set theory. The method evaluates the simplicity of classification knowledge during the clustering process and produces readable clusters reflecting the global features of objects. The method uses a newly-introduced measure, the indiscernibility degree, to evaluate the importance of equivalence relations that are related to the roughness of the classification knowledge. The indiscernibility degree is defined as the ratio of equivalence relations that gives a common classification to the two objects under consideration. The two objects can be classified into the same class if they have a high indiscernibility degree, even in the presence of equivalence relations which differentiate these objects. Ignorance of such equivalence relations is related to the generalization of knowledge, and it yields simple clusters that can be represented by simple knowledge. An experiment was performed on artificially created numerical data sets. The results showed that objects were classified into the expected clusters if modification was performed, whereas they were classified into many small categories without modification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信