L. Hearne, D. Kelly, Avimanyou K. Vatsa, Wade Mayham, T. Kazic
{"title":"跨高维观测域的统计联系","authors":"L. Hearne, D. Kelly, Avimanyou K. Vatsa, Wade Mayham, T. Kazic","doi":"10.2498/iti.2013.0554","DOIUrl":null,"url":null,"abstract":"Many experimental sciences collect different kinds of high-dimensional data on the same experimental units. When comparing relationships among homogeneous regions in one high dimensional domain with regions in another high dimensional domain, the number of possible comparisons may be extremely large and their set complexity unknown. We outline procedures for identifying possible relationships among regions in two different high-dimensional domains. If the data are dense enough, then statistical measures of association can be estimated. These procedures can identify and measure the probability of inter-domain associations of mixed complexity.","PeriodicalId":262789,"journal":{"name":"Proceedings of the ITI 2013 35th International Conference on Information Technology Interfaces","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Statistical linkage across high dimensional observational domains\",\"authors\":\"L. Hearne, D. Kelly, Avimanyou K. Vatsa, Wade Mayham, T. Kazic\",\"doi\":\"10.2498/iti.2013.0554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many experimental sciences collect different kinds of high-dimensional data on the same experimental units. When comparing relationships among homogeneous regions in one high dimensional domain with regions in another high dimensional domain, the number of possible comparisons may be extremely large and their set complexity unknown. We outline procedures for identifying possible relationships among regions in two different high-dimensional domains. If the data are dense enough, then statistical measures of association can be estimated. These procedures can identify and measure the probability of inter-domain associations of mixed complexity.\",\"PeriodicalId\":262789,\"journal\":{\"name\":\"Proceedings of the ITI 2013 35th International Conference on Information Technology Interfaces\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ITI 2013 35th International Conference on Information Technology Interfaces\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2498/iti.2013.0554\",\"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 ITI 2013 35th International Conference on Information Technology Interfaces","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2498/iti.2013.0554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Statistical linkage across high dimensional observational domains
Many experimental sciences collect different kinds of high-dimensional data on the same experimental units. When comparing relationships among homogeneous regions in one high dimensional domain with regions in another high dimensional domain, the number of possible comparisons may be extremely large and their set complexity unknown. We outline procedures for identifying possible relationships among regions in two different high-dimensional domains. If the data are dense enough, then statistical measures of association can be estimated. These procedures can identify and measure the probability of inter-domain associations of mixed complexity.