An Efficient K-Medoids Clustering Algorithm for Large Scale Data-Reference-Cited by-同舟云学术

An Efficient K-Medoids Clustering Algorithm for Large Scale Data

Published:2019-08-13 Issue: Volume: Page:85-108
ISSN:
Container-title:Machine Learning-based Natural Scene Recognition for Mobile Robot Localization in An Unknown Environment
language:
Short-container-title:

Author:

Wang Xiaochun,Wang Xiali,Wilkes Don Mitchell

Publisher

Springer Singapore

Link

http://link.springer.com/content/pdf/10.1007/978-981-13-9217-7_5

Reference25 articles.

1. Amorèse, D., Bossu, R., & Mazet-Roux, G. (2015). Automatic clustering of macroseismic intensity data points from internet questionnaires: Efficiency of the partitioning around medoids (PAM). Seismological Research Letters, 86, 1171–1177.

2. Arumugam, M., Raes, J., & Pelletier, E. (2011). Enterotypes of the human gut microbiome. Nature, 506, 174–180.

3. Ayyala, D., & Lin, S. (2015). GrammR: Graphical representation and modeling of count data with application in metagenomics. Bioinformatics, 31, 1648–1654.

4. Bach, F.R., & Jordan, M.I. (2004, December). Blind one-microphone speech separation: a spectral learning approach. In Proceedings of the 17th International Conference on Neural Information Processing Systems (NIPS’04), (pp. 65–72). MIT Press.

5. Broin, P. Ó., Smith, T., & Golden, A. (2015). Alignment-free clustering of transcription factor Binding motifs using agenetic-k-medoids approach. BMC Bioinformatics, 16, 1–12.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discrete Facility Location in Machine Learning;Journal of Applied and Industrial Mathematics;2021-11