Nowadays, computers, as well as smart devices, are connected through communication networks making them more vulnerable to attacks. Honeypots are proposed as deception tools but usually used as part of a proactive defense strategy. Hence, this article demonstrates how honeypots data can be analyzedin an active defense strategy. Furthermore, anomaly detection based on unsupervised machine learning techniques

The rapid growth of malicious software (malware) production in recent decades and the increasing number of threats posed by malware to network environments, such as the Internet and intelligent environments, emphasize the need for more research on the security of computer networks in information security and digital forensics. The method presented in this study identifies “species” of malware families

Fuzzy C-Means (FCM) is the most commonly used and discussed fuzzy clustering algorithm in the literature. Nevertheless, it is well known that the performance of FCM is strongly affected by the selection of the initial cluster centers. In other words, the selection of a good set of initial cluster centers plays an important role in the performance of this algorithm. The most common selection method

A major challenge in stream clustering is the evolution in the statistical properties of the underlying data. As clustering is inherently unsupervised, selecting suitable parameter values is often difficult. Clustering algorithms with sensitive parameters are often not robust to such changes, leading to poor clustering outputs. Algorithms using K-NN graphs face this problem, as they have a sensitive

Privacy-preserving utility itemset mining is the process of hiding sensitive-high utility itemsets (SHUIs) appearing in original database such that they will not be discovered in the sanitized database. The purpose of SHUI hiding algorithm is to conceal the set of SHUIs while minimizing the side effects which caused by data distortion process. In this paper, a novel algorithm, named EHSHUI (An Efficient

Social Networks is an essential phenomenon in all aspects through various perspectives. These networks contain a large number of users better termed as nodes and the connections between the users termed as edges. For efficient information processing and retrieving, accessing the influential node isessential for improving the diffusion process. To identify the influential node inside a heterogeneous

Identifying features to represent graphs such as social networks, protein graphs is increasingly common in both research and business communities, thanks to the fact that data has increased not only in quantity but also in complexity. This results in the graphs to be sparser because not all nodes are fully connected. In addition, if this whole graph is used as input data for learning algorithms e.g

The theories about crime and correction have their inception in the eighteenth century, highly influenced by the anthropological thoughts emerging during the age of Enlightenment. Throughout the decades, the criminological studies observed their sociological essence encompassing practices from other scientific fields to explain the more contemporary questions, becoming Criminology an inherently interdisciplinary

The problem of efficiently classifying imbalanced data has become one of the most challenging tasks in machine learning. Some real world examples include medical image analysis, fraud detection, fault diagnosis, and anomaly detection. Although several data-level algorithms have been developed to address imbalance, they are typically subject to some restrictions. We propose a novel variant of the k-NN

Within the graph mining context, frequent subgraph identification plays a key role in retrieving required information or patterns from the huge amount of data in a short period. The problem of finding frequent items in traditional mining changed to the innovation of subgraphs that recurrently occurs in graph datasets containing a single huge graph. Majority of the existing methods target static graphs

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen as a cube such that each cell contains one or more measures that can be aggregated along dimensions. In a “Big Data” scenario, traditional data warehousing and OLAP operations are clearly not sufficient to address current

Graph-based algorithms have aroused considerable interests in recent years by facilitating pattern recognition and learning via information propagation process through the graph. Here, we propose an unsupervised learning algorithm based on propagation on bipartite graph, referred to as Propagationin Bipartite Graph (PBG) algorithm. The contributions of this approach are threefold: 1) we present an

Nowadays more and more information extraction projects need to classify large amounts of text data. The common way to classify text is to build a supervised classifier trained on human-labeled positive and negative examples. In many cases, however, it is easy to label positive examples, but hard tolabel negative examples. In this paper, we address the problem of building a one-class classifier when

Bat algorithm (BA) has the advantage of fast convergence, but there is still room for improvement in accuracy and stability of solution. An efficient and robust fusion bat algorithm (ERFBA) is proposed to overcome these defects. In the population reconstruction, an effective diversity population (EDP) is reconstructed by designing a multi-strategy opposition-based learning with disturbance. In the

