增量归纳规则聚类

A. Chemchem, Y. Djenouri, H. Drias
{"title":"增量归纳规则聚类","authors":"A. Chemchem, Y. Djenouri, H. Drias","doi":"10.1109/WOSSPA.2013.6602413","DOIUrl":null,"url":null,"abstract":"The current world wide web is featured by a huge volume of knowledge, making it possible to apply knowledge mining to extract meta-knowledge. This paper explores this possibility and considers knowledge discovery process acceleration. Given that knowledge is extracted from data, knowledge mining process would be similar to data mining. However, knowledge representation is more complex than data representation. Homogeneous knowledge, such as induction rules, should thus be mined first. An extension of k-means algorithm is proposed, which clusters induction rules using a new similarity measure. On the other hand, induction rules are continually and dynamically acquired, e.g. agent concept. It is more efficient for the discovery process to incrementally mine induction rules. Three incremental induction rule clustering approaches are developed. These approaches have been tested using three benchmarks, and their clustering performance has been investigated. Results are satisfactory and show from 70% to 90% of success rate.","PeriodicalId":417940,"journal":{"name":"2013 8th International Workshop on Systems, Signal Processing and their Applications (WoSSPA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Incremental induction rules clustering\",\"authors\":\"A. Chemchem, Y. Djenouri, H. Drias\",\"doi\":\"10.1109/WOSSPA.2013.6602413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The current world wide web is featured by a huge volume of knowledge, making it possible to apply knowledge mining to extract meta-knowledge. This paper explores this possibility and considers knowledge discovery process acceleration. Given that knowledge is extracted from data, knowledge mining process would be similar to data mining. However, knowledge representation is more complex than data representation. Homogeneous knowledge, such as induction rules, should thus be mined first. An extension of k-means algorithm is proposed, which clusters induction rules using a new similarity measure. On the other hand, induction rules are continually and dynamically acquired, e.g. agent concept. It is more efficient for the discovery process to incrementally mine induction rules. Three incremental induction rule clustering approaches are developed. These approaches have been tested using three benchmarks, and their clustering performance has been investigated. Results are satisfactory and show from 70% to 90% of success rate.\",\"PeriodicalId\":417940,\"journal\":{\"name\":\"2013 8th International Workshop on Systems, Signal Processing and their Applications (WoSSPA)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 8th International Workshop on Systems, Signal Processing and their Applications (WoSSPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOSSPA.2013.6602413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th International Workshop on Systems, Signal Processing and their Applications (WoSSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOSSPA.2013.6602413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

当前的万维网具有海量知识的特点,这使得利用知识挖掘来提取元知识成为可能。本文探讨了这种可能性,并考虑了知识发现过程的加速。由于知识是从数据中提取的,因此知识挖掘过程与数据挖掘过程类似。然而,知识表示比数据表示更为复杂。因此,应该首先挖掘同构知识,例如归纳规则。提出了k-means算法的扩展,该算法使用一种新的相似度度量对归纳规则进行聚类。另一方面,归纳规则是连续动态获取的,如智能体概念。增量挖掘归纳规则的发现过程效率更高。提出了三种增量归纳规则聚类方法。已经使用三个基准测试对这些方法进行了测试,并研究了它们的聚类性能。结果令人满意,成功率为70% ~ 90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Incremental induction rules clustering
The current world wide web is featured by a huge volume of knowledge, making it possible to apply knowledge mining to extract meta-knowledge. This paper explores this possibility and considers knowledge discovery process acceleration. Given that knowledge is extracted from data, knowledge mining process would be similar to data mining. However, knowledge representation is more complex than data representation. Homogeneous knowledge, such as induction rules, should thus be mined first. An extension of k-means algorithm is proposed, which clusters induction rules using a new similarity measure. On the other hand, induction rules are continually and dynamically acquired, e.g. agent concept. It is more efficient for the discovery process to incrementally mine induction rules. Three incremental induction rule clustering approaches are developed. These approaches have been tested using three benchmarks, and their clustering performance has been investigated. Results are satisfactory and show from 70% to 90% of success rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信