CABRA: Clustering algorithm based on regular arrangement

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2024-06-12 DOI:10.1016/j.orl.2024.107137
Jorge C-Rella
{"title":"CABRA: Clustering algorithm based on regular arrangement","authors":"Jorge C-Rella","doi":"10.1016/j.orl.2024.107137","DOIUrl":null,"url":null,"abstract":"<div><p>Clustering is an unsupervised learning technique for organizing complex datasets into coherent groups. A novel clustering algorithm is presented, with a simple grouping concept depending on only one hyperparameter, which makes it suitable for further extensions to any topology and space. It is compared to state-of-the-art algorithms, overall achieving a better performance independently on the structure and complexity of the data, making the proposed algorithm a valuable tool for real applications such as market segmentation, sentiment analysis and anomaly detection.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107137"},"PeriodicalIF":0.8000,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000737/pdfft?md5=b65e1ded4697916bc6af8d82b5777240&pid=1-s2.0-S0167637724000737-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724000737","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Clustering is an unsupervised learning technique for organizing complex datasets into coherent groups. A novel clustering algorithm is presented, with a simple grouping concept depending on only one hyperparameter, which makes it suitable for further extensions to any topology and space. It is compared to state-of-the-art algorithms, overall achieving a better performance independently on the structure and complexity of the data, making the proposed algorithm a valuable tool for real applications such as market segmentation, sentiment analysis and anomaly detection.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CABRA:基于规则排列的聚类算法
聚类是一种无监督学习技术,用于将复杂的数据集组织成一致的组。本文提出了一种新颖的聚类算法,其简单的分组概念仅取决于一个超参数,因此适合进一步扩展到任何拓扑结构和空间。该算法与最先进的算法进行了比较,总体上取得了更好的性能,不受数据结构和复杂性的影响,使所提出的算法成为市场细分、情感分析和异常检测等实际应用的重要工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
期刊最新文献
Pooled testing in the presence of congestion Robust knapsack ordering for a partially-informed newsvendor with budget constraint Break maximization for round-robin tournaments without consecutive breaks Anchored rescheduling problem with non-availability periods On BASTA for discrete-time queues
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1