An entropy-based unsupervised anomaly detection pattern learning algorithm

Currently, most anomaly detection pattern learning algorithms require a set of purely normal data from which they train their model. If the data contain some intrusions buried within the training data, the algorithm may not detect these attacks because it will assume that they are normal. In reality, it is very hard to guarantee that there are no attack items in the collected training data. Focusing on this problem, in this paper, firstly a new anomaly detection measurement is proposed according to the probability characteristics of intrusion instances and normal instances. Secondly, on the basis of anomaly detection measure, we present a clustering-based unsupervised anomaly detection patterns learning algorithm, which can overcome the shortage above. Finally, some experiments are conducted to verify the proposed algorithm is valid.

Novel magnetic field computation model in pattern classification

Field computation, an emerging computation technique, has inspired passion of intelligence science research. A novel field computation model based on the magnetic field theory is constructed. The proposed magnetic field computation （MFC） model consists of a field simulator, a non-derivative optimization algo- rithm and an auxiliary data processing unit. The mathematical model is deduced and proved that the MFC model is equivalent to a quadratic discriminant function. Furthermore, the finite element prototype is derived, and the simulator is developed, combining with particle swarm optimizer for the field configuration. Two benchmark classification experiments are studied in the numerical experiment, and one notable advantage is demonstrated that less training samples are required and a better generalization can be achieved.

A hybrid method for extraction of protein-protein interactions from literature

In this work, a hybrid method is proposed to eliminate the limitations of traditional protein-protein interactions （PPIs） extraction methods, such as pattern learning and machine learning. Each sentence from the biomedical literature containing a protein pair describes a PPI which is predicted by first learning syntax patterns typical of PPIs from training corpus and then using their presence as features, along with bag-of-word features in a maximum entropy model. Tested on the BioCreAtIve corpus, the PPIs extraction method, which achieved a precision rate of 64%, recall rate of 60%, improved the performance in terms of F1 value by 11% compared with the component pure pattern- based and bag-of-word methods. The results on this test set were also compared with other three extraction methods and found to improve the performance remarkably.

An Incremental Time-delay Neural Network for Dynamical Recurrent Associative Memory

An incremental time-delay neural network based on synapse growth, which is suitable for dynamic control and learning of autonomous robots, is proposed to improve the learning and retrieving performance of dynamical recurrent associative memory architecture. The model allows steady and continuous establishment of associative memory for spatio-temporal regularities and time series in discrete sequence of inputs. The inserted hidden units can be taken as the long-term memories that expand the capacity of network and sometimes may fade away under certain condition. Preliminary experiment has shown that this incremental network may be a promising approach to endow autonomous robots with the ability of adapting to new data without destroying the learned patterns. The system also benefits from its potential chaos character for emergence.

Movement Primitives as a Robotic Tool to Interpret Trajectories Through Learning-by-doing

Articulated movements are fundamental in many human and robotic tasks.While humans can learn and generalise arbitrarily long sequences of movements,and particularly can optimise them to ft the constraints and features of their body,robots are often programmed to execute point-to-point precise but fxed patterns.This study proposes a new approach to interpreting and reproducing articulated and complex trajectories as a set of known robot-based primitives.Instead of achieving accurate reproductions,the proposed approach aims at interpreting data in an agent-centred fashion,according to an agent s primitive movements.The method improves the accuracy of a reproduction with an incremental process that seeks frst a rough approximation by capturing the most essential features of a demonstrated trajectory.Observing the discrepancy between the demonstrated and reproduced trajectories,the process then proceeds with incremental decompositions and new searches in sub-optimal parts of the trajectory.The aim is to achieve an agent-centred interpretation and progressive learning that fts in the frst place the robots capability,as opposed to a data-centred decomposition analysis.Tests on both geometric and human generated trajectories reveal that the use of own primitives results in remarkable robustness and generalisation properties of the method.In particular,because trajectories are understood and abstracted by means of agent-optimised primitives,the method has two main features： 1） Reproduced trajectories are general and represent an abstraction of the data.2） The algorithm is capable of reconstructing highly noisy or corrupted data without pre-processing thanks to an implicit and emergent noise suppression and feature detection.This study suggests a novel bio-inspired approach to interpreting,learning and reproducing articulated movements and trajectories.Possible applications include drawing,writing,movement generation,object manipulation,and other tasks where the performance requires human-like interpretation and generalisation capabilities.

A multi-level approach to highly efficient recognition of Chinese spam short messages

The problem of spam short message （SMS） recognition involves many aspects of natural language pro- cessing. A good solution to solving the problem can not only improve the quality of people experiencing the mobile life, but also has a positive role on promoting the analysis of short text occurring in current mobile applications, such as We- bchat and microblog. As spam SMSes have characteristics of sparsity, transformation and real-timedness, we propose three methods at different levels, i.e., recognition based on sym- bolic features, recognition based on text similarity, and recog- nition based on pattern matching. By combining these meth- ods, we obtain a multi-level approach to spam SMS recog- nition. In order to enrich the pattern base to reduce manual labor and time, we propose a quasi-pattern learning method, which utilizes quasi-pattern matching results in the pattern matching process. The method can learn many interesting and new patterns from the SMS corpus. Finally, a comprehensive analysis indicates that our spare SMS recognition approach achieves a precision rate as high as 95.18%, and a recall rate of 95.51%.