...
首页> 外文期刊>International Journal of Computer Science and Technology >Comparative Study of Density Based Clustering Algorithms for Data Mining
【24h】

Comparative Study of Density Based Clustering Algorithms for Data Mining

机译:基于密度的数据挖掘聚类算法的比较研究

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Now days, due to the explosive growth of huge amount of data have been uploaded into several websites. Thus it needs to be classified. Data mining is the process of extracting useful information from huge databases. Many approaches of data mining have been proposed to discover useful and accurate information among vast amount of data such as clustering, association rule mining, time series analysis and sequential pattern discovery etc. Thus, the density-based clustering algorithms have been used to find clusters based on the density of points in dense regions. Data clustering can be used in many application areas such as marketing, planning, insurance, biology, network security, earthquake, crime detections, intrusion detection systems etc. This paper presents a comparative study of various density based clustering algorithms for data miningalongwith their merits and demerits.Full Paper
机译:如今,由于爆炸性增长,海量数据已上传到多个网站。因此,需要对其进行分类。数据挖掘是从大型数据库中提取有用信息的过程。提出了许多数据挖掘方法来发现大量数据中的有用和准确的信息,例如聚类,关联规则挖掘,时间序列分析和顺序模式发现等。因此,基于密度的聚类算法已被用于寻找聚类。基于密集区域中点的密度。数据聚类可以用于许多应用领域,例如市场营销,计划,保险,生物学,网络安全,地震,犯罪检测,入侵检测系统等。不足之处

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号