scholarly journals Detection of Malicious Executables Using Rule Based Classification Algorithms

Author(s):  
Neeraj Bhargava ◽  
Aakanksha Jain ◽  
Abhishek Kumar ◽  
Dac-Nhuong Le
2019 ◽  
Vol 5 ◽  
pp. e188 ◽  
Author(s):  
Hesam Hasanpour ◽  
Ramak Ghavamizadeh Meibodi ◽  
Keivan Navi

Classification and associative rule mining are two substantial areas in data mining. Some scientists attempt to integrate these two field called rule-based classifiers. Rule-based classifiers can play a very important role in applications such as fraud detection, medical diagnosis, etc. Numerous previous studies have shown that this type of classifier achieves a higher classification accuracy than traditional classification algorithms. However, they still suffer from a fundamental limitation. Many rule-based classifiers used various greedy techniques to prune the redundant rules that lead to missing some important rules. Another challenge that must be considered is related to the enormous set of mined rules that result in high processing overhead. The result of these approaches is that the final selected rules may not be the global best rules. These algorithms are not successful at exploiting search space effectively in order to select the best subset of candidate rules. We merged the Apriori algorithm, Harmony Search, and classification-based association rules (CBA) algorithm in order to build a rule-based classifier. We applied a modified version of the Apriori algorithm with multiple minimum support for extracting useful rules for each class in the dataset. Instead of using a large number of candidate rules, binary Harmony Search was utilized for selecting the best subset of rules that appropriate for building a classification model. We applied the proposed method on a seventeen benchmark dataset and compared its result with traditional association rule classification algorithms. The statistical results show that our proposed method outperformed other rule-based approaches.


2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

Associative Classification (AC) or Class Association Rule (CAR) mining is a very efficient method for the classification problem. It can build comprehensible classification models in the form of a list of simple IF-THEN classification rules from the available data. In this paper, we present a new, and improved discrete version of the Crow Search Algorithm (CSA) called NDCSA-CAR to mine the Class Association Rules. The goal of this article is to improve the data classification accuracy and the simplicity of classifiers. The authors applied the proposed NDCSA-CAR algorithm on eleven benchmark dataset and compared its result with traditional algorithms and recent well known rule-based classification algorithms. The experimental results show that the proposed algorithm outperformed other rule-based approaches in all evaluated criteria.


2018 ◽  
Vol 6 (2) ◽  
pp. 200-216 ◽  
Author(s):  
Berlian Juliartha Martin Putra ◽  
Afrida Helen ◽  
Ali Ridho Barakbah

Diskominfo Surabaya, as a government agency, received much community participatory for improvement of governmental services, with increasing number of 698, 2717, 4176 and 4298 participatory data respectively in 2011, 2012, 2013 and 2014. It is challenging for Diskominfo Surabaya to set a target by giving the response back within 24 hours. Due to task complexity to address the degree of participatory and to categorize the group of participatory, they faced difficulty to fulfill the target. In this research, we present a new system for measuring the sentiment degree of community participatory. We provide 5 functions in our system, which are: (1) Data Collection, (2) Data Preprocessing, (3) Text Mining, (4) Sentiment Analysis and (5) Validation. We propose our rule-based technique for the sentiment analysis of opinion mining with detection of 8 important parts, which are (1) Verb, (2) Adjective, (3) Preposition, (4) Noun, (5) Adverb, (6) Symbol, (7) Phrase, and (8) Complimentary. For applicability of our proposed system, we made a series of experiment with 410 data of community participatory in Twitter for Diskominfo Surabaya and compared with other sentiment classification algorithms which are SVM and Naive Bayes Classifier. Our system performed 77.32% rate of accuracy and outperformed to other comparing algorithms.


2020 ◽  
Vol 18 (2) ◽  
pp. 19-33 ◽  
Author(s):  
Clauirton Albuquerque Siebra ◽  
Ramon N. Santos ◽  
Natasha C.Q. Lino

This work proposes a dropout prediction approach that is able to self-adjust their outcomes at any moment of a degree program timeline. To that end, a rule-based classification technique was used to identify courses, grade thresholds and other attributes that have a high influence on the dropout behavior. This approach, which is generic so that it can be applied to any distance learning degree program, returns different rules that indicate how the predictions are adjusted along with academic terms. Experiments were carried out using four rule-based classification algorithms: JRip, OneR, PART and Ridor. The outcomes show that this approach presents better accuracy according to the progress of students, mainly when the JRip and PART algorithms are used. Furthermore, the use of this method enabled the generation of rules that stress the factors that mainly affect the dropout phenomenon at different degree moments.


2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

Associative Classification (AC) or Class Association Rule (CAR) mining is a very efficient method for the classification problem. It can build comprehensible classification models in the form of a list of simple IF-THEN classification rules from the available data. In this paper, we present a new, and improved discrete version of the Crow Search Algorithm (CSA) called NDCSA-CAR to mine the Class Association Rules. The goal of this article is to improve the data classification accuracy and the simplicity of classifiers. The authors applied the proposed NDCSA-CAR algorithm on eleven benchmark dataset and compared its result with traditional algorithms and recent well known rule-based classification algorithms. The experimental results show that the proposed algorithm outperformed other rule-based approaches in all evaluated criteria.


2012 ◽  
Vol 11 (01) ◽  
pp. 1250006 ◽  
Author(s):  
Fadi Thabtah ◽  
Omar Gharaibeh ◽  
Rashid Al-Zubaidy

A well-known classification problem in the domain of text mining is text classification, which concerns about mapping textual documents into one or more predefined category based on its content. Text classification arena recently attracted many researchers because of the massive amounts of online documents and text archives which hold essential information for a decision-making process. In this field, most of such researches focus on classifying English documents while there are limited studies conducted on other languages like Arabic. In this respect, the paper proposes to investigate the problem of Arabic text classification comprehensively. More specifically the study measures the performance of different rule based classification approaches adopted from machine learning and data mining towards the problem of text Arabic classification. In particular, four different rule based classification approaches: Decision trees (C4.5), Rule Induction (RIPPER), Hybrid (PART) and Simple Rule (One Rule) are evaluated against the published Corpus of Contemporary Arabic Arabic text collection. This experimentation is carried out by employing a modified version of WEKA business intelligence tool. Through analysing the produced results from the experimentation, we determine the most suitable classification algorithms for classifying Arabic texts.


Author(s):  
Tengyue Li ◽  
Simon Fong

To compare with two datasets based on attributes by using classification algorithms, for the attributes, the authors need to select them by rules and the system is known as rule-based reasoning system which classifies a given test instance into a particular outcome from the learned rules. The test instance carries multiple attributes, which are usually the values of diagnostic tests. In this article, the authors propose a classifier ensemble-based method for comparison of two breast cancer datasets. The ensemble data mining learning methods are applied to rule generation, and a multi-criterion evaluation approach is used for selecting reliable rules over the results of the ensemble methods. The efficacy of the proposed methodology is illustrated via an example of two breast cancer datasets. This article introduces a novel fuzzy rule-based classification method called FURIA, to obtain a relationship between two breast cancer datasets. Hence, it can find the similarity between these two datasets. The new method is compared vis-à-vis with other classical statistical approaches such as correlation and mutual information gain.


Sign in / Sign up

Export Citation Format

Share Document