Applications of clustering algorithms and self organizing maps as data mining and business intelligence tools on real world data sets

Lavneet Singh, Savleen Singh, P. K. Dubey
{"title":"Applications of clustering algorithms and self organizing maps as data mining and business intelligence tools on real world data sets","authors":"Lavneet Singh, Savleen Singh, P. K. Dubey","doi":"10.1109/ICM2CS.2010.5706714","DOIUrl":null,"url":null,"abstract":"Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation because of its efficiency in clustering large data sets. In this paper we present a comparative study on different clustering algorithms with respect to k - means clustering to work on large data sets. In this paper we present a comparison among some nonhierarchical and hierarchical clustering algorithms including SOM (Self-Organization Map) neural networks methods. Data were simulated considering correlated and uncorrelated variables, non overlapping and overlapping clusters with and without outliers. Tested with Telecommunication Users and Iris Flower data set, the comparative algorithms had demonstrated a very good classification performance. Experiments on a very large telecommunication data set set consisting of 1000 records and 32 categorical attributes & Iris Flower data set consisting of 150 samples show that the SOM clustering with respect to k means & hierarchical clustering algorithm is scalable in terms of both the number of clusters and the number of records.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM2CS.2010.5706714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation because of its efficiency in clustering large data sets. In this paper we present a comparative study on different clustering algorithms with respect to k - means clustering to work on large data sets. In this paper we present a comparison among some nonhierarchical and hierarchical clustering algorithms including SOM (Self-Organization Map) neural networks methods. Data were simulated considering correlated and uncorrelated variables, non overlapping and overlapping clusters with and without outliers. Tested with Telecommunication Users and Iris Flower data set, the comparative algorithms had demonstrated a very good classification performance. Experiments on a very large telecommunication data set set consisting of 1000 records and 32 categorical attributes & Iris Flower data set consisting of 150 samples show that the SOM clustering with respect to k means & hierarchical clustering algorithm is scalable in terms of both the number of clusters and the number of records.
聚类算法和自组织地图作为数据挖掘和商业智能工具在现实世界数据集上的应用
将大量对象划分为同构簇是数据挖掘中的一项基本操作。k-means算法最适合实现这一操作,因为它在聚类大型数据集时效率很高。在本文中,我们对不同的聚类算法进行了比较研究,以k -均值聚类来处理大数据集。本文比较了几种非分层和分层聚类算法,其中包括SOM(自组织映射)神经网络方法。数据模拟考虑相关和不相关的变量,不重叠和重叠的集群有和没有异常值。通过对电信用户和虹膜花数据集的测试,对比算法显示了很好的分类性能。在包含1000条记录和32个分类属性的非常大的电信数据集和包含150个样本的鸢尾花数据集上的实验表明,相对于k均值和分层聚类算法,SOM聚类在聚类数量和记录数量方面都具有可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书