PFClust: an optimised implementation of a parameter-free clustering algorithm.

Q2 Decision Sciences
Khadija Musayeva, Tristan Henderson, John Bo Mitchell, Lazaros Mavridis
{"title":"PFClust: an optimised implementation of a parameter-free clustering algorithm.","authors":"Khadija Musayeva,&nbsp;Tristan Henderson,&nbsp;John Bo Mitchell,&nbsp;Lazaros Mavridis","doi":"10.1186/1751-0473-9-5","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>A well-known problem in cluster analysis is finding an optimal number of clusters reflecting the inherent structure of the data. PFClust is a partitioning-based clustering algorithm capable, unlike many widely-used clustering algorithms, of automatically proposing an optimal number of clusters for the data.</p><p><strong>Results: </strong>The results of tests on various types of data showed that PFClust can discover clusters of arbitrary shapes, sizes and densities. The previous implementation of the algorithm had already been successfully used to cluster large macromolecular structures and small druglike compounds. We have greatly improved the algorithm by a more efficient implementation, which enables PFClust to process large data sets acceptably fast.</p><p><strong>Conclusions: </strong>In this paper we present a new optimized implementation of the PFClust algorithm that runs considerably faster than the original.</p>","PeriodicalId":35052,"journal":{"name":"Source Code for Biology and Medicine","volume":"9 1","pages":"5"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/1751-0473-9-5","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Source Code for Biology and Medicine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/1751-0473-9-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 8

Abstract

Background: A well-known problem in cluster analysis is finding an optimal number of clusters reflecting the inherent structure of the data. PFClust is a partitioning-based clustering algorithm capable, unlike many widely-used clustering algorithms, of automatically proposing an optimal number of clusters for the data.

Results: The results of tests on various types of data showed that PFClust can discover clusters of arbitrary shapes, sizes and densities. The previous implementation of the algorithm had already been successfully used to cluster large macromolecular structures and small druglike compounds. We have greatly improved the algorithm by a more efficient implementation, which enables PFClust to process large data sets acceptably fast.

Conclusions: In this paper we present a new optimized implementation of the PFClust algorithm that runs considerably faster than the original.

Abstract Image

PFClust:无参数聚类算法的优化实现。
背景:聚类分析中一个众所周知的问题是找到反映数据固有结构的最优聚类数量。PFClust是一种基于分区的聚类算法,与许多广泛使用的聚类算法不同,它能够自动为数据提出最佳数量的聚类。结果:对不同类型数据的测试结果表明,PFClust可以发现任意形状、大小和密度的簇。该算法之前的实现已经成功地用于聚类大型大分子结构和小型药物类化合物。我们通过更有效的实现大大改进了算法,使PFClust能够以可接受的速度处理大型数据集。结论:在本文中,我们提出了一种新的PFClust算法优化实现,其运行速度比原始算法快得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Source Code for Biology and Medicine
Source Code for Biology and Medicine Decision Sciences-Information Systems and Management
自引率
0.00%
发文量
0
期刊介绍: Source Code for Biology and Medicine is a peer-reviewed open access, online journal that publishes articles on source code employed over a wide range of applications in biology and medicine. The journal"s aim is to publish source code for distribution and use in the public domain in order to advance biological and medical research. Through this dissemination, it may be possible to shorten the time required for solving certain computational problems for which there is limited source code availability or resources.
×
引用
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学术官方微信