{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:06:06Z","timestamp":1761663966626,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873214"],"award-info":[{"award-number":["61873214"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["XDJK2019B024"],"award-info":[{"award-number":["XDJK2019B024"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Euclidean distance between instances is widely used to capture the manifold structure of data and for graph-based dimensionality reduction. However, in some circumstances, the basic Euclidean distance cannot accurately capture the similarity between instances; some instances from different classes but close to the decision boundary may be close to each other, which may mislead the graph-based dimensionality reduction and compromise the performance. To mitigate this issue, in this paper, we proposed an approach called Laplacian Eigenmaps based on Clustering-Adjusted Similarity (LE-CAS). LE-CAS first performs clustering on all instances to explore the global structure and discrimination of instances, and quantifies the similarity between cluster centers. Then, it adjusts the similarity between pairwise instances by multiplying the similarity between centers of clusters, which these two instances respectively belong to. In this way, if two instances are from different clusters, the similarity between them is reduced; otherwise, it is unchanged. Finally, LE-CAS performs graph-based dimensionality reduction (via Laplacian Eigenmaps) based on the adjusted similarity. We conducted comprehensive empirical studies on UCI datasets and show that LE-CAS not only has a better performance than other relevant comparing methods, but also is more robust to input parameters.<\/jats:p>","DOI":"10.3390\/a12100210","type":"journal-article","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T10:54:58Z","timestamp":1570186498000},"page":"210","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Laplacian Eigenmaps Dimensionality Reduction Based on Clustering-Adjusted Similarity"],"prefix":"10.3390","volume":"12","author":[{"given":"Honghu","family":"Zhou","sequence":"first","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-0365","authenticated-orcid":false,"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3722","DOI":"10.1016\/j.eswa.2012.12.078","article-title":"A comparative study of dimensionality reduction techniques to enhance trace clustering performances","volume":"40","author":"Song","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ins.2014.03.011","article-title":"Dimensionality reduction: An interpretation from manifold regularization perspective","volume":"277","author":"Fan","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Domeniconi, C., Gunopulos, D., Kollios, G., and Koudas, N. (2002, January 23\u201326). Non-linear dimensionality reduction techniques for classification and visualization. Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775047.775143"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","article-title":"Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations","volume":"21","author":"Tao","year":"2011","journal-title":"SIAM J. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Shi, L., He, P., and Liu, E. (2005, January 5\u20139). An incremental nonlinear dimensionality reduction algorithm based on ISOMAP. Proceedings of the Australian Joint Conference on Advances in Artificial Intelligence, Sydney, Australia.","DOI":"10.1007\/11589990_104"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Massini, G., and Terzi, S. (2010). A new method of Multi Dimensional Scaling. Fuzzy Information Processing Society, IEEE.","DOI":"10.1109\/NAFIPS.2010.5548299"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Vel, O.D., Li, S., and Coomans, D. (1996). Non-Linear Dimensionality Reduction: A Comparative Performance Analysis. Learning from Data, Springer.","DOI":"10.1007\/978-1-4612-2404-4_31"},{"key":"ref_8","unstructured":"Leinonen, T. (2004). Principal Component Analysis and Factor Analysis, Springer. [2nd ed.]."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear Dimensionality Reduction by Locally Linear Embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"key":"ref_10","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume":"14","author":"Belkin","year":"2001","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.neucom.2012.07.016","article-title":"Enhanced and parameterless Locality Preserving Projections for face recognition","volume":"99","author":"Dornaika","year":"2013","journal-title":"Neurocomputing"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2676","DOI":"10.1109\/ACCESS.2016.2616584","article-title":"Robust Locality Preserving Projections With Cosine-Based Dissimilarity for Linear Dimensionality Reduction","volume":"5","author":"Qiang","year":"2017","journal-title":"IEEE Access"},{"key":"ref_13","unstructured":"He, X. (2005). Locality Preserving Projections. [Ph.D. Thesis, University of Chicago]."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.neucom.2010.09.005","article-title":"Enhanced locality preserving projections using robust path based similarity","volume":"74","author":"Yu","year":"2011","journal-title":"Neurocomputing"},{"key":"ref_15","unstructured":"Deng, C., He, X., and Han, J. (2007, January 14\u201321). Semi-supervised Discriminant Analysis. Proceedings of the IEEE 11th International Conference on Computer Vision, Rio de Janeiro, Brazil."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.neunet.2011.10.001","article-title":"Limited Rank Matrix Learning, discriminative dimension reduction and visualization","volume":"26","author":"Bunte","year":"2012","journal-title":"Neural Netw."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2789","DOI":"10.1016\/j.patcog.2008.01.001","article-title":"A unified framework for semi-supervised dimensionality reduction","volume":"41","author":"Song","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1134\/S1054661810040140","article-title":"Mixture graph based semi-supervised dimensionality reduction","volume":"20","author":"Yu","year":"2010","journal-title":"Pattern Recognit. Image Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TPAMI.2007.250598","article-title":"Graph embedding and extensions: A general framework for dimensionality reduction","volume":"29","author":"Yan","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1109\/TPAMI.2007.1131","article-title":"Orthogonal neighborhood preserving projections: A projection-based dimensionality reduction technique","volume":"29","author":"Effrosyni","year":"2007","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian Eigenmaps for Dimensionality Reduction and Data Representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Trad, M.R., Joly, A., and Boujemaa, N. (2012, January 10). Large Scale KNN-Graph Approximation. Proceedings of the 2012 IEEE 12th International Conference on Data Mining Workshops, Brussels, Belgium.","DOI":"10.1109\/ICDMW.2012.35"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"},{"key":"ref_24","first-page":"1683","article-title":"An introduction to nonlinear dimensionality reduction by maximum variance unfolding","volume":"6","author":"Weinberger","year":"2006","journal-title":"AAAI"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s11263-005-4939-z","article-title":"Unsupervised learning of image manifolds by semidefinite programming","volume":"70","author":"Weinberger","year":"2006","journal-title":"Int. J. Comput. Vis."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","article-title":"Subspace clustering for high dimensional data: A review","volume":"6","author":"Parsons","year":"2004","journal-title":"ACM Sigkdd Explor. Newsl."},{"key":"ref_27","first-page":"815","article-title":"Geodesic distance-based generalized Gaussian Laplacian Eigenmap","volume":"20","author":"Zeng","year":"2009","journal-title":"J. Softw."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2432","DOI":"10.1016\/j.patcog.2011.12.006","article-title":"A supervised non-linear dimensionality reduction approach for manifold learning","volume":"45","author":"Raducanu","year":"2012","journal-title":"Pattern Recognit."},{"key":"ref_29","unstructured":"Ning, W., Liu, J., and Deng, T. (2016, January 13\u201315). A supervised class-preserving Laplacian eigenmaps for dimensionality reduction. Proceedings of the International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, Changsha, China."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., and Kulis, B. (2004, January 22\u201325). Kernel k-means, Spectral Clustering and Normalized Cuts. Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, USA.","DOI":"10.1145\/1014052.1014118"},{"key":"ref_31","first-page":"210","article-title":"Semi-supervised classification based on clustering adjusted similarity","volume":"39","author":"Chen","year":"2017","journal-title":"Int. J. Comput. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1139\/f88-119","article-title":"The Fowlkes Mallows statistic and the comparison of two independently determined dendrograms","volume":"45","author":"Nemec","year":"1988","journal-title":"Can. J. Fish. Aquat. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"617946","DOI":"10.1155\/2009\/617946","article-title":"Regularized F-measure maximization for feature selection and classification","volume":"2009","author":"Liu","year":"2009","journal-title":"BioMed Res. Int."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3583","DOI":"10.1016\/j.ins.2009.06.012","article-title":"Performance evaluation of density-based clustering methods","volume":"179","author":"Aliguliyev","year":"2009","journal-title":"Inf. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/10\/210\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:27:36Z","timestamp":1760189256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/10\/210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":34,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2019,10]]}},"alternative-id":["a12100210"],"URL":"https:\/\/doi.org\/10.3390\/a12100210","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,10,4]]}}}