High impact event processing using incremetal clustering in unsupervised feature space through genetic algorithm by selective repeat ARQ protocol

P. Sethi, C. Dash
{"title":"High impact event processing using incremetal clustering in unsupervised feature space through genetic algorithm by selective repeat ARQ protocol","authors":"P. Sethi, C. Dash","doi":"10.1109/ICCCT.2011.6075159","DOIUrl":null,"url":null,"abstract":"High impact event represents the information which are frequently used. The frequently used information is maintained in different clusters such that it can be accessed quickly without involving much searching time. Clustering methods are one of the key steps that lead to the transformation of data to knowledge. Clustering algorithms aims at partitioning an initial set of objects into disjoint groups (clusters) such that objects in the same subset are more similar to each other than objects in different groups. In this paper we present a generalization of the k-Windows clustering algorithm in metric spaces by following a selective Repeat ARQ protocol having fixed window size for accurate information transmission. The original algorithm was designed to work on data with numerical values. The proposed generalization does not assume anything about the nature of the data, but only considers the distance function over the data set. The efficiency of the proposed approach is demonstrated on msnbc data sets. Genetic algorithm approach is used to detect and predict high-impact events in different areas such as automotive manufacturing, networking for data transmission, etc. While the high-impact events occurs infrequently, they are quite costly, means they have high-impact on the system key performance indicator. This approach is based on mining these types of events and its impact on the total process execution. The classified data are clustered for future implementation which have similar feature. Due to the clustering concept the clustered data can be used for various applications, which makes it robust. The parameters are optimized for best solution. This approach is tested on high impact events that occurs in networking, during transmission and it was found to be robust, highly accurate and with less probability of fault, for prediction of future occurrences of such events.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT.2011.6075159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

High impact event represents the information which are frequently used. The frequently used information is maintained in different clusters such that it can be accessed quickly without involving much searching time. Clustering methods are one of the key steps that lead to the transformation of data to knowledge. Clustering algorithms aims at partitioning an initial set of objects into disjoint groups (clusters) such that objects in the same subset are more similar to each other than objects in different groups. In this paper we present a generalization of the k-Windows clustering algorithm in metric spaces by following a selective Repeat ARQ protocol having fixed window size for accurate information transmission. The original algorithm was designed to work on data with numerical values. The proposed generalization does not assume anything about the nature of the data, but only considers the distance function over the data set. The efficiency of the proposed approach is demonstrated on msnbc data sets. Genetic algorithm approach is used to detect and predict high-impact events in different areas such as automotive manufacturing, networking for data transmission, etc. While the high-impact events occurs infrequently, they are quite costly, means they have high-impact on the system key performance indicator. This approach is based on mining these types of events and its impact on the total process execution. The classified data are clustered for future implementation which have similar feature. Due to the clustering concept the clustered data can be used for various applications, which makes it robust. The parameters are optimized for best solution. This approach is tested on high impact events that occurs in networking, during transmission and it was found to be robust, highly accurate and with less probability of fault, for prediction of future occurrences of such events.
基于选择性重复ARQ协议的遗传算法的无监督特征空间增量聚类高影响事件处理
高影响事件代表了频繁使用的信息。经常使用的信息保存在不同的集群中,这样可以快速访问,而不需要花费太多的搜索时间。聚类方法是将数据转化为知识的关键步骤之一。聚类算法旨在将一组初始对象划分为不相交的组(簇),从而使同一子集中的对象比不同组中的对象更相似。在本文中,我们提出了k-窗聚类算法在度量空间中的推广,遵循具有固定窗口大小的选择性重复ARQ协议,以实现准确的信息传输。最初的算法是设计用来处理数值数据的。提出的泛化不假设数据的性质,而只考虑数据集上的距离函数。在msnbc数据集上验证了该方法的有效性。遗传算法方法用于检测和预测不同领域的高影响事件,如汽车制造、数据传输网络等。虽然高影响事件很少发生,但它们的成本很高,这意味着它们对系统关键性能指标有很大影响。此方法基于挖掘这些类型的事件及其对整个流程执行的影响。对分类后的数据进行聚类处理,便于以后实现具有相似特征的数据。由于聚类概念,聚类数据可以用于各种应用程序,这使其具有鲁棒性。对参数进行了优化,以获得最佳解。该方法在网络传输过程中发生的高影响事件上进行了测试,结果表明,该方法对于预测此类事件的未来发生具有鲁棒性、高度准确性和较低的故障概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信