{"title":"双曲数据空间的降维:边界重构信息损失","authors":"D.A. Iran, K. Vut","doi":"10.1109/ICIS.2008.82","DOIUrl":null,"url":null,"abstract":"We have started to see non-Euclidean geometries used in many applications, including visualization, network measurement, and geometric routing. Therefore, we need new mechanisms for managing and exploring non-Euclidean data. In this paper, we specifically address the dimensionality reduction problem for Hyperbolic data that are represented by the Poincare disk model. A desirable property of our solution is its reconstructed boundedness. In other words, we can reconstruct the data from its dimension-reduced version to obtain an approximation whose deviation from the original data is bounded and independent of the boundary measure of the original data space. We also propose a similarity search technique as an application of our reduction approach. We provide both theoretical and simulation analyses to substantiate the findings of our work.","PeriodicalId":382781,"journal":{"name":"Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dimensionality Reduction in Hyperbolic Data Spaces: Bounding Reconstructed-Information Loss\",\"authors\":\"D.A. Iran, K. Vut\",\"doi\":\"10.1109/ICIS.2008.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have started to see non-Euclidean geometries used in many applications, including visualization, network measurement, and geometric routing. Therefore, we need new mechanisms for managing and exploring non-Euclidean data. In this paper, we specifically address the dimensionality reduction problem for Hyperbolic data that are represented by the Poincare disk model. A desirable property of our solution is its reconstructed boundedness. In other words, we can reconstruct the data from its dimension-reduced version to obtain an approximation whose deviation from the original data is bounded and independent of the boundary measure of the original data space. We also propose a similarity search technique as an application of our reduction approach. We provide both theoretical and simulation analyses to substantiate the findings of our work.\",\"PeriodicalId\":382781,\"journal\":{\"name\":\"Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)\",\"volume\":\"146 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2008.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2008.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dimensionality Reduction in Hyperbolic Data Spaces: Bounding Reconstructed-Information Loss
We have started to see non-Euclidean geometries used in many applications, including visualization, network measurement, and geometric routing. Therefore, we need new mechanisms for managing and exploring non-Euclidean data. In this paper, we specifically address the dimensionality reduction problem for Hyperbolic data that are represented by the Poincare disk model. A desirable property of our solution is its reconstructed boundedness. In other words, we can reconstruct the data from its dimension-reduced version to obtain an approximation whose deviation from the original data is bounded and independent of the boundary measure of the original data space. We also propose a similarity search technique as an application of our reduction approach. We provide both theoretical and simulation analyses to substantiate the findings of our work.