Offline/realtime traffic classification using semi-supervised learning

Identifying and categorizing network traffic by application type is challenging because of the continued evolution of applications, especially of those with a desire to be undetectable. The diminished effectiveness of port-based identification and the overheads of deep packet inspection approaches motivate us to classify traffic by exploiting distinctive flow characteristics of applications when they communicate on a network. In this paper, we explore this latter approach and propose a semi-supervised classification method that can accommodate both known and unknown applications. To the best of our knowledge, this is the first work to use semi-supervised learning techniques for the traffic classification problem. Our approach allows classifiers to be designed from training data that consists of only a few labeled and many unlabeled flows. We consider pragmatic classification issues such as longevity of classifiers and the need for retraining of classifiers. Our performance evaluation using empirical Internet traffic traces that span a 6-month period shows that: (1) high flow and byte classification accuracy (i.e., greater than 90%) can be achieved using training data that consists of a small number of labeled and a large number of unlabeled flows; (2) presence of “mice” and “elephant” flows in the Internet complicates the design of classifiers, especially of those with high byte accuracy, and necessitates the use of weighted sampling techniques to obtain training flows; and (3) retraining of classifiers is necessary only when there are non-transient changes in the network usage characteristics. As a proof of concept, we implement prototype offline and realtime classification systems to demonstrate the feasibility of our approach.     

互联网流量分类中流量特征研究

互联网流量特征用于描述和测量网络流量,是开展流量分类的重要基础。为了系统性分析互联网流量特征,首先根据统计对象或统计角度研究流量特征的归类法,随后展开评述每类流量特征;针对流量特征的稳定性问题,分析报文抽样、网络环境和模糊化技术对流量特征的影响;从分类能力、稳定性、时效性和分类粒度等方面评述流量特征的优缺点,为流量统计特征应用提供指导性建议;最后总结流量特征的未来研究方向。     

基于人工免疫算法的交通时段自动划分方法

多时段定时控制是城市交通信号控制的重要方式之一,交通时段的合理划分是制定多时段定时控制方案的基础.为克服传统时段划分方法的局限性,实现城市交通时段的自动划分,论文提取生物免疫系统的隐喻机制,基于免疫网络理论和克隆选择原理,建立了一种人工免疫数据聚类分析算法,并详细阐述了聚类算法在城市交通时段自动划分中的具体应用.实例分析表明,该算法可以有效减少聚类数据的冗余信息,特别适合于解决分级聚类等传统方法不适应的大数据量聚类问题,对解决城市交通时段的自动划分等数据聚类问题是可行的和有效的.     

Dynamic route guidance algorithm based algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

Dynamic route guidance algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems, this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the metaphor mechanism of vertebrate immune systems. This algorithm, applied to the urban traffic network model established by the node-expanding method, can expediently realize K-shortest paths search in the urban traffic guidance systems. Because of the immune memory and global parallel search ability from artificial immune systems, K-shortest paths can be found without any repeat, which indicates evidently the superiority of the algorithm to the conventional ones. Not only does it perform a better parallelism, the algorithm also prevents premature phenomenon that often occurs in genetic algorithms. Thus, it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications. A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

Dynamic route guidance algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems, this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the metaphor mechanism of vertebrate immune systems. This algorithm, applied to the urban traffic network model established by the node-expanding method, can expediently realize K-shortest paths search in the urban traffic guidance systems. Because of the immune memory and global parallel search ability from artificial immune systems, K-shortest paths can be found without any repeat, which indicates evidently the superiority of the algorithm to the conventional ones. Not only does it perform a better parallelism, the algorithm also prevents premature phenomenon that often occurs in genetic algorithms. Thus, it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications. A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

人工免疫系统的基本理论及其应用

介绍了生物免疫系统的工作机制与特性及人工免疫算法,且将人工免疫系统与其他智能方法进行比较.还归纳了人工免疫系统的工程应用并对人工免疫系统需深入研究的方向进行了展望.     

RFID reader anti-collision algorithm using adaptive hierarchical artificial immune system

