Probabilistic K-nearest neighbor classifier for detection of malware in android mobile

  • Kang S
  • Yoon J
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this modern society, people are having a close relationship with smartphone. This makes easier for hackers to gain the user's information by installing the malware in the user's smartphone without the user's authority. This kind of action are threats to the user's privacy. The malware characteristics are different to the general applications. It requires the user's authority. In this paper, we proposed a new classification method of user requirements method by each application using the Principle Component Analysis(PCA) and Probabilistic K-Nearest Neighbor(PKNN) methods. The combination of those method outputs the improved result to classify between malware and general applications. By using the K-fold Cross Validation, the measurement precision of PKNN is improved compare to the previous K-Nearest Neighbor(KNN). The classification which difficult to solve by KNN also can be solve by PKNN with optimizing the discovering the parameter k and . Also the sample that has being use in this experiment is based on the Contagio.

Cite

CITATION STYLE

APA

Kang, S., & Yoon, J. W. (2015). Probabilistic K-nearest neighbor classifier for detection of malware in android mobile. Journal of the Korea Institute of Information Security and Cryptology, 25(4), 817–827. https://doi.org/10.13089/jkiisc.2015.25.4.817

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free