Search

Malware detection is an important task for the ecosystem of mobile applications (APPs), especially for the Android ecosystem, and is vital to guarantee the user experience of Android APPs. There have been some exiting methods trying to solve the problem of malware detection, but the methods suffer from several defects, such as high time complexity and mediocre accuracy, which seriously decrease the practicability of existing methods. To solve these problems, in this study, we propose a novel Android malware detection framework, where we contribute an efficient Application Programming Interface (API) call sequences extraction algorithm and an investigation of different types of classifiers. In API call sequences extraction, we propose an algorithm for transforming the function call graph from a multigraph into a directed simple graph, which successfully avoids the unnecessary repetitive path searching. We also propose a pruning search, which further reduces the number of paths to be searched. Our algorithm greatly reduces the time complexity. We generate the transition matrix as classification features and investigate three types of machine learning classifiers to complete the malware detection task. The experiments are performed on real‐world Android Packages (APKs), and the results demonstrate that our method significantly reduces the running time and produces high detection accuracy. [ABSTRACT FROM AUTHOR]

Sentiment classification is a key task in sentiment analysis, reviews mining, and other text mining applications. Various models have been proposed to build sentiment classifiers, but the classification performances of some existing methods are not good enough. Meanwhile, as a subproblem of sentiment classification, positive and unlabeled learning (PU learning) problem widely exists in real‐world cases, but it has not been given enough attention. In this article, we aim to solve the two problems in one framework. We first build a model for traditional sentiment classification based on adversarial learning, attention mechanism, and long short‐term memory (LSTM) network. We further propose an enhanced adversarial learning method to tackle PU learning problem. We conducted extensive experiments in three real‐world datasets. The experimental results demonstrate that our models outperform the compared methods in both traditional sentiment classification problem and PU learning problem. Furthermore, we study the effect of our models on word embedding. Finally, we report and discuss the sensitivity of our models to parameters. [ABSTRACT FROM AUTHOR]

The multiturn dialogue system has been prevalently used in e‐commerce websites and modern information systems, which significantly improves the efficiency of problem solving and further promotes the service quality. In a multiturn dialogue system, the problem of intention classification is a core task, as the intention of a customer is the basis of subsequent problems handling. However, traditional related methods are unsuitable for the classification of multiturn dialogues. Because traditional methods do not distinguish the importance of each sentence and concatenate all sentences in the text, which is likely to generate a model with low prediction accuracy. In this paper, we propose a method of multiturn dialogue classification based on key sentences mining. We design a keywords extraction algorithm, mining key sentences from the dialogue text. We propose an algorithm finishing the computation of the weights of each sentence. According to the sentence weight and the sentence vector, the dialogue text is transformed to a dialogue vector. The dialogue text is classified by a classifier, and the input is the dialogue vector. We conducted sufficient experiments on a real‐world dataset, evaluating the performance of the proposed method. The experimental results show that our method outperforms the related methods on a series of evaluation metrics. [ABSTRACT FROM AUTHOR]