In a radio-frequency identification (RFID) system, if a group of readers transmit and/or receive signals at the same time, they will probably interfere with each other, so that the resulting reader collision problems (e.g., reader-to-reader collision, reader-to-tag collision) will happen. Generally, the reader-to-reader collision can be mitigated by maximizing the tag identification capability, which is related to frequencies and time slots, so it can be transferred as a resource scheduling problem by optimizing the tag identification capability. Artificial immune system is an emerging heuristic evolutionary method which is widely applied to scientific researches and engineering problems. This paper formulates a reader-to-reader anti-collision model from the viewpoint of resource scheduling and proposes an adaptive hierarchical artificial immune system (RA-AHAIS) to solve this optimization problem. A series of simulation experiments are arranged to analyzing the effects of time slots and frequency. Further simulation experiments are made to compare such performance indices as number of identified tags between the proposed RA-AHIAS and the other existing algorithms. The numerical simulation results indicate that this proposed RA-AHAIS is an effective reader-to-reader anti-collision method, and performs better in tag identification capability and computational efficiency than the other methods, such as genetic algorithm (RA-GA), particle swarm optimization (RA-PSO) and artificial immune system for resource allocation (RA-AIS).     

基于动态人工免疫的邮件分类算法研究

使用虚拟基因库技术,对用于邮件分类的人工免疫系统（AISEC）进行改进,提出了动态人工免疫分类算法（DAICA）模型,改进了AISEC的抗体更新过程。当分类正确时,充分利用参与正确分类的抗体,快速改善抗体质量;当分类错误时,不再是简单地将参与错误分类的抗体直接移去,而是对这些移去的抗体进行体细胞高频变异,以保持先前遇到的抗原信息。还研究了新算法DAICA中使用的参数α与β对算法性能的影响。实验表明,这种改进可以提高分类准确率。     

Diagnosis of chest diseases using artificial immune system

Chest diseases are one of the greatest health problems for people living in the developing world. Millions of people are diagnosed every year with a chest disease in the world. Chronic obstructive pulmonary, pneumonia, asthma, tuberculosis, lung cancer diseases are most important chest diseases and these are very common illnesses in Turkey. In this paper, a study on chest diseases diagnosis was realized by using artificial immune system. We obtained the classification accuracy with artificial immune system 93.84%. The result of the study was compared with the results of the previous similar studies reported focusing on chest diseases diagnosis. The chest diseases dataset were prepared from a chest diseases hospital’s database using patient’s epicrisis reports.     

Multi-class pattern classification using neural networks

Multi-class pattern classification has many applications including text document classification, speech recognition, object recognition, etc. Multi-class pattern classification using neural networks is not a trivial extension from two-class neural networks. This paper presents a comprehensive and competitive study in multi-class neural learning with focuses on issues including neural network architecture, encoding schemes, training methodology and training time complexity. Our study includes multi-class pattern classification using either a system of multiple neural networks or a single neural network, and modeling pattern classes using one-against-all, one-against-one, one-against-higher-order, and P-against-Q. We also discuss implementations of these approaches and analyze training time complexity associated with each approach. We evaluate six different neural network system architectures for multi-class pattern classification along the dimensions of imbalanced data, large number of pattern classes, large vs. small training data through experiments conducted on well-known benchmark data.     

Symbiotic artificial immune system

Artificial Immune System algorithms use antibodies that fully specify the solution of an optimization, learning, or pattern recognition problem. By being restricted to fully specified antibodies, an AIS algorithm cannot make use of schemata or classes of partial solutions, while sub solutions can help a lot in faster emergence of a totally good solution in many problems. To exploit schemata in artificial immune systems, this paper presents a novel algorithm that combines traditional artificial immune systems and symbiotic combination operator. The algorithm starts searching with partially specified antibodies and gradually builds more and more specified solutions till it finds complete answers. The algorithm is compared with CLONALG algorithm on several multimodal function optimization and combinatorial optimization problems and it is shown that it is faster than CLONALG on most problems and can find solutions in problems that CLONALG totally fails.     

基于免疫算法的午饭时期层际高峰交通电梯群控制的动态优化

