The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
A Comparison Study on Similarity and Dissimilarity Measures in Clustering Continuous Data
Open accessAbstract
Similarity or distance measures are core components used by distance-based clustering algorithms to cluster similar data points into the same clusters, while dissimilar or distant data points are placed into different clusters. The performance of similarity measures is mostly addressed in two or three-dimensional spaces, beyond which, to the best of our knowledge, there is no empirical study that has revealed the behavior of similarity measures when dealing with high-dimensional datasets. To fill this gap, a technical framework is proposed in this study to analyze, compare and benchmark the influence of different similarity measures on the results of distance-based clustering algorithms. For reproducibility purposes, fifteen publicly available datasets were used for this study, and consequently, future distance measures can be evaluated and compared with the results of the measures discussed in this work. These datasets were classified as low and high-dimensional categories to study the performance of each measure against each category. This research should help the research community to identify suitable distance measures for datasets and also to facilitate a comparison and evaluation of the newly proposed similarity or distance measures with traditional ones.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
FCM: The fuzzy c-means clustering algorithm
Bezdek, J. C., Ehrlich, R., & Full, W. (1984) · Computers & Geosciences · doi:10.1016/0098-3004(84)90020-7 · Cited by 6,608
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Data Mining: Concepts and Techniques
Thamaraiselvi, G., & Kaliammal, A. (2014) · Journal of Information and Knowledge · Cited by 4,088
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826 · cited 2×
“Examples of distance-based clustering algorithms include partitioning clustering algorithms, such as k-means as well as k-medoids and hierarchical clustering [17].”
MethodSelf-citationGraph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Comprehensive Survey on Distance/Similarity Measures between Probability Density Functions
Cha, S.-H. (2007) · Cited by 1,644
Data Clustering: Theory, Algorithms, and Applications
Gan, G., Ma, C., & Wu, J. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718348 · Cited by 1,562
Improved Heterogeneous Distance Functions
Wilson, D. R., & Martinez, T. R. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.346 · Cited by 1,344
Cluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
Impact of Similarity Measures on Web-page Clustering
Strehl, A. L., Ghosh, J., & Mooney, R. J. (2000) · Cited by 658
Similarity Measures for Categorical Data: A Comparative Evaluation
Boriah, S., Chandola, V., & Kumar, V. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.22 · Cited by 575
FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data
Fu, L., & Medico, E. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-3 · Cited by 527
Clustering short time series gene expression data
Ernst, J., Nau, G. J., & Bar-Joseph, Z. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1022 · Cited by 516
Clustering by pattern similarity in large data sets
Wang, H., Wang, W., Yang, J., & Yu, P. S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564737 · Cited by 484
A maximum variance cluster algorithm
Veenman, C. J., Reinders, M. J. T., & Backer, E. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033218 · Cited by 455
Clustering cancer gene expression data: a comparative study
de Souto, M. C., Costa, I. G., de Araujo, D. S., Ludermir, T. B., & Schliep, A. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-497 · Cited by 444
On the Use of the Adjusted Rand Index as a Metric for Evaluating Supervised Classification
Santos, J. M., & Embrechts, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04277-5_18 · Cited by 441
Cluster and calendar based visualization of time series data
van Wijk, J. J., & van Selow, E. R. (2003) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.1999.801851 · Cited by 417
(2005) · Lecture Notes in Computer Science · doi:10.1007/b136266 · Cited by 394
Distance measures for PCA-based face recognition
Perlibakas, V. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.01.011 · Cited by 316
A self-organizing network for hyperellipsoidal clustering (HEC)
Mao, J., & Jain, A. K. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.478389 · Cited by 281
Comparison of Similarity Measures for Trajectory Clustering in Outdoor Surveillance Scenes
Zhang, Z., Huang, K., & Tan, T. (2006) · 18th International Conference on Pattern Recognition (ICPR'06) · doi:10.1109/icpr.2006.392 · Cited by 240
Shirkhorshidi, A. S., Aghabozorgi, S., Wah, T. Y., & Herawan, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-09156-3_49 · Cited by 230
Self-citationIglesias, F., & Kastner, W. (2013) · Energies · doi:10.3390/en6020579 · Cited by 216
Gionis, A., Mannila, H., & Tsaparas, P. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.34 · Cited by 169
Gervasi, O., Murgante, B., Misra, S., Gavrilova, M. L., Rocha, A. M. A. C., Torre, C. D. L., Taniar, D., & Apduhan, B. O. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21407-8 · Cited by 97
Iterative big data clustering algorithms: a review
Mohebi, A., Aghabozorgi, S. R., Wah, T. Y., Herawan, T., & Yahyapour, R. (2015) · Software Practice and Experience · doi:10.1002/spe.2341 · Cited by 66
Self-citationKhalifa, A. A., Harańczyk, M., & Holliday, J. D. (2009) · Journal of Chemical Information and Modeling · doi:10.1021/ci8004644 · Cited by 48
Time-series analyses of air pollution and mortality in the United States: a subsampling approach
Moolgavkar, S. H., McClellan, R. O., Dewanji, A., Turim, J., Luebeck, E. G., & Edwards, M. (2013) · Environmental Health Perspectives · doi:10.1289/ehp.1104507 · Cited by 46
Comparison of Profile Similarity Measures for Genetic Interaction Networks
Deshpande, R., VanderSluis, B., & Myers, C. L. (2013) · PLoS ONE · doi:10.1371/journal.pone.0068664 · Cited by 41
A Dynamic Fuzzy Cluster Algorithm for Time Series
Ji, M., Xie, F., & Ping, Y. (2013) · Abstract and Applied Analysis · doi:10.1155/2013/183410 · Cited by 30
Dynamic Clustering of Gene Expression
An, L., & Doerge, R. W. (2012) · ISRN Bioinformatics · doi:10.5402/2012/537217 · Cited by 17
Land Use Patch Generalization Based on Semantic Priority
Yang, J., Kong, F., Xi, J., Ge, Q., Li, X., & Xie, P. (2013) · Abstract and Applied Analysis · doi:10.1155/2013/151520 · Cited by 10
Cited by
Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review
Abu Alfeilat, H. A., Hassanat, A. B. A., Lasassmeh, O., Tarawneh, A. S., Alhasanat, M. B., Eyal Salman, H. S., & Prasath, V. B. S. (2019) · Big Data · doi:10.1089/big.2018.0175 · Cited by 667
Global acceleration in rates of vegetation change over the past 18,000 years
Mottl, O., Flantua, S. G. A., Bhatta, K. P., Felde, V. A., Giesecke, T., Goring, S., Grimm, E. C., Haberle, S., Hooghiemstra, H., Ivory, S., et al. (2021) · Science · doi:10.1126/science.abg1685 · Cited by 307
Nonato, L. G., & Aupetit, M. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2846735 · Cited by 259
Impact of similarity metrics on single-cell RNA-seq data clustering
Kim, T., Chen, I. R., Lin, Y., Wang, A. Y.-Y., Yang, J. Y. H., & Yang, P. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bby076 · Cited by 138
Dar, S. S., Rehman, M. Z. U., Bais, K., Haseeb, M. A., & Kumar, N. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125337 · Cited by 36
“Additionally, their choice of neighborhood based on Euclidean distance between nodes is suboptimal for high-dimensional data spaces [20].”
Metadata
- Authors
- Shirkhorshidi, A. S., Aghabozorgi, S., & Wah, T. Y.
- Venue
- PLOS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2015-12-11
- Volume
- 10
- Issue
- 12
- Pages
- e0144059
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2270192120
- Cited by
- 405
- References
- 37
- FWCI
- 10.64
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.