Nombre Claude Issa, Brou Konan Marcellin, Kimou Kouadio Prosper
{"title":"Opti2I and ε-precis Methods Selection Algorithm","authors":"Nombre Claude Issa, Brou Konan Marcellin, Kimou Kouadio Prosper","doi":"10.5121/ijcsa.2020.10401","DOIUrl":null,"url":null,"abstract":"Since the reference algorithm APRIORI [AGR97], other algorithms for optimizing the extraction of association rules have been developed. But no method is generally better than the others. This article deals with the optimization of closed itemsets in the context of highly correlated data. The work in this article responds to one of the perspectives of our article entitled \"A new approach to optimizing the extraction of frequent 2-itemsets\". In this previous article, we had obtained interesting optimization results from the 2-itemsets on a context of extraction of scattered data (weakly correlated data). The present article allowed us to obtain interesting results of the 2-itemsets on dense data (strongly correlated). Our approach was inspired by the research work of {Pas00, CB02, BBR03, CF14]. It has improved the extraction of a concise number of association rules by introducing a margin of error defined by the parameter in the formula δ δ Ferm (S)-δ <ε (δ an integer, δ>0, Ferm (S) is the -Closure of the","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"149 1","pages":"1-15"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/ijcsa.2020.10401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0
Abstract
Since the reference algorithm APRIORI [AGR97], other algorithms for optimizing the extraction of association rules have been developed. But no method is generally better than the others. This article deals with the optimization of closed itemsets in the context of highly correlated data. The work in this article responds to one of the perspectives of our article entitled "A new approach to optimizing the extraction of frequent 2-itemsets". In this previous article, we had obtained interesting optimization results from the 2-itemsets on a context of extraction of scattered data (weakly correlated data). The present article allowed us to obtain interesting results of the 2-itemsets on dense data (strongly correlated). Our approach was inspired by the research work of {Pas00, CB02, BBR03, CF14]. It has improved the extraction of a concise number of association rules by introducing a margin of error defined by the parameter in the formula δ δ Ferm (S)-δ <ε (δ an integer, δ>0, Ferm (S) is the -Closure of the
期刊介绍:
IJCSA is an international forum for scientists and engineers involved in computer science and its applications to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the IJCSA are selected through rigorous peer review to ensure originality, timeliness, relevance, and readability.