GSOM序列:时间数据中知识发现的无监督动态方法

A. Fonseka, D. Alahakoon, S. Bedingfield
{"title":"GSOM序列:时间数据中知识发现的无监督动态方法","authors":"A. Fonseka, D. Alahakoon, S. Bedingfield","doi":"10.1109/CIDM.2011.5949456","DOIUrl":null,"url":null,"abstract":"A significant problem which arises during the process of knowledge discovery is dealing with data which have temporal dependencies. The attributes associated with temporal data need to be processed differently from non temporal attributes. A typical approach to address this issue is to view temporal data as an ordered sequence of events. In this work, we propose a novel dynamic unsupervised learning approach to discover patterns in temporal data. The new technique is based on the Growing Self-Organization Map (GSOM), which is a structure adapting version of the Self-Organizing Map (SOM). The SOM is widely used in knowledge discovery applications due to its unsupervised learning nature, ease of use and visualization capabilities. The GSOM further enhances the SOM with faster processing, more representative cluster formation and the ability to control map spread. This paper describes a significant extension to the GSOM enabling it to be used to for analyzing data with temporal sequences. The similarity between two time dependent sequences with unequal length is estimated using the Dynamic Time Warping (DTW) algorithm incorporated into the GSOM. Experiments were carried out to evaluate the performance and the validity of the proposed approach using an audio-visual data set. The results demonstrate that the novel “GSOM Sequence” algorithm improves the accuracy and validity of the clusters obtained.","PeriodicalId":211565,"journal":{"name":"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"GSOM sequence: An unsupervised dynamic approach for knowledge discovery in temporal data\",\"authors\":\"A. Fonseka, D. Alahakoon, S. Bedingfield\",\"doi\":\"10.1109/CIDM.2011.5949456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A significant problem which arises during the process of knowledge discovery is dealing with data which have temporal dependencies. The attributes associated with temporal data need to be processed differently from non temporal attributes. A typical approach to address this issue is to view temporal data as an ordered sequence of events. In this work, we propose a novel dynamic unsupervised learning approach to discover patterns in temporal data. The new technique is based on the Growing Self-Organization Map (GSOM), which is a structure adapting version of the Self-Organizing Map (SOM). The SOM is widely used in knowledge discovery applications due to its unsupervised learning nature, ease of use and visualization capabilities. The GSOM further enhances the SOM with faster processing, more representative cluster formation and the ability to control map spread. This paper describes a significant extension to the GSOM enabling it to be used to for analyzing data with temporal sequences. The similarity between two time dependent sequences with unequal length is estimated using the Dynamic Time Warping (DTW) algorithm incorporated into the GSOM. Experiments were carried out to evaluate the performance and the validity of the proposed approach using an audio-visual data set. The results demonstrate that the novel “GSOM Sequence” algorithm improves the accuracy and validity of the clusters obtained.\",\"PeriodicalId\":211565,\"journal\":{\"name\":\"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIDM.2011.5949456\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2011.5949456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在知识发现过程中出现的一个重要问题是如何处理具有时间依赖性的数据。与时态数据相关联的属性需要与非时态属性进行不同的处理。解决此问题的典型方法是将时间数据视为有序的事件序列。在这项工作中,我们提出了一种新的动态无监督学习方法来发现时间数据中的模式。这种新技术基于生长自组织图(growth Self-Organization Map, GSOM),它是自组织图(Self-Organizing Map, SOM)的结构适应版本。SOM由于其无监督学习的特性、易用性和可视化能力而广泛应用于知识发现应用。GSOM以更快的处理速度、更具代表性的集群形成和控制地图扩展的能力进一步增强了SOM。本文描述了对GSOM的一个重要扩展,使其能够用于分析具有时间序列的数据。将动态时间翘曲(DTW)算法引入到GSOM中,估计了两个不等长时变序列之间的相似度。利用视听数据集进行了实验,以评估该方法的性能和有效性。结果表明,“GSOM序列”算法提高了聚类的准确性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GSOM sequence: An unsupervised dynamic approach for knowledge discovery in temporal data
A significant problem which arises during the process of knowledge discovery is dealing with data which have temporal dependencies. The attributes associated with temporal data need to be processed differently from non temporal attributes. A typical approach to address this issue is to view temporal data as an ordered sequence of events. In this work, we propose a novel dynamic unsupervised learning approach to discover patterns in temporal data. The new technique is based on the Growing Self-Organization Map (GSOM), which is a structure adapting version of the Self-Organizing Map (SOM). The SOM is widely used in knowledge discovery applications due to its unsupervised learning nature, ease of use and visualization capabilities. The GSOM further enhances the SOM with faster processing, more representative cluster formation and the ability to control map spread. This paper describes a significant extension to the GSOM enabling it to be used to for analyzing data with temporal sequences. The similarity between two time dependent sequences with unequal length is estimated using the Dynamic Time Warping (DTW) algorithm incorporated into the GSOM. Experiments were carried out to evaluate the performance and the validity of the proposed approach using an audio-visual data set. The results demonstrate that the novel “GSOM Sequence” algorithm improves the accuracy and validity of the clusters obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信