Výsledky vyhledávání - "Center-based clustering algorithms"

On efficient model selection for sparse hard and fuzzy center-based clustering algorithms

Autoři: Avisek Gupta Swagatam Das

Zdroj: Information Sciences. 590:29-44

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Chapter 9: Center-Based Clustering Algorithms

Zdroj: Data Clustering: Theory, Algorithms, and Applications, Second Edition ISBN: 9781611976328

Comparison of the Performance of Center-Based Clustering Algorithms

Autoři: Bin Zhang

Zdroj: Lecture Notes in Computer Science ISBN: 9783540047605

Přístupová URL adresa: https://rd.springer.com/chapter/10.1007%2F3-540-36175-8_7
https://link.springer.com/content/pdf/10.1007/3-540-36175-8_7.pdf
https://dblp.uni-trier.de/db/conf/pakdd/pakdd2003.html#Zhang03
https://dl.acm.org/doi/10.5555/1760894.1760905
https://link.springer.com/chapter/10.1007/3-540-36175-8_7

9. Center-Based Clustering Algorithms

Zdroj: Data Clustering: Theory, Algorithms, and Applications ISBN: 9780898716238

Linear Speed-Up for a Parallel Non-Approximate Recasting of Center-Based Clustering Algorithms, including K-Means, K-Harmonic Means, and EM

Autoři: George Forman Bin Zhang K-harmonic Means a další

Přispěvatelé: George Forman Bin Zhang K-harmonic Means a další

Zdroj: http://www.hpl.hp.com/org/stl/dmsd/publications/ParaClusterSpeedup.pdf.

Témata: mining, very large databases, parallel algorithms, scale-up

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2937; http://www.hpl.hp.com/org/stl/dmsd/publications/ParaClusterSpeedup.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2937
http://www.hpl.hp.com/org/stl/dmsd/publications/ParaClusterSpeedup.pdf

Linear Speed-Up for a Para lelNon- Approximate Recasting of Center-Based Clustering Algorithms, including K-Means

Autoři: K-h Armonic Means George Forman Bin Zhang a další

Přispěvatelé: K-h Armonic Means George Forman Bin Zhang a další

Zdroj: http://www.hpl.hp.com/techreports/2000/HPL-2000-93.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.195.4368

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.195.4368
http://www.hpl.hp.com/techreports/2000/HPL-2000-93.pdf

Applying a particle swarm optimizer controlled by a fuzzy logic controller in a multi-pivot means clustering algorithm.

Autoři: Xia, Xuewen Li, Minghan Song, Haojie a další

Zdroj: Applied Soft Computing. Jan2026:Part A, Vol. 186, pN.PAG-N.PAG. 1p.

Témata: Fuzzy clustering technique, Particle swarm optimization, Classification, Optimization algorithms, Clustering algorithms

How to optimize K-means?

Autoři: Li, Qi

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2503.19324

A Unified Framework for Center-based Clustering of Distributed Data

Autoři: Armacki, Aleksandar Bajović, Dragana Jakovetić, Dušan a další

Témata: Computer Science - Machine Learning, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Multiagent Systems, text

URL: http://arxiv.org/abs/2402.01302

DISCERN: diversity-based selection of centroids for k-estimation and rapid non-stochastic clustering.

Autoři: Hassani, Ali Iranmanesh, Amir Eftekhari, Mahdi a další

Zdroj: International Journal of Machine Learning & Cybernetics; Mar2021, Vol. 12 Issue 3, p635-649, 15p

Quasi-opposition-based learning in a shuffled particle swarm optimization for solving frequency modulation sounds parameter identification problem.

Autoři: Ahandani, Morteza Alinia

Zdroj: Evolutionary Intelligence; Oct2025, Vol. 18 Issue 5, p1-20, 20p

Bregman Power k-Means for Clustering Exponential Family Data

Autoři: Vellal, Adithya Chakraborty, Saptarshi Xu, Jason

Témata: Statistics - Machine Learning, Computer Science - Machine Learning, Mathematics - Statistics Theory, Statistics - Methodology, text

URL: http://arxiv.org/abs/2206.10860

Fair Clustering Using Antidote Data

Autoři: Chhabra, Anshuman Singla, Adish Mohapatra, Prasant

Témata: Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2106.00600

Aggregated center-based clustering algorithm based on principal component radius.

Autoři: Cheng, Mingchang Liu, Liu Ma, Tiefeng a další

Zdroj: Neurocomputing. Apr2025, Vol. 624, pN.PAG-N.PAG. 1p.

Témata: *CLUSTERING algorithms, *DATA distribution, *ALGORITHMS

Fair Algorithms for Hierarchical Agglomerative Clustering

Autoři: Chhabra, Anshuman Mohapatra, Prasant

Témata: Computer Science - Machine Learning, Statistics - Machine Learning, text

URL: http://arxiv.org/abs/2005.03197

DISCERN: Diversity-based Selection of Centroids for k-Estimation and Rapid Non-stochastic Clustering

Autoři: Hassani, Ali Iranmanesh, Amir Eftekhari, Mahdi a další

Témata: Computer Science - Machine Learning, Statistics - Machine Learning, text

URL: http://arxiv.org/abs/1910.05933

A Unified Continuous Optimization Framework for Center-Based Clustering Methods.

Autoři: Teboulle, Marc¹ TEBOULLE@MATH.TAU.AC.IL

Zdroj: Journal of Machine Learning Research. 1/1/2007, Vol. 8 Issue 1, p65-102. 38p.

Témata: *ALGORITHMS, *NONCONVEX programming, *NONSMOOTH optimization, *MATHEMATICAL optimization, *MACHINE learning

Central Clustering of Attributed Graphs.

Autoři: Brijnesh J. Jain Fritz Wysotzki

Zdroj: Machine Learning; Jul2004, Vol. 56 Issue 1-3, p169-207, 39p

Natural neighbor-based clustering algorithm with local representatives.

Autoři: Dongdong Cheng Qingsheng Zhu Jinlong Huang a další

Zdroj: Knowledge-Based Systems. May2017, Vol. 123, p238-253. 16p.

Témata: *MANIFOLDS (Mathematics), *PICARD-Lefschetz theory, *ANALYTIC spaces, *COMPLEX manifolds, *ALGORITHMS

Hybrid data clustering approach using K-Means and Flower Pollination Algorithm

Autoři: Jensi, R. Jiji, G. Wiselin

Témata: Computer Science - Machine Learning, Computer Science - Information Retrieval, Computer Science - Neural and Evolutionary Computing, text

URL: http://arxiv.org/abs/1505.03236