Min-Max-Jump distance and its applications
Abstract: We explore three applications of Min-Max-Jump distance (MMJ distance). MMJ-based K-means revises K-means with MMJ distance. MMJ-based Silhouette coefficient revises Silhouette coefficient with MMJ distance. We also tested the Clustering with Neural Network and Index (CNNI) model with MMJ-based Silhouette coefficient. In the last application, we tested using Min-Max-Jump distance for predicting labels of new points, after a clustering analysis of data. Result shows Min-Max-Jump distance achieves good performances in all the three proposed applications. In addition, we devise several algorithms for calculating or estimating the distance.
- Hans-Hermann Bock. 2007. Clustering methods: a history of k-means algorithms. Selected contributions in data analysis and classification (2007), 161–172.
- Paolo M. Camerini. 1978. The min-max spanning tree problem and some extensions. Inform. Process. Lett. 7, 1 (1978), 10–14.
- Nitin R Chopde and Mangesh Nichat. 2013. Landmark based shortest path detection by using A* and Haversine formula. International Journal of Innovative Research in Computer and Communication Engineering 1, 2 (2013), 298–302.
- Roland Coghetto. 2016. Chebyshev distance. (2016).
- Comparing sets of patterns with the Jaccard index. Australasian Journal of Information Systems 22 (2018).
- Patrick JF Groenen and Krzysztof Jajuga. 2001. Fuzzy clustering with squared Minkowski distances. Fuzzy Sets and Systems 120, 2 (2001), 227–237.
- Maria Halkidi and Michalis Vazirgiannis. 2008. A density-based cluster validity approach using multi-representatives. Pattern Recognition Letters 29, 6 (2008), 773–786.
- TC Hu. 1961. The maximum capacity route problem. Operations Research 9, 6 (1961), 898–900.
- Stan Z. Li and Anil Jain (Eds.). 2009. Hamming Distance. Springer US, Boston, MA, 668–668. https://doi.org/10.1007/978-0-387-73003-5_956
- Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms. J. Mach. Learn. Res. 21 (2020), 6:1–6:66. http://jmlr.org/papers/v21/18-085.html
- Gangli Liu. 2021. Topic Model Supervised by Understanding Map. arXiv preprint arXiv:2110.06043 (2021).
- Gangli Liu. 2022a. Clustering with Neural Network and Index. arXiv preprint arXiv:2212.03853 (2022).
- Gangli Liu. 2022b. A New Index for Clustering Evaluation Based on Density Estimation. arXiv preprint arXiv:2207.01294 (2022).
- Density-based clustering validation. In Proceedings of the 2014 SIAM international conference on data mining. SIAM, 839–847.
- Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research 12 (2011), 2825–2830.
- Maurice Pollack. 1960. The maximum capacity through a network. Operations Research 8, 5 (1960), 733–736.
- Erich Schubert and Peter J Rousseeuw. 2021. Fast and eager k-medoids clustering: O (k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Information Systems 101 (2021), 101804.
- Ali Şenol. 2022. VIASCKDE Index: A Novel Internal Cluster Validity Index for Arbitrary-Shaped Clusters Based on the Kernel Density Estimation. Computational Intelligence and Neuroscience 2022 (2022).
- Deepak Sinwar and Rahul Kaushik. 2014. Study of Euclidean and Manhattan distance metrics using simple k-means clustering. Int. J. Res. Appl. Sci. Eng. Technol 2, 5 (2014), 270–274.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.