Principal Component Analysis Untuk Analisa Pola Tangkapan Ikan Di Indonesia

Different kinds of fish in Indonesia is very much known to exist more than 80 species of fish caught in the waters of Indonesia. To find out which type of fish caught necessary analysis of the data pattern catches so as to know what kind of fish are caught. Search pattern or associative relationships of large-scale data that are closely related to data mining. Analysis of the association or the association rule mining is a data mining technique to discover the rules of associative between a combination of items. In the association rule method, there are two processes, namely the process of generating Frequent Itemset and trenching association rules. Frequent Itemset Generation is a process to get itemset interconnected and has a value of association based on the value of support and confidence. The algorithm used to generate the frequent itemset is Apriori Algorithm.Apriori algorithm has a weakness in the appropriate feature extraction that is used to attribute causing rule that formed a research banyak.dalam bebasis applying apriori algorithm principal component analysis to obtain a more optimal rule. After experiments using apriori algorithm with a magnitude Φ = 30, min Support 80% and 80% Confidence min rule formed results totaled 82 rules. While the second experiment was done by using an algorithm based on principal component analysis priori the magnitude Φ = 30, min Support 80% and 80% Confidence min formed results amounted to 12 rules to fully lift the ratio of

PRINCIPAL COMPONENT ANALYSIS UNTUK ANALISA POLA TANGKAPAN IKAN DI INDONESIA

Different kinds of fish in Indonesia is very much known to exist more than 80 species of fish caught in the waters of Indonesia. To find out which type of fish caught necessary analysis of the data pattern catches so as to know what kind of fish are caught. Search pattern or associative relationships of large-scale data that are closely related to data mining. Analysis of the association or the association rule mining is a data mining technique to discover the rules of associative between a combination of items. In the association rule method, there are two processes, namely the process of generating Frequent Itemset and trenching association rules. Frequent Itemset Generation is a process to get itemset interconnected and has a value of association based on the value of support and confidence. The algorithm used to generate the frequent itemset is Apriori Algorithm. Apriori algorithm has a weakness in the appropriate feature extraction that is used to attribute causing rule that formed a research a lot in based applying apriori algorithm principal component analysis to obtain a more optimal rule. After experiments using apriori algorithm with a magnitude Φ = 30, min Support 80% and 80% Confidence min rule formed results totaled 82 rules. While the second experiment was done by using an algorithm based on principal component analysis prior the magnitude Φ = 30, min Support 80% and 80% Confidence min formed results amounted to 12 rules to fully lift the ratio of

A review of associative classification mining

Associative classification mining is a promising approach in data mining that utilizes the association rule discovery techniques to construct classification systems, also known as associative classifiers. In the last few years, a number of associative classification algorithms have been proposed, i.e. CPAR, CMAR, MCAR, MMAC and others. These algorithms employ several different rule discovery, rule ranking, rule pruning, rule prediction and rule evaluation methods. This paper focuses on surveying and comparing the state-of-the-art associative classification techniques with regards to the above criteria. Finally, future directions in associative classification, such as incremental learning and mining low-quality data sets, are also highlighted in this paper

Evaluation and optimization of frequent association rule based classification

Deriving useful and interesting rules from a data mining system is an essential and important task. Problems such as the discovery of random and coincidental patterns or patterns with no significant values, and the generation of a large volume of rules from a database commonly occur. Works on sustaining the interestingness of rules generated by data mining algorithms are actively and constantly being examined and developed. In this paper, a systematic way to evaluate the association rules discovered from frequent itemset mining algorithms, combining common data mining and statistical interestingness measures, and outline an appropriated sequence of usage is presented. The experiments are performed using a number of real-world datasets that represent diverse characteristics of data/items, and detailed evaluation of rule sets is provided. Empirical results show that with a proper combination of data mining and statistical analysis, the framework is capable of eliminating a large number of non-significant, redundant and contradictive rules while preserving relatively valuable high accuracy and coverage rules when used in the classification problem. Moreover, the results reveal the important characteristics of mining frequent itemsets, and the impact of confidence measure for the classification task

QCBA: Postoptimization of Quantitative Attributes in Classifiers based on Association Rules

The need to prediscretize numeric attributes before they can be used in association rule learning is a source of inefficiencies in the resulting classifier. This paper describes several new rule tuning steps aiming to recover information lost in the discretization of numeric (quantitative) attributes, and a new rule pruning strategy, which further reduces the size of the classification models. We demonstrate the effectiveness of the proposed methods on postoptimization of models generated by three state-of-the-art association rule classification algorithms: Classification based on Associations (Liu, 1998), Interpretable Decision Sets (Lakkaraju et al, 2016), and Scalable Bayesian Rule Lists (Yang, 2017). Benchmarks on 22 datasets from the UCI repository show that the postoptimized models are consistently smaller -- typically by about 50% -- and have better classification performance on most datasets