Tag Archives: Pattern Recognition

The Importance of Machine Learning Techniques in Malware Detection: A Survey (Published)

In the current age, keeping pace with the evolution of malware is becoming immensely challenging each day. In order to keep up with the unconventional trend in the development of malware, it is imperative to develop intelligent malware detection methods that accurately identify malicious files from real world data samples. The sheer complexity and volume of malware attacks on a day-to-day basis has given rise to the need of utilising machine learning techniques for dynamic analysis of files and data. In this paper, types of malware are described to understand the scope of the problem and the traditional techniques that are used for malware detection. Dynamic and behaviour-based detection methods coupled with machine learning techniques are considered to be at the core of future research and progress. Unfortunately, there are still a plethora of problems and challenges to overcome like polymorphic malware, black-box models of machine learning algorithms, reverse engineering, theoretical and practical research gaps that limit our progress and success. It is crucial to find solutions as malware experts are also exploring and exploiting the concepts of machine learning for advanced malware development and better elusive techniques. Additionally, it is required to bridge the gap between malware and machine learning experts. Their combined expertise can secure better results. In conclusion, future research direction in the field of malware detection is presented.

Keywords: Behaviour-based Detection, Dynamic Malware Analysis, Pattern Recognition, Signature-based detection, Static Malware Analysis., machine learning

An Association Rule General Analytic System (ARGAS) for hypothesis testing in qualitative and quantitative research (Published)

This paper describes an Association Rule General Analytic System (ARGAS) as an alternative to the General Linear Model (GLM) for hypothesis testing.  We illustrate how the ARGAS can be used to analyze both qualitative and quantitative research data. The advantages of the ARGAS approach derives from the fact that it is designed to analyze words or numbers that are converted into words.  Unlike the GLM, it does not have any distributional assumptions.  Association rule calculations are well-developed and there are a variety of computer software applications available that expedite the computations. The purpose of this study is to illustrate how the ARGAS can be applied and how to interpret the results.

Keywords: ARGAS, GLM, Pattern Recognition, association rule analysis, hypothesis testing, qualitative, quantitative

An Association Rule General Analytic System (ARGAS) for hypothesis testing in qualitative and quantitative research (Published)

This paper describes an Association Rule General Analytic System (ARGAS) as an alternative to the General Linear Model (GLM) for hypothesis testing.  We illustrate how the ARGAS can be used to analyze both qualitative and quantitative research data. The advantages of the ARGAS approach derives from the fact that it is designed to analyze words or numbers that are converted into words.  Unlike the GLM, it does not have any distributional assumptions.  Association rule calculations are well-developed and there are a variety of computer software applications available that expedite the computations. The purpose of this study is to illustrate how the ARGAS can be applied and how to interpret the results.

Keywords: ARGAS, GLM, Pattern Recognition, association rule analysis, hypothesis testing, qualitative, quantitative

ADAPTIVE TECHNIQUES APPLIED TO DOMINANT POINT DETECTION (Published)

Utilizing Adaptive Finite Automaton (AFA) to implement Adaptive Digitized Straight Line Segments (ADSLS) actuating as exploration automaton of a boundary, we propose an alternative for the available researches on dominant point detection in which primitives are composed by ADSLS. Consequently, this method is shown by simulations to be effective to represent adaptive regions of support and adequate for the complexities of real world scenarios like a shape classifier. Furthermore, even being based in the simple underlying mechanism of Finite Automaton (FA), ADSLS is able to adapt, reacting to circumstance stimuli in a single pass, also presenting learning capability.

Keywords: Adaptive Systems, Automata, Computational Geometry, Error Correction, Pattern Recognition