Research Article

CFSBFDroid: Android Malware Detection Using CFS + Best First Search-Based Feature Selection

Algorithm 3

Pseudocode of the rule PART.
Input (Rule Part): A training set
(1)    Create a partial decision tree on the present set of instances
(2)    By using a DT, it creates rules for the terminal node (leaf) with the highest Coverage is made as a rule. The fraction of instances that satisfy the condition of a rule is known as the coverage function. And the situation is a combination of attribute tests.(K1 = C1) and (K2 = C2) and … and (Kn = Cn) where C is the prediction class and K represents the attributes, and n is the number of records in the dataset.
(3)    Discard the decision tree
(4)    Eliminate the instances covered by the rule
(5)    Go to step one
Output: Classified Instances