A New Algorithm for Ordering of Points to Identify Clustering Structure Based on Perimeter of Triangle: OPTICS(BOPT)

H. K. Kalita, D. Bhattacharyya, A. Kar
{"title":"A New Algorithm for Ordering of Points to Identify Clustering Structure Based on Perimeter of Triangle: OPTICS(BOPT)","authors":"H. K. Kalita, D. Bhattacharyya, A. Kar","doi":"10.1109/ADCOM.2007.17","DOIUrl":null,"url":null,"abstract":"The process of grouping (or partitioning) a set of physical or abstract objects into classes of similar objects is known as clustering. By applying clustering method it is possible to identify dense & sparse regions, discover overall distribution pattern and interesting correlations amongst data in a data set. In this paper we propose a new, semiautomatic clustering algorithm called-ordering of points to identify clustering structure based on perimeter of triangle : OPTICS(BOPT). Our method can be used in both numeric as well as categorical data and shows clusters part-by-part.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2007.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The process of grouping (or partitioning) a set of physical or abstract objects into classes of similar objects is known as clustering. By applying clustering method it is possible to identify dense & sparse regions, discover overall distribution pattern and interesting correlations amongst data in a data set. In this paper we propose a new, semiautomatic clustering algorithm called-ordering of points to identify clustering structure based on perimeter of triangle : OPTICS(BOPT). Our method can be used in both numeric as well as categorical data and shows clusters part-by-part.
基于三角形周长的聚类结构点排序新算法:OPTICS(BOPT)
将一组物理或抽象对象分组(或划分)为相似对象的类的过程称为聚类。通过应用聚类方法可以识别密集和稀疏区域,发现数据集中数据之间的总体分布模式和有趣的相关性。本文提出了一种新的基于三角形周长的半自动聚类算法——点排序算法:OPTICS(BOPT)。我们的方法既可以用于数字数据,也可以用于分类数据,并且可以逐部分地显示聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信