{"title":"基于频繁项目率的最小支持度选择","authors":"Haiyan Zhou, Xiaobing Chen, Yunyang Yan","doi":"10.1109/ISCID.2009.65","DOIUrl":null,"url":null,"abstract":"Association rules mining is an important branch of data mining research, which affords interesting relations between items of data sets. Minimum support degree is an important reference value in association rules mining and its threshold is usually given by user. The problem of how to determine the threshold when data mining is not researched until nowadays. So a selection mining support degree algorithm is put forwarded in this paper, and it has important significance in practical application.","PeriodicalId":294370,"journal":{"name":"International Symposium on Computational Intelligence and Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Selection of Minimum Support Degree with Rate of Frequent Items\",\"authors\":\"Haiyan Zhou, Xiaobing Chen, Yunyang Yan\",\"doi\":\"10.1109/ISCID.2009.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rules mining is an important branch of data mining research, which affords interesting relations between items of data sets. Minimum support degree is an important reference value in association rules mining and its threshold is usually given by user. The problem of how to determine the threshold when data mining is not researched until nowadays. So a selection mining support degree algorithm is put forwarded in this paper, and it has important significance in practical application.\",\"PeriodicalId\":294370,\"journal\":{\"name\":\"International Symposium on Computational Intelligence and Design\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2009.65\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2009.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Selection of Minimum Support Degree with Rate of Frequent Items
Association rules mining is an important branch of data mining research, which affords interesting relations between items of data sets. Minimum support degree is an important reference value in association rules mining and its threshold is usually given by user. The problem of how to determine the threshold when data mining is not researched until nowadays. So a selection mining support degree algorithm is put forwarded in this paper, and it has important significance in practical application.