A Two-Stage Methodology using K-Nn and False-Positive Minimizing Elm for Nominal Data Classification

Abstract

This Paper Focuses on the Problem of Making Decisions in the Context of Nominal Data under Specific Constraints. the Underlying Goal Driving the Methodology Proposed Here is to Build a Decision-Making Model Capable of Classifying as Many Samples as Possible While Avoiding False Positives at All Costs, All within the Smallest Possible Computational Time. under Such Constraints, One of the Best Type of Model is the Cognitive-Inspired Extreme Learning Machine (Elm), for the Final Decision Process. a Two-Stage Decision Methodology using Two Types of Classifiers, a Distance-Based One, K-Nn, and the Cognitive-Based One, Elm, Provides a Fast Means of Obtaining a Classification Decision on a Sample, Keeping False Positives as Low as Possible While Classifying as Many Samples as Possible (High Coverage). the Methodology Only Has Two Parameters, Which, Respectively, Set the Precision of the Distance Approximation and the Final Trade-Off between False-Positive Rate and Coverage. Experimental Results using a Specific Dataset Provided by F-Secure Corporation Show that This Methodology Provides a Rapid Decision on New Samples, with a Direct Control over the False Positives and Thus on the Decision Capabilities of the Model. © 2014 Springer Science+business Media New York.

Department(s)

Engineering Management and Systems Engineering

Keywords and Phrases

ELM; False positives; K-NN; Malware detection

International Standard Serial Number (ISSN)

1866-9964; 1866-9956

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Springer, All rights reserved.

Publication Date

01 Jan 2014

Link to Full Text

Share

 
COinS