{"title":"数据嵌入技术及应用","authors":"Li Yang","doi":"10.1145/1160939.1160948","DOIUrl":null,"url":null,"abstract":"As an effective way for dimensionality reduction, data embedding has direct applications in data mining, data indexing and searching, information retrieval, and multimedia data processing. As two representative techniques for data embedding, both Isomap and LLE require the construction of neighborhood graphs on which every point is connected to its neighbors. This paper reviews several techniques that have been developed to construct connected neighborhood graphs. These methods have made Isomap and LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. Application-related issues of data embedding techniques are also discussed.","PeriodicalId":346313,"journal":{"name":"Computer Vision meets Databases","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Data embedding techniques and applications\",\"authors\":\"Li Yang\",\"doi\":\"10.1145/1160939.1160948\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an effective way for dimensionality reduction, data embedding has direct applications in data mining, data indexing and searching, information retrieval, and multimedia data processing. As two representative techniques for data embedding, both Isomap and LLE require the construction of neighborhood graphs on which every point is connected to its neighbors. This paper reviews several techniques that have been developed to construct connected neighborhood graphs. These methods have made Isomap and LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. Application-related issues of data embedding techniques are also discussed.\",\"PeriodicalId\":346313,\"journal\":{\"name\":\"Computer Vision meets Databases\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Vision meets Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1160939.1160948\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Vision meets Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1160939.1160948","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
As an effective way for dimensionality reduction, data embedding has direct applications in data mining, data indexing and searching, information retrieval, and multimedia data processing. As two representative techniques for data embedding, both Isomap and LLE require the construction of neighborhood graphs on which every point is connected to its neighbors. This paper reviews several techniques that have been developed to construct connected neighborhood graphs. These methods have made Isomap and LLE applicable to a wide range of data including under-sampled data and non-uniformly distributed data. Application-related issues of data embedding techniques are also discussed.