{"title":"基于模糊关联规则的大数据集知识挖掘","authors":"Sudersan Behera","doi":"10.1109/ICISC44355.2019.9036356","DOIUrl":null,"url":null,"abstract":"As we know that fuzzy association rules are used to convert crisp set elements in to fuzzy set elements like “height=long”. On other hand Association rules on crisp set are bounded with in a limit to transfer crisp set elements in to the binary values like “height = [5.5feet or above]” and it losses some information at boundaries because of its restricted nature. Today the variations of fuzzy association rule mining is most popular. As the crisp version of Apriori, fuzzy Apriori algorithms are quit inefficient for large volume of data sets. Hence it is required to bring an efficient and powerful FA rule mining for better performance over large volume of data sets. I f we compare the fuzzy Apriori with the proposed algorithm the proposed algorithm is almost 16% faster than the earlier one if both the algorithm compared together in case of very large data sets. The proposed algorithm also has excellent processing techniques to convert the non-fuzzy dataset into fuzzy dataset","PeriodicalId":419157,"journal":{"name":"2019 Third International Conference on Inventive Systems and Control (ICISC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Knowledge Mining from Large Volume of Dataset using Fuzzy Association Rule\",\"authors\":\"Sudersan Behera\",\"doi\":\"10.1109/ICISC44355.2019.9036356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As we know that fuzzy association rules are used to convert crisp set elements in to fuzzy set elements like “height=long”. On other hand Association rules on crisp set are bounded with in a limit to transfer crisp set elements in to the binary values like “height = [5.5feet or above]” and it losses some information at boundaries because of its restricted nature. Today the variations of fuzzy association rule mining is most popular. As the crisp version of Apriori, fuzzy Apriori algorithms are quit inefficient for large volume of data sets. Hence it is required to bring an efficient and powerful FA rule mining for better performance over large volume of data sets. I f we compare the fuzzy Apriori with the proposed algorithm the proposed algorithm is almost 16% faster than the earlier one if both the algorithm compared together in case of very large data sets. The proposed algorithm also has excellent processing techniques to convert the non-fuzzy dataset into fuzzy dataset\",\"PeriodicalId\":419157,\"journal\":{\"name\":\"2019 Third International Conference on Inventive Systems and Control (ICISC)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Third International Conference on Inventive Systems and Control (ICISC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISC44355.2019.9036356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Third International Conference on Inventive Systems and Control (ICISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISC44355.2019.9036356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Knowledge Mining from Large Volume of Dataset using Fuzzy Association Rule
As we know that fuzzy association rules are used to convert crisp set elements in to fuzzy set elements like “height=long”. On other hand Association rules on crisp set are bounded with in a limit to transfer crisp set elements in to the binary values like “height = [5.5feet or above]” and it losses some information at boundaries because of its restricted nature. Today the variations of fuzzy association rule mining is most popular. As the crisp version of Apriori, fuzzy Apriori algorithms are quit inefficient for large volume of data sets. Hence it is required to bring an efficient and powerful FA rule mining for better performance over large volume of data sets. I f we compare the fuzzy Apriori with the proposed algorithm the proposed algorithm is almost 16% faster than the earlier one if both the algorithm compared together in case of very large data sets. The proposed algorithm also has excellent processing techniques to convert the non-fuzzy dataset into fuzzy dataset