{"title":"基于t -混合模型和ICA的大规模图数据库索引","authors":"B. Luo, A. Zheng, Jin Tang, Haifeng Zhao","doi":"10.1109/ICIG.2007.124","DOIUrl":null,"url":null,"abstract":"This paper proposes an indexing scheme based on t- mixture model and ICA, which is more robust than Gaussian mixture modeling when atypical points (or outliers) exist or the set of data has heavy tail. This indexing scheme combines optimized vector quantizer and probabilistic approximate-based indexing scheme. Experimental results on large-scale graph database show a notable efficiency improvement with optimistic precision.","PeriodicalId":367106,"journal":{"name":"Fourth International Conference on Image and Graphics (ICIG 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"72","resultStr":"{\"title\":\"Large-Scale Graph Database Indexing Based on T-mixture Model and ICA\",\"authors\":\"B. Luo, A. Zheng, Jin Tang, Haifeng Zhao\",\"doi\":\"10.1109/ICIG.2007.124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an indexing scheme based on t- mixture model and ICA, which is more robust than Gaussian mixture modeling when atypical points (or outliers) exist or the set of data has heavy tail. This indexing scheme combines optimized vector quantizer and probabilistic approximate-based indexing scheme. Experimental results on large-scale graph database show a notable efficiency improvement with optimistic precision.\",\"PeriodicalId\":367106,\"journal\":{\"name\":\"Fourth International Conference on Image and Graphics (ICIG 2007)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Conference on Image and Graphics (ICIG 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIG.2007.124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on Image and Graphics (ICIG 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIG.2007.124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Large-Scale Graph Database Indexing Based on T-mixture Model and ICA
This paper proposes an indexing scheme based on t- mixture model and ICA, which is more robust than Gaussian mixture modeling when atypical points (or outliers) exist or the set of data has heavy tail. This indexing scheme combines optimized vector quantizer and probabilistic approximate-based indexing scheme. Experimental results on large-scale graph database show a notable efficiency improvement with optimistic precision.