{"title":"基于频繁项集挖掘的图像分类技术","authors":"Qing Nie, Shou-yi Zhan, Jing-Xia Su","doi":"10.1109/CCPR.2008.36","DOIUrl":null,"url":null,"abstract":"We propose a novel method to detect frequent and distinctive feature configuration on a class instance. Each neighborhood of a local feature is described by a list of nonzero indices, and generates a transaction. An efficient mining of frequent item sets algorithm is used to automatically find spatial configurations of local features occurring frequently on a class instance. These mined spatial configurations can be used as special words, incorporate into bag of features classification model. Through evaluation on PASCAL 2007 Visual Recognition Challenge dataset set, the test results show that this mining algorithm is computationally efficient and allows to process large training sets rapidly. Moreover, the mined feature configurations have higher discriminative power compare to individual features.","PeriodicalId":292956,"journal":{"name":"2008 Chinese Conference on Pattern Recognition","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Image Classification Technology Based on Mining of Frequent Item Sets\",\"authors\":\"Qing Nie, Shou-yi Zhan, Jing-Xia Su\",\"doi\":\"10.1109/CCPR.2008.36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel method to detect frequent and distinctive feature configuration on a class instance. Each neighborhood of a local feature is described by a list of nonzero indices, and generates a transaction. An efficient mining of frequent item sets algorithm is used to automatically find spatial configurations of local features occurring frequently on a class instance. These mined spatial configurations can be used as special words, incorporate into bag of features classification model. Through evaluation on PASCAL 2007 Visual Recognition Challenge dataset set, the test results show that this mining algorithm is computationally efficient and allows to process large training sets rapidly. Moreover, the mined feature configurations have higher discriminative power compare to individual features.\",\"PeriodicalId\":292956,\"journal\":{\"name\":\"2008 Chinese Conference on Pattern Recognition\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Chinese Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCPR.2008.36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Chinese Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCPR.2008.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image Classification Technology Based on Mining of Frequent Item Sets
We propose a novel method to detect frequent and distinctive feature configuration on a class instance. Each neighborhood of a local feature is described by a list of nonzero indices, and generates a transaction. An efficient mining of frequent item sets algorithm is used to automatically find spatial configurations of local features occurring frequently on a class instance. These mined spatial configurations can be used as special words, incorporate into bag of features classification model. Through evaluation on PASCAL 2007 Visual Recognition Challenge dataset set, the test results show that this mining algorithm is computationally efficient and allows to process large training sets rapidly. Moreover, the mined feature configurations have higher discriminative power compare to individual features.