层际高峰交通是上行高峰、下行高峰与层间交通客流的融合,午饭交通就是发生在现代办公楼内的层际高峰交通之一,基于午饭时期层际高峰交通的特点,本文提出了一种利用人工免疫算法实现电梯群控制动态优化的策略．该策略采用两级优化控制,利用常规的THV算法对层站召唤分配实施局部优化,采用人工免疫算法定时对层站召唤分配实施全局优化．同单纯的THV算法相比,本文提出的组合算法将平均的系统等待时间降低了21．26%,仿真结果表明,本文提出的优化控制策略能够改善午饭时期电梯系统的服务性能,具有较好的现实意义和研究价值。     

An artificial immune network approach to multi-sensor land use/land cover classification

An optimized artificial immune network-based classification model, namely OPTINC, was developed for remote sensing-based land use/land cover (LULC) classification. Major improvements of OPTINC compared to a typical immune network-based classification model (aiNet) include (1) preservation of the best antibodies of each land cover class from the antibody population suppression, which ensures that each land cover class is represented by at least one antibody; (2) mutation rates being self-adaptive according to the model performance between training generations, which improves the model convergence; and (3) incorporation of both Euclidean distance and spectral angle mapping distance to measure affinity between two feature vectors using a genetic algorithm-based optimization, which helps the model to better discriminate LULC classes with similar characteristics. OPTINC was evaluated using two sites with different remote sensing data: a residential area in Denver, CO with high-spatial resolution QuickBird image and LiDAR data, and a suburban area in Monticello, UT with HyMap hyperspectral imagery. A decision tree, a multilayer feed-forward back-propagation neural network, and aiNet were also tested for comparison. Classification accuracy, local homogeneity of classified images, and model sensitivity to training sample size were examined. OPTINC outperformed the other models with higher accuracy and more spatially cohesive land cover classes with limited salt-and-pepper noise. OPTINC was relatively less sensitive to training sample size than the neural network, followed by the decision tree.     

Automatic knot adjustment using an artificial immune system for B-spline curve approximation

Reverse engineering transforms real parts into engineering concepts or models. First, sampled points are mapped from the object’s surface by using tools such as laser scanners or cameras. Then, the sampled points are fitted to a free-form surface or a standard shape by using one of the geometric modeling techniques. The curves on the surface have to be modeled before surface modeling. In order to obtain a good B-spline curve model from large data, the knots are usually respected as variables. A curve is then modeled as a continuous, nonlinear and multivariate optimization problem with many local optima. For this reason it is very difficult to reach a global optimum. In this paper, we convert the original problem into a discrete combinatorial optimization problem like in Yoshimoto et al. [F. Yoshimoto, M. Moriyama, T. Harada, Automatic knot placement by a genetic algorithm for data fitting with a spline, in: Proceedings of the International Conference on Shape Modeling and Applications, IEEE Computer Society Press, 1999, pp. 162-169] and Sarfraz et al. [M. Sarfraz, S.A. Raza, Capturing outline of fonts using genetic algorithm and splines, in: Fifth International Conference on Information Visualisation (IV’01), 2001, pp. 738-743]. Then, we suggest a new method that solves the converted problem by artificial immune systems. We think the candidates of the locations of knots as antibodies. We define the affinity measure benefit from Akaike’s Information Criterion (AIC). The proposed method determines the appropriate location of knots automatically and simultaneously. Furthermore, we do not need any subjective parameter or good population of initial location of knots for a good iterative search. Some examples are also given to demonstrate the efficiency and effectiveness of our method.     

An artificial immune system approach to CNC tool path generation

Reduced machining time and increased accuracy for a sculptured surface are both very important when producing complicated parts, so, the step-size and tool-path interval are essential components in high-speed and high-resolution machining. If they are too small, the machining time will increase, whereas if they are too large, rough surfaces will result. In particular, the machining time, which is a key factor in high-speed machining, is affected by the tool-path interval more than the step size. The present paper introduces a ‘system software’ developed to reduce machining time and increased accuracy for a sculptured surface with Non-Uniform Rational B-Spline (NURBS) patches. The system is mainly based on a new and a powerful artificial intelligence (AI) tool, called artificial immune systems (AIS). It is implemented using C programming language on a PC. It can be used as stand alone system or as the integrated module of a CNC machine tool. With the use of AIS, the impact and power of AI techniques have been reflected on the performance of the tool path optimization system. The methodology of the developed tool path optimization system is illustrated with practical examples in this paper.     

