{"title":"一种改进的加权局部线性嵌入算法","authors":"Qing Wu, Zongxian Qi, Zhicang Wang, Yu Zhang","doi":"10.1109/CIS2018.2018.00090","DOIUrl":null,"url":null,"abstract":"Local linear embedding has the characteristics of nonlinearity and simple implementation, but it cannot accurately handle the selection of neighborhoods under the conditions of noise, large curvature and sparse sampling. To solve this problem, an improved weighted local linear embedding method (WLE-LLE) is proposed. In WLE-LLE, the dimensionality reduction objective function is reconstructed by utilizing Laplacian Eigenmaps, which can effectively represent the manifold structure of nonlinear data. Theoretical analyses show the proposed method is better than LLE algorithm in preserving the original manifold structure of the data. And numerical experiments show its classification recognition rate is greatly improved, which is 2%-8% higher than LLE.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"389 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Improved Weighted Local Linear Embedding Algorithm\",\"authors\":\"Qing Wu, Zongxian Qi, Zhicang Wang, Yu Zhang\",\"doi\":\"10.1109/CIS2018.2018.00090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Local linear embedding has the characteristics of nonlinearity and simple implementation, but it cannot accurately handle the selection of neighborhoods under the conditions of noise, large curvature and sparse sampling. To solve this problem, an improved weighted local linear embedding method (WLE-LLE) is proposed. In WLE-LLE, the dimensionality reduction objective function is reconstructed by utilizing Laplacian Eigenmaps, which can effectively represent the manifold structure of nonlinear data. Theoretical analyses show the proposed method is better than LLE algorithm in preserving the original manifold structure of the data. And numerical experiments show its classification recognition rate is greatly improved, which is 2%-8% higher than LLE.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"389 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Weighted Local Linear Embedding Algorithm
Local linear embedding has the characteristics of nonlinearity and simple implementation, but it cannot accurately handle the selection of neighborhoods under the conditions of noise, large curvature and sparse sampling. To solve this problem, an improved weighted local linear embedding method (WLE-LLE) is proposed. In WLE-LLE, the dimensionality reduction objective function is reconstructed by utilizing Laplacian Eigenmaps, which can effectively represent the manifold structure of nonlinear data. Theoretical analyses show the proposed method is better than LLE algorithm in preserving the original manifold structure of the data. And numerical experiments show its classification recognition rate is greatly improved, which is 2%-8% higher than LLE.