Fetching the paper…
Reading the bibliography…
Clustering non-Euclidean data is difficult, and one of the most used algorithms besides hierarchical clustering is the popular algorithm Partitioning Around Medoids (PAM), also simply referred to as k-medoids.
1902
Earlier work this paper cites.
Hartigan JA, Wong MA (1979) Algorithm as 136: A k-means clustering algorithm. Journal of the Royal Statistical Society Series C (Applied Statistics) 28(1):100–108
1979
Earlier work this paper cites.
Schubert E, Koos A, Emrich T, Züfle A, Schmid KA, Zimek A (2015) A framework for clustering uncertain data. PVLDB 8(12):1976–1979, DOI 10.14778/2824032.2824115
1979
Earlier work this paper cites.
Overton ML (1983) A quadratically convergent method for minimizing a sum of euclidean norms. Math Program 27(1):34–63, DOI 10.1007/BF02591963
1983
Earlier work this paper cites.
Kaufman L, Rousseeuw PJ (1986) Clustering large data sets. In: Pattern Recognition in Practice, Elsevier, pp 425–437, DOI 10.1016/b978-0-444-87877-9.50039-x
1986
Earlier work this paper cites.
Kaufman L, Rousseeuw PJ (1987) Clustering by means of medoids. In: Dodge Y (ed) Statistical Data Analysis Based on the L 1 L_{1} Norm and Related Methods, pp 405–416
1987
Earlier work this paper cites.
Kaufman L, Hopke PK, Rousseeuw P (1988) Using a parallel computer system for statistical resampling methods. Computational Statistics Quarterly 2:129–141
1988
Earlier work this paper cites.
Kaufman L, Rousseeuw PJ (1990) Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley&Sons, DOI 10.1002/9780470316801
1990
Earlier work this paper cites.
Lucasius C, Dane A, Kateman G (1993) On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasiblity and comparison. Analytica Chimica Acta 282(3):647 – 669, DOI 10.1016/0003-2670(93)80130-D
1993
Earlier work this paper cites.
Bradley PS, Mangasarian OL, Street WN (1996) Clustering via concave minimization. In: NIPS, pp 368–374
1996
Earlier work this paper cites.
Ester M, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp 226–231
1996
Cited alongside, same era.
Estivill-Castro V (2002) Why so many clustering algorithms: a position paper. SIGKDD Explorations 4(1):65–75
2002
Cited alongside, same era.
Ng RT, Han J (2002) CLARANS: A method for clustering objects for spatial data mining. IEEE TKDE 14(5):1003–1016, DOI 10.1109/TKDE.2002.1033770
2002
Cited alongside, same era.
Wei C, Lee Y, Hsu C (2003) Empirical comparison of fast partitioning-based clustering algorithms for large data sets. Expert Syst Appl 24(4):351–363, DOI 10.1016/S0957-4174(02)00185-9
2003
Cited alongside, same era.
Arthur D, Vassilvitskii S (2006) How slow is the k -means method? In: ACM Symposium on Computational Geometry, pp 144–153, DOI 10.1145/1137856.1137880
Fritz H, Filzmoser P, Croux C (2012) A comparison of algorithms for the multivariate l 1 l_{1} -median. Computational Statistics 27(3):393–410, DOI 10.1007/s00180-011-0262-4
2012
Later among the works it cites.
Yang X, Lian L (2014) A new data mining algorithm based on MapReduce and hadoop. IJSIP 7(2):131–142, DOI 10.14257/ijsip.2014.7.2.13
2014
Later among the works it cites.
Lijffijt J, Papapetrou P, Puolamäki K (2015) Size matters: choosing the most informative set of window lengths for mining patterns in event sequences. Data Min Knowl Discov 29(6):1838–1864, DOI 10.1007/s10618-014-0397-3
2015
Later among the works it cites.
Dheeru D, Karra Taniskidou E (2017) UCI machine learning repository. URL http://archive.ics.uci.edu/ml
2017
Later among the works it cites.
Kriegel H, Schubert E, Zimek A (2017) The (black) art of runtime evaluation: Are we comparing algorithms or implementations? Knowl Inf Syst 52(2):341–378, DOI 10.1007/s10115-016-1004-2
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Reynolds AP, Richards G, de la Iglesia B, Rayward-Smith VJ (2006) Clustering rules: A comparison of partitioning and hierarchical clustering algorithms. J Math Model Algorithms 5(4):475–504, DOI 10.1007/s10852-005-9022-1
2006
Cited alongside, same era.
Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: ACM-SIAM SODA, pp 1027–1035
2007
Cited alongside, same era.
Bock H (2007) Clustering methods: A history of k-means algorithms. In: Brito P, Cucumel G, Bertrand P, Carvalho F (eds) Selected Contributions in Data Analysis and Classification, Springer, pp 161–172, DOI 10.1007/978-3-540-73560-1_15
2007
Cited alongside, same era.
Park H, Jun C (2009) A simple and fast algorithm for k-medoids clustering. Expert Syst Appl 36(2):3336–3341, DOI 10.1016/j.eswa.2008.01.039
2008
Cited alongside, same era.
2017
Later among the works it cites.
Schubert E, Sander J, Ester M, Kriegel H, Xu X (2017) DBSCAN revisited, revisited: Why and how you should (still) use DBSCAN. ACM Trans Database Syst 42(3):19:1–19:21
2017
Later among the works it cites.
Song H, Lee J, Han W (2017) PAMAE: parallel k -medoids clustering with high accuracy and efficiency. In: KDD, pp 1087–1096, DOI 10.1145/3097983.3098098
2017
Later among the works it cites.
Schubert E, Gertz M (2018) Numerically stable parallel computation of (co-)variance. In: SSDBM, pp 10:1–10:12, DOI 10.1145/3221269.3223036
2018
Closest in time.
Schubert E, Hess S, Morik K (2018) The relationship of DBSCAN to matrix factorization and spectral clustering. In: LWDA, CEUR Workshop Proceedings, vol 2191, pp 330–334
2018
Closest in time.