A hybrid method based on artificial immune system and fuzzy k-NN algorithm for diagnosis of heart valve diseases

The use of artificial intelligence methods in medical analysis is increasing. This is mainly because the effectiveness of classification and detection systems has improved in a great deal to help medical experts in diagnosing. In this paper, we investigate the performance of an artificial immune system (AIS) based fuzzy k-NN algorithm to determine the heart valve disorders from the Doppler heart sounds. The proposed methodology is composed of three stages. The first stage is the pre-processing stage. The feature extraction is the second stage. During feature extraction stage, Wavelet transforms and short time Fourier transform were used. As next step, wavelet entropy was applied to these features. In the classification stage, AIS based fuzzy k-NN algorithm is used. To compute the correct classification rate of proposed methodology, a comparative study is realized by using a data set containing 215 samples. The validation of the proposed method is measured by using the sensitivity and specificity parameters. 95.9% sensitivity and 96% specificity rate was obtained.     

An artificial immune system based algorithm to solve unequal area facility layout problem

This study introduces an artificial immune system (AIS) based algorithm to solve the unequal area facility layout problem (FLP) with flexible bay structure (FBS). The proposed clonal selection algorithm (CSA) has a new encoding and a novel procedure to cope with dummy departments that are introduced to fill the empty space in the facility area. The algorithm showed consistent performance for the 25 test problem cases studied. The problems with 100 and 125 were studied with FBS first time in the literature. CSA provided four new best FBS solutions and reached to sixteen best-so-far FBS solutions. Further, the two very large size test problems were solved first time using FBS representation, and results significantly improved the previous best known solutions. The overall results state that CSA with FBS representation was successful in 95.65% of the test problems when compared with the best-so-far FBS results and 90.90% compared with the best known solutions that have not used FBS representation.     

WBMOAIS: A novel artificial immune system for multiobjective optimization

This study presents a novel weight-based multiobjective artificial immune system (WBMOAIS) based on opt-aiNET, the artificial immune system algorithm for multi-modal optimization. The proposed algorithm follows the elementary structure of opt-aiNET, but has the following distinct characteristics: (1) a randomly weighted sum of multiple objectives is used as a fitness function. The fitness assignment has a much lower computational complexity than that based on Pareto ranking, (2) the individuals of the population are chosen from the memory, which is a set of elite solutions, and a local search procedure is utilized to facilitate the exploitation of the search space, and (3) in addition to the clonal suppression algorithm similar to that used in opt-aiNET, a new truncation algorithm with similar individuals (TASI) is presented in order to eliminate similar individuals in memory and obtain a well-distributed spread of non-dominated solutions. The proposed algorithm, WBMOAIS, is compared with the vector immune algorithm (VIS) and the elitist non-dominated sorting genetic system (NSGA-II) that are representative of the state-of-the-art in multiobjective optimization metaheuristics. Simulation results on seven standard problems (ZDT6, SCH2, DEB, KUR, POL, FON, and VNT) show WBMOAIS outperforms VIS and NSGA-II and can become a valid alternative to standard algorithms for solving multiobjective optimization problems.     

一种基于SVM的P2P网络流量分类方法

提出一种基于SVM的P2P网络流量分类的方法。这种方法利用网络流量的统计特征和基于统计理论的SVM方法,对不同应用类型的P2P网络流量进行分类研究。主要对文件共享中的BitTorrent,流媒体中的PPLive,网络电话中的Skype,即时通讯中的MSN 4种P2P网络流量进行分类研究。介绍了基于SVM的P2P流量分类的整体框架,描述了流量样本的获取及处理方法,并对分类器的构建及实验结果进行了介绍。实验结果验证了提出方法的有效性,平均分类精确率为92.38%。