{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T09:36:27Z","timestamp":1784280987605,"version":"3.55.0"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T00:00:00Z","timestamp":1477094400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10115-016-1004-2","type":"journal-article","created":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T11:10:04Z","timestamp":1477134604000},"page":"341-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":179,"title":["The (black) art of runtime evaluation: Are we comparing algorithms or implementations?"],"prefix":"10.1007","volume":"52","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erich","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7713-4208","authenticated-orcid":false,"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"key":"1004_CR1","doi-asserted-by":"crossref","unstructured":"Achtert E, Bernecker T, Kriegel H-P, Schubert E, Zimek A (2009) ELKI in time: ELKI 0.2 for the performance evaluation of distance measures for time series. In: Proceedings of the 11th international symposium on spatial and temporal databases (SSTD), Aalborg, Denmark, pp 436\u2013440","DOI":"10.1007\/978-3-642-02982-0_35"},{"key":"1004_CR2","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kriegel H-P, Kr\u00f6ger P, Zimek A (2007) Robust, complete, and efficient correlation clustering. In: Proceedings of the 7th SIAM international conference on data mining (SDM), Minneapolis, MN, pp 413\u2013418","DOI":"10.1137\/1.9781611972771.37"},{"key":"1004_CR3","doi-asserted-by":"crossref","unstructured":"Achtert E, Goldhofer S, Kriegel H-P, Schubert E, Zimek A (2012) Evaluation of clusterings\u2014metrics and visual support. In: Proceedings of the 28th international conference on data engineering (ICDE), Washington, DC, pp 1285\u20131288","DOI":"10.1109\/ICDE.2012.128"},{"key":"1004_CR4","doi-asserted-by":"crossref","unstructured":"Achtert E, Hettab A, Kriegel H-P, Schubert E, Zimek A (2011) Spatial outlier detection: data, algorithms, visualizations. In: Proceedings of the 12th international symposium on spatial and temporal databases (SSTD), Minneapolis, MN, pp 512\u2013516","DOI":"10.1007\/978-3-642-22922-0_41"},{"key":"1004_CR5","doi-asserted-by":"crossref","unstructured":"Achtert E, Kriegel H-P, Reichert L, Schubert E, Wojdanowski R, Zimek A (2010) Visual evaluation of outlier detection models. In: Proceedings of the 15th international conference on database systems for advanced applications (DASFAA), Tsukuba, Japan, pp 396\u2013399","DOI":"10.1007\/978-3-642-12098-5_34"},{"key":"1004_CR6","doi-asserted-by":"crossref","unstructured":"Achtert E, Kriegel H-P, Schubert E, Zimek A (2013) Interactive data mining with 3D-parallel-coordinate-trees. In: Proceedings of the ACM international conference on management of data (SIGMOD), New York City, NY, pp 1009\u20131012","DOI":"10.1145\/2463676.2463696"},{"key":"1004_CR7","doi-asserted-by":"crossref","unstructured":"Achtert E, Kriegel H-P, Zimek A (2008) ELKI: a software system for evaluation of subspace clustering algorithms. In: Proceedings of the 20th international conference on scientific and statistical database management (SSDBM), Hong Kong, China, pp 580\u2013585","DOI":"10.1007\/978-3-540-69497-7_41"},{"key":"1004_CR8","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB), Santiago de Chile, Chile, pp 487\u2013499"},{"key":"1004_CR9","unstructured":"Alsabti K, Ranka S, Singh V (1998) An efficient k-means clustering algorithm. In: Proceedings of IPPS\/SPDP workshop on high performance data mining"},{"key":"1004_CR10","volume-title":"Cluster analysis for applications. Probability and mathematical statistics","author":"MR Anderberg","year":"1973","unstructured":"Anderberg MR (1973) Cluster analysis for applications. Probability and mathematical statistics. Academic Press, Cambridge"},{"key":"1004_CR11","unstructured":"Apache Software Foundation (2015) Apache Commons Math. https:\/\/commons.apache.org\/proper\/commons-math\/"},{"key":"1004_CR12","unstructured":"Apache Software Foundation (2015) Apache Mahout. http:\/\/mahout.apache.org\/"},{"key":"1004_CR13","unstructured":"Apache Software Foundation (2015) Apache Spark. http:\/\/spark.apache.org\/"},{"key":"1004_CR14","unstructured":"Arthur D, Vassilvitskii S (2007) k-means $$++$$ + + : the advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM symposium on discrete algorithms (SODA), New Orleans, LA, pp 1027\u20131035"},{"key":"1004_CR15","unstructured":"Arya S, Mount DM (1993) Approximate nearest neighbor queries in fixed dimensions. In: Proceedings of the 4th annual ACM\/SIGACT-SIAM symposium on discrete algorithms (SODA), Austin, TX, pp 271\u2013280"},{"key":"1004_CR16","doi-asserted-by":"crossref","unstructured":"Bayardo Jr RJ, Goethals B, Zaki MJ (eds) (2005) FIMI \u201904, Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations, Brighton, UK, November 1, 2004, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org","DOI":"10.1145\/1007730.1007744"},{"key":"1004_CR17","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM international conference on management of data (SIGMOD), Atlantic City, NJ, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"1004_CR18","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"1004_CR19","doi-asserted-by":"crossref","unstructured":"Beygelzimer A, Kakade S, Langford J (2006) Cover trees for nearest neighbors. In: Proceedings of the 23rd international conference on machine learning (ICML), Pittsburgh, PA, pp 97\u2013104","DOI":"10.1145\/1143844.1143857"},{"key":"1004_CR20","unstructured":"Bezanson J, Edelman A, Karpinski S, Shah VB (2014) Julia: a fresh approach to numerical computing. CoRR, arXiv:1411.1607"},{"key":"1004_CR21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-73560-1_15","volume-title":"Selected contributions in data analysis and classification","author":"H Bock","year":"2007","unstructured":"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, Berlin, pp 161\u2013172"},{"key":"1004_CR22","unstructured":"Bodon F (2003) A fast APRIORI implementation. In: Proceedings of the ICDM workshop on frequent itemset mining implementations (FIMI \u201903), Melbourne, Florida, USA"},{"key":"1004_CR23","unstructured":"Borgelt C (2003) Efficient implementations of Apriori and Eclat. In: Proceedings of the ICDM workshop on frequent itemset mining implementations (FIMI \u201903), Melbourne, Florida, USA"},{"key":"1004_CR24","doi-asserted-by":"crossref","unstructured":"Breunig MM, Kriegel H-P, Ng R, Sander J (2000) LOF: identifying density-based local outliers. In: Proceedings of the ACM international conference on management of data (SIGMOD), Dallas, TX, pp 93\u2013104","DOI":"10.1145\/342009.335388"},{"issue":"4","key":"1004_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.14778\/2732240.2732242","volume":"7","author":"C Budak","year":"2013","unstructured":"Budak C, Georgiou T, Agrawal D, El Abbadi A (2013) GeoScope: online detection of geo-correlated information trends in social networks. Proc VLDB Endow 7(4):229\u2013240","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"1004_CR26","first-page":"5:1","volume":"10","author":"RJGB Campello","year":"2015","unstructured":"Campello RJGB, Moulavi D, Zimek A, Sander J (2015) Hierarchical density estimates for data clustering, visualization, and outlier detection. ACM Trans Knowl Discov Data (TKDD) 10(1):5:1\u201351","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1004_CR27","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10618-015-0444-8","volume":"30","author":"GO Campos","year":"2016","unstructured":"Campos GO, Zimek A, Sander J, Campello RJGB, Micenkov\u00e1 B, Schubert E, Assent I, Houle ME (2016) On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study. Data Min Knowl Discov 30:891\u2013927","journal-title":"Data Min Knowl Discov"},{"key":"1004_CR28","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd international conference on very large data bases (VLDB), Athens, Greece, pp 426\u2013435"},{"issue":"2","key":"1004_CR29","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TKDE.2011.176","volume":"25","author":"RLF Cordeiro","year":"2013","unstructured":"Cordeiro RLF, Traina AJM, Faloutsos C, Traina C Jr (2013) Halite: fast and scalable multiresolution local-correlation clustering. IEEE Trans Knowl Data Eng 25(2):387\u2013401","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1004_CR30","unstructured":"Eaton JW, Bateman D, Hauberg S, Wehbring R (2014) GNU Octave version 3.8.1 manual: a high-level interactive language for numerical computations. CreateSpace Independent Publishing Platform"},{"key":"1004_CR31","unstructured":"Elkan C (2003) Using the triangle inequality to accelerate k-means. In: Proceedings of the 20th international conference on machine learning (ICML), Washington, DC, pp 147\u2013153"},{"key":"1004_CR32","unstructured":"Eppstein D (1998) Fast hierarchical clustering and other applications of dynamic closest pairs. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco, CA, pp 619\u2013628"},{"key":"1004_CR33","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd ACM international conference on knowledge discovery and data mining (KDD), Portland, OR, pp 226\u2013231"},{"key":"1004_CR34","first-page":"768","volume":"21","author":"EW Forgy","year":"1965","unstructured":"Forgy EW (1965) Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21:768\u2013769","journal-title":"Biometrics"},{"issue":"1","key":"1004_CR35","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C, Tseng VS (2014) SPMF: a Java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"key":"1004_CR36","unstructured":"F\u00e4rber I, G\u00fcnnemann S, Kriegel H-P, Kr\u00f6ger P, M\u00fcller E, Schubert E, Seidl T, Zimek A (2010) On using class-labels in evaluation of clusterings. In: MultiClust: 1st International workshop on discovering, summarizing and using multiple clusterings held in conjunction with KDD 2010, Washington, DC"},{"key":"1004_CR37","doi-asserted-by":"crossref","unstructured":"Gan J, Tao Y (2015) DBSCAN revisited: mis-claim, un-fixability, and approximation. In: Proceedings of the ACM international conference on management of data (SIGMOD), Melbourne, Australia, pp 519\u2013530","DOI":"10.1145\/2723372.2737792"},{"issue":"1","key":"1004_CR38","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"JM Geusebroek","year":"2005","unstructured":"Geusebroek JM, Burghouts GJ, Smeulders AWM (2005) The Amsterdam library of object images. Int J Comput Vis 61(1):103\u2013112","journal-title":"Int J Comput Vis"},{"key":"1004_CR39","unstructured":"Goethals B, Zaki MJ, (eds) (2003) FIMI \u201903, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 workshop on frequent itemset mining implementations, 19 December 2003, Melbourne, Florida, USA, volume\u00a090 of CEUR workshop proceedings. CEUR-WS.org"},{"key":"1004_CR40","unstructured":"Haifeng L (2015) SmileMiner (statistical machine intelligence & learning engine). https:\/\/github.com\/haifengl\/smile"},{"issue":"1","key":"1004_CR41","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The WEKA data mining software: an update. ACM SIGKDD Explor 11(1):10\u201318","journal-title":"ACM SIGKDD Explor"},{"key":"1004_CR42","doi-asserted-by":"crossref","unstructured":"Hamerly G (2010) Making k-means even faster. In: Proceedings of the 10th SIAM international conference on data mining (SDM), Columbus, OH, pp 130\u2013140","DOI":"10.1137\/1.9781611972801.12"},{"key":"1004_CR43","doi-asserted-by":"crossref","unstructured":"Hamerly G, Drake J (2015) Accelerating Lloyd\u2019s algorithm for k-means clustering. In: Celebi ME (ed) Partitional clustering algorithms, chapter 2. Springer, Switzerland, pp 41\u201378","DOI":"10.1007\/978-3-319-09259-1_2"},{"key":"1004_CR44","unstructured":"Hamerly G, Elkan C (2003) Learning the k in k-means. In: Proceedings of the Annual conference on neural information processing systems (NIPS), Vancouver, BC, pp 281\u2013288"},{"key":"1004_CR45","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley, New York"},{"key":"1004_CR46","doi-asserted-by":"crossref","unstructured":"Hartigan JA, Wong MA (1979) Algorithm AS 136: A k-means clustering algorithm. J R Stat Soc Ser C (Appl Stat) 28(1):100\u2013108","DOI":"10.2307\/2346830"},{"key":"1004_CR47","unstructured":"Jones E, Oliphant T, Peterson P et al (2001) SciPy: open source scientific tools for Python"},{"issue":"7","key":"1004_CR48","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY (2002) An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans Pattern Anal Mach Intell 24(7):881\u2013892","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1004_CR49","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw PJ (1990) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"issue":"3","key":"1004_CR50","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/widm.30","volume":"1","author":"H-P Kriegel","year":"2011","unstructured":"Kriegel H-P, Kr\u00f6ger P, Sander J, Zimek A (2011) Density-based clustering. Wiley Interdiscip Rev Data Min Knowl Discov 1(3):231\u2013240","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"1004_CR51","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Edgington JM, Lopez MA (1997) STR: a simple and efficient algorithm for R-tree packing. In: Proceedings of the 13th international conference on data engineering (ICDE), Birmingham, UK, pp 497\u2013506","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"2","key":"1004_CR52","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013136","journal-title":"IEEE Trans Inf Theory"},{"key":"1004_CR53","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: 5th Berkeley symposium on mathematics, statistics, and probabilistics, vol 1, pp 281\u2013297"},{"key":"1004_CR54","doi-asserted-by":"crossref","unstructured":"Mahran S, Mahar K (2008) Using grid for accelerating density-based clustering. In: Proceedings of 8th IEEE international conference on computer and information technology, CIT 2008, Sydney, Australia, pp 35\u201340","DOI":"10.1109\/CIT.2008.4594646"},{"issue":"1","key":"1004_CR55","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1093\/comjnl\/28.1.82","volume":"28","author":"F Murtagh","year":"1985","unstructured":"Murtagh F (1985) A survey of algorithms for contiguity-constrained clustering and related problems. Comput J 28(1):82\u201388","journal-title":"Comput J"},{"key":"1004_CR56","unstructured":"M\u00fcllner D (2011) Modern hierarchical, agglomerative clustering algorithms. arXiv preprint, arXiv:1207.0016"},{"key":"1004_CR57","unstructured":"Nijssen S, Kok JN (2006) Frequent subgraph miners: runtimes don\u2019t say everything. In: Proceedings of the 4th workshop on mining and learning with graphs (MLG), Berlin, Germany, pp 173\u2013180"},{"issue":"8","key":"1004_CR58","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/0167-8191(95)00017-I","volume":"21","author":"CF Olson","year":"1995","unstructured":"Olson CF (1995) Parallel algorithms for hierarchical clustering. Parallel Comput 21(8):1313\u20131325","journal-title":"Parallel Comput"},{"key":"1004_CR59","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"1004_CR60","doi-asserted-by":"crossref","unstructured":"Pelleg D, Moore A (1999) Accelerating exact k-means algorithms with geometric reasoning. In: Proceedings of the 5th ACM international conference on knowledge discovery and data mining (SIGKDD), San Diego, CA, pp 277\u2013281","DOI":"10.1145\/312129.312248"},{"key":"1004_CR61","unstructured":"Pelleg D, Moore A (2000) X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the 17th international conference on machine learning (ICML), Stanford University, CA, vol 1, pp 727\u2013734"},{"key":"1004_CR62","doi-asserted-by":"crossref","unstructured":"Phillips SJ (2002) Acceleration of k-means and related clustering algorithms. In: The 4th international workshop on algorithm engineering and experiments (ALENEX) 2002, San Francisco, CA, pp 166\u2013177","DOI":"10.1007\/3-540-45643-0_13"},{"issue":"6","key":"1004_CR63","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36(6):1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"1004_CR64","unstructured":"R Core Team. R: a language and environment for statistical computing. R Foundation for Statistical Computing. http:\/\/www.r-project.org\/"},{"key":"1004_CR65","unstructured":"Raff E (2015) Java statistical analysis tool, a Java library for machine learning. https:\/\/github.com\/EdwardRaff\/JSAT"},{"issue":"1","key":"1004_CR66","first-page":"93","volume":"16","author":"FJ Rohlf","year":"1973","unstructured":"Rohlf FJ (1973) Algorithm 76: hierarchical clustering using the minimum spanning tree. Comput J 16(1):93\u201395","journal-title":"Comput J"},{"issue":"2","key":"1004_CR67","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J Sander","year":"1998","unstructured":"Sander J, Ester M, Kriegel H-P, Xu X (1998) Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Min Knowl Discov 2(2):169\u2013194","journal-title":"Data Min Knowl Discov"},{"issue":"12","key":"1004_CR68","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.14778\/2824032.2824115","volume":"8","author":"E Schubert","year":"2015","unstructured":"Schubert E, Koos A, Emrich T, Z\u00fcfle A, Schmid KA, Zimek A (2015) A framework for clustering uncertain data. Proc VLDB Endow 8(12):1976\u20131979","journal-title":"Proc VLDB Endow"},{"key":"1004_CR69","doi-asserted-by":"crossref","unstructured":"Schubert E, Zimek A, Kriegel H-P (2013) Geodetic distance queries on R-trees for indexing geographic data. In: Proceedings of the 13th international symposium on spatial and temporal databases (SSTD), Munich, Germany, pp 146\u2013164","DOI":"10.1007\/978-3-642-40235-7_9"},{"key":"1004_CR70","doi-asserted-by":"crossref","unstructured":"Schubert E, Zimek A, Kriegel H-P (2014) Generalized outlier detection with flexible kernel density estimates. In: Proceedings of the 14th SIAM international conference on data mining (SDM), Philadelphia, PA, pp 542\u2013550","DOI":"10.1137\/1.9781611973440.63"},{"issue":"1","key":"1004_CR71","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s10618-012-0300-z","volume":"28","author":"E Schubert","year":"2014","unstructured":"Schubert E, Zimek A, Kriegel H-P (2014) Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection. Data Min Knowl Discov 28(1):190\u2013237","journal-title":"Data Min Knowl Discov"},{"key":"1004_CR72","doi-asserted-by":"crossref","unstructured":"Sculley D (2010) Web-scale k-means clustering. In: Proceedings of the 19th international conference on world wide web (WWW), Raleigh, NC, pp 1177\u20131178","DOI":"10.1145\/1772690.1772862"},{"issue":"1","key":"1004_CR73","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson R (1973) SLINK: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334","journal-title":"Comput J"},{"issue":"1","key":"1004_CR74","doi-asserted-by":"crossref","first-page":"97","DOI":"10.14778\/2735461.2735470","volume":"8","author":"D \u0160idlauskas","year":"2014","unstructured":"\u0160idlauskas D, Jensen CS (2014) Spatial joins in main memory: implementation matters!. Proc VLDB Endow 8(1):97\u2013100","journal-title":"Proc VLDB Endow"},{"key":"1004_CR75","unstructured":"Slonim N, Aharoni E, Crammer K (2013) Hartigan\u2019s k-means versus Lloyd\u2019s k-means-is it time for a change? In: Proceedings of the 23rd international joint conference on artificial intelligence (IJCAI), Beijing, China"},{"key":"1004_CR76","first-page":"201","volume":"17","author":"PHA Sneath","year":"1957","unstructured":"Sneath PHA (1957) The application of computers to taxonomy. J Gen Microbiol 17:201\u2013226","journal-title":"J Gen Microbiol"},{"key":"1004_CR77","first-page":"1799","volume":"11","author":"S Sonnenburg","year":"2010","unstructured":"Sonnenburg S, R\u00e4tsch G, Henschel S, Widmer C, Behr J, Zien A, De Bona F, Binder A, Gehl C, Franc V (2010) The SHOGUN machine learning toolbox. J Mach Learn Res 11:1799\u20131802","journal-title":"J Mach Learn Res"},{"issue":"14","key":"1004_CR78","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.14778\/2556549.2556570","volume":"6","author":"B Sowell","year":"2013","unstructured":"Sowell B, Salles MAV, Cao T, Demers AJ, Gehrke J (2013) An experimental analysis of iterated spatial joins in main memory. Proc VLDB Endow 6(14):1882\u20131893","journal-title":"Proc VLDB Endow"},{"key":"1004_CR79","unstructured":"Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques. In: KDD workshop on text mining, vol 400, pp 525\u2013526"},{"key":"1004_CR80","first-page":"801","volume":"1","author":"H Steinhaus","year":"1956","unstructured":"Steinhaus H (1956) Sur la division des corp materiels en parties. Bull Acad Pol Sci 1:801\u2013804","journal-title":"Bull Acad Pol Sci"},{"issue":"1","key":"1004_CR81","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10994-012-5303-x","volume":"90","author":"KM Ting","year":"2013","unstructured":"Ting KM, Zhou G-T, Liu FT, Tan SC (2013) Mass estimation. Mach Learn 90(1):127\u2013160","journal-title":"Mach Learn"},{"key":"1004_CR82","unstructured":"Toma\u0161ev N (2015) hubminer: Hub miner v1.1. https:\/\/github.com\/datapoet\/hubminer\/"},{"key":"1004_CR83","doi-asserted-by":"crossref","unstructured":"Vreeken J, Tatti N (2014) Interesting patterns. In: Aggarwal CC, Han J (eds) Frequent pattern mining, chapter\u00a05. Springer, pp 105\u2013134","DOI":"10.1007\/978-3-319-07821-2_5"},{"issue":"301","key":"1004_CR84","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"1004_CR85","volume-title":"Data mining: practical machine learning tools and techniques","author":"IH Witten","year":"2005","unstructured":"Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, Burlington","edition":"2"},{"issue":"7","key":"1004_CR86","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert DH (1996) The lack of a priori distinctions between learning algorithms. Neural Comput 8(7):1341\u20131390","journal-title":"Neural Comput"},{"key":"1004_CR87","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein M, Meinl T, Fischer I, Philippsen M (2005) A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM, and Gaston. In: Proceedings of the 9th European conference on principles and practice of knowledge discovery in databases PKDD), Porto, Portugal, pp 392\u2013403","DOI":"10.1007\/11564126_39"},{"key":"1004_CR88","unstructured":"Yu C, Ooi BC, Tan K-L, Jagadish V (2001) Indexing the distance: an efficient method to KNN processing. In: Proceedings of the 27th international conference on very large data bases (VLDB), Roma, Italy, pp 421\u2013430"},{"key":"1004_CR89","doi-asserted-by":"crossref","unstructured":"Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings of the 7th ACM international conference on knowledge discovery and data mining (SIGKDD), San Francisco, CA, pp 401\u2013406","DOI":"10.1145\/502512.502572"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-1004-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1004-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1004-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T19:04:09Z","timestamp":1568487849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-1004-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,22]]},"references-count":89,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["1004"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-1004-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,22]]}}}