Active learning is a typical approach for learning from both labeled and unlabeled examples aiming to build efficient and accurate predictive models at minimum expense under an expert’s guidance. Since there is a lack of labeled data in many scientific fields whilst, at the same time, the labelingcost of unlabeled data is typically high in terms of time and expenditure, active learning has grown rapidly

In the area of time series data mining, a challenging task is to design an effectively and efficiently low-dimensional representation of high-dimensional time series data. Such an effective and efficient representation is important for dimensionality reduction of time series while preserving the core information embedded in the original one. Among popular representations of time series, Symbolic Aggregate

Formal concept analysis (FCA) become an alternative approach to extract and represent knowledge of real world systems. That knowledge can be obtained from implications rules extracted of concept lattices formed by ordered formal concepts. However, in complex systems the number of formal concepts can be large. To deal with this complexity of the FCA, concept reduction techniques can be applied in order

In this paper, we present a method for exploratory data analysis of streaming data based on probabilistic graphical models (latent variable models). This method is illustrated by concept drift tracking, using financial client data from a European regional bank. For this particular setting, the analyzed data spans the period from April 2007 to March 2014 and therefore starts before the beginning of

Sentiment analysis of text data, such as reviews, can help users and merchants make more favorable decisions. It is difficult to use the popular supervised learning method to complete the sentiment classification task because marking data manually is time-consuming and laborious. Unsupervised sentiment classification methods are mostly based on sentiment lexicons. The existing sentiment lexicons are

Sentiment analysis in various languages has been a hot research topic with several applications. Most of the existing models have been reported to work well with widely used language. Were the lass directly applying these models to poor-quality corpora often leads to low results. Thus, to deal withthese shortcoming we propose a cross-lingual sentiment topic model evolution over time (CLSTOT) which

Because of high dimensionality, correlation among covariates, and noise contained in data, dimension reduction (DR) techniques are often employed to the application of machine learning algorithms. Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), and their kernel variants (KPCA, KLDA) are among the most popular DR methods. Recently, Supervised Kernel Principal Component Analysis

We propose a hybrid application of Population Based Ant Colony Optimization that uses a data mining procedure to wisely initialize the pheromone entries. Hybridization of metaheuristics with data mining techniques has been studied by several researchers in recent years. In this line of research, frequent patterns in a number of initial high-quality solutions are extracted to guide the subsequent iterations

Nowadays, the existence of continuous optimization problems has led researchers to come up with a variety of methods to solve continues optimization problems. The metaheuristic algorithms are one of the most popular and common ways to solve continuous optimization problems. Firefly Algorithm (FA) is a successful metaheuristic algorithm for solving continuous optimization problems; however, although

By providing a complete record of time use for a given population, time use studies enable investigators to test various hypotheses concerning that behavior. However, the large number and variety of activity combinations that are relevant in time allocation choices and, therefore, time use analysis, makes measuring or even fully identifying all of them impossible without the proper data mining tools

Intrusion detection plays a very important role in the field of network security. In order to improve the intrusion detection rate, intrusion detection algorithms based traditional machine learning are widely used in this field. These methods generally satisfy the following two assumptions: the training and the testing data must be under the condition of the independent and identical distribution;

Bayesian network classifiers (BNCs) are powerful tools to mine statistical knowledge from data and infer under conditions of uncertainty. However, most of the traditional BNCs focus on mining the dependency relationships existed in labeled data while neglecting the information hidden in unlabeled data, which may result in the biased decision boundaries. To address this issue, we introduce a new order-based

Domain adaptation is an important branch of transfer learning. Previous studies have always taken efforts to minimize the optimization goal, but they neglect the relative quality of features or instances. For example, a classic work treats different instances equally in a degree and chooses these instances which minimize the optimization function value. This method will discard these instances that