{"title":"张量对象的随机投影建模","authors":"Ryohei Yokobayashi, T. Miura","doi":"10.1145/3106426.3106504","DOIUrl":null,"url":null,"abstract":"In this investigation, we discuss high order data structure (called tensor) for efficient information retrieval and show especially how well reduction techniques of dimensionality goes while preserving Euclid distance between information. High order data structure requires much amount of space. One of the effective approaches comes from dimensionality reduction such as Latent Semantic Indexing (LSI) and Random Projection (RP) which allows us to reduce complexity of time and space dramatically. The reduction techniques can be applied to high order data structure. Here we examine High Order Random Projection (HORP) which provides us with efficient information retrieval keeping feasible dimensionality reduction.","PeriodicalId":20685,"journal":{"name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","volume":"73 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modeling random projection for tensor objects\",\"authors\":\"Ryohei Yokobayashi, T. Miura\",\"doi\":\"10.1145/3106426.3106504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this investigation, we discuss high order data structure (called tensor) for efficient information retrieval and show especially how well reduction techniques of dimensionality goes while preserving Euclid distance between information. High order data structure requires much amount of space. One of the effective approaches comes from dimensionality reduction such as Latent Semantic Indexing (LSI) and Random Projection (RP) which allows us to reduce complexity of time and space dramatically. The reduction techniques can be applied to high order data structure. Here we examine High Order Random Projection (HORP) which provides us with efficient information retrieval keeping feasible dimensionality reduction.\",\"PeriodicalId\":20685,\"journal\":{\"name\":\"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics\",\"volume\":\"73 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3106426.3106504\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3106426.3106504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this investigation, we discuss high order data structure (called tensor) for efficient information retrieval and show especially how well reduction techniques of dimensionality goes while preserving Euclid distance between information. High order data structure requires much amount of space. One of the effective approaches comes from dimensionality reduction such as Latent Semantic Indexing (LSI) and Random Projection (RP) which allows us to reduce complexity of time and space dramatically. The reduction techniques can be applied to high order data structure. Here we examine High Order Random Projection (HORP) which provides us with efficient information retrieval keeping feasible dimensionality reduction.