The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Minkowski metric, feature weighting and anomalous cluster initializing in K-Means clustering
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Witten, I. H. (2008) · Cited by 9,143
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Distance Metric Learning with Application to Clustering with Side-Information
Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2002) · Cited by 2,700
Haralick, R. M., & Shapiro, L. G. (1985) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(85)90153-7 · Cited by 2,253
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003) · Machine Learning · doi:10.1023/a:1023949509487 · Cited by 2,116
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
Clustering with Bregman Divergences
Banerjee, A., Merugu, S., Dhillon, I., & Ghosh, J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.22 · Cited by 1,472
Sibson, R., & Hartigan, J. A. (1976) · Applied Statistics · doi:10.2307/2346526 · Cited by 1,435
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
Hierarchical grouping methods and stopping rules: an evaluation
Mojena, R. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.359 · Cited by 979
Integrating constraints and metric learning in semi-supervised clustering
Bilenko, M., Basu, S., & Mooney, R. J. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015360 · Cited by 849
A survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
Impact of Similarity Measures on Web-page Clustering
Strehl, A. L., Ghosh, J., & Mooney, R. J. (2000) · Cited by 658
Proceedings of the Fifteenth International Conference on Machine Learning
SHAVLIK, J. W. (1998) · Cited by 462
Top-down induction of clustering trees
Blockeel, H., Raedt, L. D., & Ramon, J. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0011032 · Cited by 397
Feature Weighting in k-Means Clustering
Modha, D. S., & Spangler, W. S. (2003) · Machine Learning · doi:10.1023/a:1024016609528 · Cited by 382
Chiang, M. M.-T., & Mirkin, B. (2010) · Journal of Classification · doi:10.1007/s00357-010-9049-5 · Cited by 319
Self-citationInitializing K-means Batch Clustering: A Critical Evaluation of Several Techniques
Steinley, D., & Brusco, M. J. (2007) · Journal of Classification · doi:10.1007/s00357-007-0003-0 · Cited by 316
The Concentration of Fractional Distances
Francois, D., Wertz, V., & Verleysen, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1037 · Cited by 308
Clustering for Data Mining: A Data Recovery Approach
Mirkin, B. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 300
Self-citationEvaluating clustering in subspace projections of high dimensional data
Müller, E., Günnemann, S., Assent, I., & Seidl, T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687770 · Cited by 247
An optimization algorithm for clustering using weighted dissimilarity measures
Chan, E. Y., Ching, W. K., Ng, M. K., & Huang, J. Z. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2003.11.003 · Cited by 235
Hong, Y., Kwong, S., Chang, Y., & Ren, Q. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.03.007 · Cited by 147
The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List
Rudin, C. D. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.5555/1577069.1755861 · Cited by 136
An initialization method for the K -Means algorithm using neighborhood model
Cao, F., Liang, J., & Jiang, G. (2009) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2009.04.017 · Cited by 133
Non-negative matrix factorization for semi-supervised data clustering
Chen, Y., Rege, M., Dong, M., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-008-0134-6 · Cited by 131
Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
Tsai, C.-Y., & Chiu, C.-C. (2008) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2008.03.002 · Cited by 129
Fan, J., Han, M., & Wang, J. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2009.04.013 · Cited by 113
Makarenkov, V., & Legendre, P. (2001) · Journal of Classification · doi:10.1007/s00357-001-0018-x · Cited by 100
The p-norm generalization of the LMS algorithm for adaptive filtering
Kivinen, J., Warmuth, M. K., & Hassibi, B. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872551 · Cited by 73
McLachlan, G. J., & Khan, R. N. (2004) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2004.02.002 · Cited by 39
Weighting Method for Feature Selection in K-Means
Huang, J. Z., Xu, J. L., Ng, M. K., et al. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796-19 · Cited by 28
An Adaptive Spell Checker Based on PS3M: Improving the Clusters of Replacement Words
de Amorim, R. C. (2009) · Advances in intelligent and soft computing · doi:10.1007/978-3-540-93905-4_61 · Cited by 5
Cited by
Rashidi, H. H., Tran, N. K., Betts, E. V., Howell, L. P., & Green, R. (2019) · Academic Pathology · doi:10.1177/2374289519873088 · Cited by 371
Recovering the number of clusters in data sets with noise features using feature rescaling factors
de Amorim, R. C., & Hennig, C. (2015) · Information Sciences · doi:10.1016/j.ins.2015.06.039 · Cited by 354
A review of moving object trajectory clustering algorithms
Yuan, G., Sun, P., Zhao, J., Li, D., & Wang, C. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9477-7 · Cited by 323
Feature weighting in DBSCAN using reverse nearest neighbours
Chowdhury, S., Helian, N., & Cordeiro de Amorim, R. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109314 · Cited by 39
Herath, H. M. D. P. M., Weraniyagoda, W. A. S. A., Rajapaksha, R. T. M., Wijesekara, P. A. D. S. N., Sudheera, K. L. K., & Chong, P. H. J. (2022) · Sensors · doi:10.3390/s22186966 · Cited by 23
Metadata
- Authors
- Cordeiro de Amorim, R., & Mirkin, B.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2012-03
- Volume
- 45
- Issue
- 3
- Pages
- 1061-1075
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2017100743
- Cited by
- 328
- References
- 41
- FWCI
- 17.74
- Type
- journal article
- Language
- en
- Open access
- closed
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.