Instance-Specific Algorithm Selection via Multi-Output Learning

Instance-specific algorithm selection technologies have been successfully used in many research fields,such as constraint satisfaction and planning. Researchers have been increasingly trying to model the potential relations between different candidate algorithms for the algorithm selection. In this study, we propose an instancespecific algorithm selection method based on multi-output learning, which can manage these relations more directly.Three kinds of multi-output learning methods are used to predict the performances of the candidate algorithms：（1）multi-output regressor stacking;（2） multi-output extremely randomized trees; and（3） hybrid single-output and multioutput trees. The experimental results obtained using 11 SAT datasets and 5 Max SAT datasets indicate that our proposed methods can obtain a better performance over the state-of-the-art algorithm selection methods.

Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.

Fault Detection Using Negative Selection and Genetic Algorithms

In this paper,negative selection and genetic algorithms are combined and an improved bi-objective optimization scheme is presented to achieve optimized negative selection algorithm detectors.The main aim of the optimal detector generation technique is maximal nonself space coverage with reduced number of diversified detectors.Conventionally,researchers opted clonal selection based optimization methods to achieve the maximal nonself coverage milestone;however,detectors cloning process results in generation of redundant similar detectors and inefficient detector distribution in nonself space.In approach proposed in the present paper,the maximal nonself space coverage is associated with bi-objective optimization criteria including minimization of the detector overlap and maximization of the diversity factor of the detectors.In the proposed methodology,a novel diversity factorbased approach is presented to obtain diversified detector distribution in the nonself space.The concept of diversified detector distribution is studied for detector coverage with 2-dimensional pentagram and spiral self-patterns.Furthermore,the feasibility of the developed fault detection methodology is tested the fault detection of induction motor inner race and outer race bearings.

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

A Cuckoo Search Detector Generation-based Negative Selection Algorithm

The negative selection algorithm(NSA)is an adaptive technique inspired by how the biological immune system discriminates the self from nonself.It asserts itself as one of the most important algorithms of the artificial immune system.A key element of the NSA is its great dependency on the random detectors in monitoring for any abnormalities.However,these detectors have limited performance.Redundant detectors are generated,leading to difficulties for detectors to effectively occupy the non-self space.To alleviate this problem,we propose the nature-inspired metaheuristic cuckoo search(CS),a stochastic global search algorithm,which improves the random generation of detectors in the NSA.Inbuilt characteristics such as mutation,crossover,and selection operators make the CS attain global convergence.With the use of Lévy flight and a distance measure,efficient detectors are produced.Experimental results show that integrating CS into the negative selection algorithm elevated the detection performance of the NSA,with an average increase of 3.52%detection rate on the tested datasets.The proposed method shows superiority over other models,and detection rates of 98%and 99.29%on Fisher’s IRIS and Breast Cancer datasets,respectively.Thus,the generation of highest detection rates and lowest false alarm rates can be achieved.

An Improved Immune Clone Selection Algorithm for Parameters Optimization of Marine Electric Power System Stabilizer

In themarine electric power system,the marine generators will be disturbed by the large change of loads or the fault of the power system.The marine generators usually installed power system stabilizers to damp power system oscillations through the excitation control.This paper proposes a novel method to obtain optimal parameter values for Power System Stabilizer(PSS)to suppress low-frequency oscillations in the marine electric power system.In this paper,a newly developed immune clone selection algorithm was improved from the three aspects of the adaptive incentive degree,vaccination,and adaptive mutation strategies.Firstly,the typical PSS implementation type of leader-lag structure was adopted and the objective function was set in the optimization process.The performance of PSS tuned by improved immune clone selection algorithm was compared with PSS tuned by basic immune clone selection algorithm(ICSA)under various operating conditions and disturbances.Then,an improved immune clone selection algorithm(IICSA)optimization technique was implemented on two test systems for test purposes.Based on the simulations,it is found that an improved immune clone selection algorithm demonstrates superiority over the basic immune clone selection algorithm in getting a smaller number of iterations and fast convergence rates to achieve the optimal parameters of the power system stabilizers.Moreover,the proposed approach improves the stability and dynamic performance under various loads conditions and disturbances of the marine electric power system.

Research on the Algorithm of Avionic Device Fault Diagnosis Based on Fuzzy Expert System

Based on the fuzzy expert system fault diagnosis theory, the knowledge base architecture and inference engine algorithm are put forward for avionic device fault diagnosis. The knowledge base is constructed by fault query network, of which the basic ele- ment is the test-diagnosis fault unit. Every underlying fault cause＇s membership degree is calculated using fuzzy product inference algorithm, and the fault answer best selection algorithm is developed, to which the deep knowledge is applied. Using some examples the proposed algorithm is analyzed for its capability of synthesis diagnosis and its improvement compared to greater membership degree first principle.

A Novel Radius Adaptive Based on Center-Optimized Hybrid Detector Generation Algorithm

Negative selection algorithm(NSA)is one of the classic artificial immune algorithm widely used in anomaly detection.However,there are still unsolved shortcomings of NSA that limit its further applications.For example,the nonselfdetector generation efficiency is low;a large number of nonselfdetector is needed for precise detection;low detection rate with various application data sets.Aiming at those problems,a novel radius adaptive based on center-optimized hybrid detector generation algorithm(RACO-HDG)is put forward.To our best knowledge,radius adaptive based on center optimization is first time analyzed and proposed as an efficient mechanism to improve both detector generation and detection rate without significant computation complexity.RACO-HDG works efficiently in three phases.At first,a small number of self-detectors are generated,different from typical NSAs with a large number of self-sample are generated.Nonself-detectors will be generated from those initial small number of self-detectors to make hybrid detection of self-detectors and nonself-detectors possible.Secondly,without any prior knowledge of the data sets or manual setting,the nonself-detector radius threshold is self-adaptive by optimizing the nonself-detector center and the generation mechanism.In this way,the number of abnormal detectors is decreased sharply,while the coverage area of the nonself-detector is increased otherwise,leading to higher detection performances of RACOHDG.Finally,hybrid detection algorithm is proposed with both self-detectors and nonself-detectors work together to increase detection rate as expected.Abundant simulations and application results show that the proposed RACO-HDG has higher detection rate,lower false alarm rate and higher detection efficiency compared with other excellent algorithms.

Classification for Glass Bottles Based on Improved Selective Search Algorithm

The recycling of glass bottles can reduce the consumption of resources and contribute to environmental protection.At present,the classification of recycled glass bottles is difficult due to the many differences in specifications and models.This paper proposes a classification algorithm for glass bottles that is divided into two stages,namely the extraction of candidate regions and the classification of classifiers.In the candidate region extraction stage,aiming at the problem of the large time overhead caused by the use of the SIFT(scale-invariant feature transform)descriptor in SS(selective search),an improved feature of HLSN(Haar-like based on SPP-Net)is proposed.An integral graph is introduced to accelerate the process of forming an HBSN vector,which overcomes the problem of repeated texture feature calculation in overlapping regions by SS.In the classification stage,the improved SS algorithm is used to extract target regions.The target regions are merged using a non-maximum suppression algorithm according to the classification scores of the respective regions,and the merged regions are classified using the trained classifier.Experiments demonstrate that,compared with the original SS,the improved SS algorithm increases the calculation speed by 13.8%,and its classification accuracy is 89.4%.Additionally,the classification algorithm for glass bottles has a certain resistance to noise.

Object Recognition Algorithm Based on an Improved Convolutional Neural Network

In order to accomplish the task of object recognition in natural scenes,a new object recognition algorithm based on an improved convolutional neural network(CNN)is proposed.First,candidate object windows are extracted from the original image.Then,candidate object windows are input into the improved CNN model to obtain deep features.Finally,the deep features are input into the Softmax and the confidence scores of classes are obtained.The candidate object window with the highest confidence score is selected as the object recognition result.Based on AlexNet,Inception V1 is introduced into the improved CNN and the fully connected layer is replaced by the average pooling layer,which widens the network and deepens the network at the same time.Experimental results show that the improved object recognition algorithm can obtain better recognition results in multiple natural scene images,and has a higher degree of accuracy than the classical algorithms in the field of object recognition.

Adaptive path selection for the improved distributed mobility management

Current mobility management schemes usually represent centralized or hierarchical architectures,which force data traffic to be processed by a centralized mobility anchor.This allows the mobile node(MN)to be reachable anywhere and provides an efficient method for seamless session continuity.However,all of the signal messages and data traffic converge on particular mobility anchor,which causes excessive signaling and traffic at the centralized mobility anchor and single point of failure issues as data traffic increases.To overcome these limitations and handle increasing data traffic,the distributed mobility management(DMM)scheme has emerged as an alternative solution.Although previous researches have been conducted on DMM support,because their schemes employ an unconditional way to make direct paths after handover,they have some drawbacks,such as several signaling and chain of tunneling problems.Therefore,this paper introduces a new DMM scheme which adaptively creates a direct path.To support it,we present the path selection algorithm,which selects the most efficient path between a direct path and no direct path based on routing hops and traffic load.Through the performance analysis and results,we confirm that the proposed scheme is superior in terms of signaling and packet delivery costs.

Anti-jamming channel access in 5G ultra-dense networks: a game-theoretic learning approach

This paper investigates the Quality of Experience(QoE)oriented channel access anti-jamming problem in 5th Generation Mobile Communication(5G)ultra-dense networks.Firstly,considering that the 5G base station adopts beamforming technology,an anti-jamming model under Space Division Multiple Access(SDMA)conditions is proposed.Secondly,the confrontational relationship between users and the jammer is formulated as a Stackelberg game.Besides,to achieve global optimization,we design a local cooperation mechanism for users and formulate the cooperation and competition among users as a local altruistic game.By proving that the local altruistic game is an Exact Potential Game(EPG),we further prove the existence of pure strategy Nash Equilibrium(NE)among users and Stackelberg Equilibrium(SE)between users and jammer.Thirdly,to obtain the equilibrium solutions of the proposed games,we propose an anti-jamming channel selection algorithm and improve its convergence speed through heterogeneous learning parameters.The simulation results validate the convergence and effectiveness of the proposed algorithm.Compared with the throughput optimization scheme,our proposed scheme obtain a greater network satisfaction rate.Finally,we also analyze user fairness changes during the algorithm convergence process and get some interesting conclusions.

BFS-SVM Classifier for QoS and Resource Allocation in Cloud Environment

In cloud computing Resource allocation is a very complex task.Handling the customer demand makes the challenges of on-demand resource allocation.Many challenges are faced by conventional methods for resource allocation in order tomeet the Quality of Service(QoS)requirements of users.For solving the about said problems a new method was implemented with the utility of machine learning framework of resource allocation by utilizing the cloud computing technique was taken in to an account in this research work.The accuracy in the machine learning algorithm can be improved by introducing Bat Algorithm with feature selection(BFS)in the proposed work,this further reduces the inappropriate features from the data.The similarities that were hidden can be demoralized by the Support Vector Machine(SVM)classifier which is also determine the subspace vector and then a new feature vector can be predicted by using SVM.For an unexpected circumstance SVM model can make a resource allocation decision.The efficiency of proposed SVM classifier of resource allocation can be highlighted by using a singlecell multiuser massive Multiple-Input Multiple Output(MIMO)system,with beam allocation problem as an example.The proposed resource allocation based on SVM performs efficiently than the existing conventional methods;this has been proven by analysing its results.

森林优化特征选择算法的增强与扩展

特征选择作为一种重要的数据预处理方法,不但能解决维数灾难问题,还能提高算法的泛化能力.各种各样的方法已被应用于解决特征选择问题,其中,基于演化计算的特征选择算法近年来获得了更多的关注并取得了一些成功.近期研究结果表明,森林优化特征选择算法具有更好的分类性能及维度缩减能力.然而,初始化阶段的随机性、全局播种阶段的人为参数设定,影响了该算法的准确率和维度缩减能力;同时,算法本身存在着高维数据处理能力不足的本质缺陷.从信息增益率的角度给出了一种初始化策略,在全局播种阶段,借用模拟退火控温函数的思想自动生成参数,并结合维度缩减率给出了适应度函数;同时,针对形成的优质森林采取贪心算法,形成一种特征选择算法EFSFOA(enhanced feature selection using forest optimization algorithm).此外,在面对高维数据的处理时,采用集成特征选择的方案形成了一个适用于EFSFOA的集成特征选择框架,使其能够有效处理高维数据特征选择问题.通过设计对比实验,验证了EFSFOA与FSFOA相比在分类准确率和维度缩减率上均有明显的提高,高维数据处理能力更是提高到了100 000维.将EFSFOA与近年来提出的比较高效的基于演化计算的特征选择方法进行对比,EFSFOA仍具有很强的竞争力.

基于镜像选择的改进鲸鱼优化算法

针对鲸鱼优化算法收敛速度慢、精度低、易陷入局部最优解的缺点,提出了一种基于镜像选择的改进鲸鱼优化算法(Whale optimization algorithm based-on mirror selection,WOA-MS)。具体改进包括:(1)为了平衡全局搜索和局部开采,提出了一种基于Branin函数的自适应非线性惯性权重;(2)为了提高算法的个体质量和收敛速度,提出了一种镜像选择方法。通过对若干种测试函数进行优化,并与其他三种算法的实验结果进行比较,证明了WOA-MS具有良好的优化性能。

Iterative selection algorithm for service composition in distributed environments

In service oriented architecture （SOA）, service composition is a promising way to create new services. However, some technical challenges are hindering the application of service composition. One of the greatest challenges for composite service provider is to select a set of services to instantiate composite service with end- to-end quality of service （QoS） assurance across different autonomous networks and business regions. This paper presents an iterative service selection algorithm for quality driven service composition. The algorithm runs on a peer-to-peer （P2P） service execution environment--distributed intelligent service execution （DISE）, which provides scalable QoS registry, dynamic service selection and service execution services. The most significant feature of our iterative service selection algorithm is that it can work on a centralized QoS registry as well as cross decentralized ones. Network status is an optional factor in our QoS model and selection algorithm. The algorithm iteratively selects services following service execution order, so it can be applied either before service execution or at service run-time without any modification. We test our algorithm with a series of experiments on DISE. Experimental results illustrated its excellent selection and outstanding performance.

An Unsupervised Feature Selection Algorithm with Feature Ranking for Maximizing Performance of the Classifiers

Prediction plays a vital role in decision making. Correct prediction leads to right decision making to save the life, energy,efforts, money and time. The right decision prevents physical and material losses and it is practiced in all the fields including medical,finance, environmental studies, engineering and emerging technologies. Prediction is carried out by a model called classifier. The predictive accuracy of the classifier highly depends on the training datasets utilized for training the classifier. The irrelevant and redundant features of the training dataset reduce the accuracy of the classifier. Hence, the irrelevant and redundant features must be removed from the training dataset through the process known as feature selection. This paper proposes a feature selection algorithm namely unsupervised learning with ranking based feature selection(FSULR). It removes redundant features by clustering and eliminates irrelevant features by statistical measures to select the most significant features from the training dataset. The performance of this proposed algorithm is compared with the other seven feature selection algorithms by well known classifiers namely naive Bayes(NB),instance based(IB1) and tree based J48. Experimental results show that the proposed algorithm yields better prediction accuracy for classifiers.

一种基于Tracker端偏向邻居选择的距离感知BitTorrent系统(英文)

To address cross-ISP traffic problem caused by BitTorrent,we present our design and evaluation of a proximity-aware BitTorrent system. In our approach,clients generate global proximity-aware information by using landmark clustering;the tracker uses this proximity to maintain all peers in an orderly way and hands back a biased subset consisting of the peers who are physically closest to the requestor. Our approach requires no co-operation between P2P users and their Internet infra structures,such as ISPs or CDNs,no constantly path monitoring or probing their neighbors. The simulation results show that our approach can not only reduce unnecessary cross-ISP traffic,but also allow downloadsing fast.

Apple leaf disease identification using genetic algorithm and correlation based feature selection method

Apple leaf disease is one of the main factors to constrain the apple production and quality.It takes a long time to detect the diseases by using the traditional diagnostic approach,thus farmers often miss the best time to prevent and treat the diseases.Apple leaf disease recognition based on leaf image is an essential research topic in the field of computer vision,where the key task is to find an effective way to represent the diseased leaf images.In this research,based on image processing techniques and pattern recognition methods,an apple leaf disease recognition method was proposed.A color transformation structure for the input RGB(Red,Green and Blue)image was designed firstly and then RGB model was converted to HSI(Hue,Saturation and Intensity),YUV and gray models.The background was removed based on a specific threshold value,and then the disease spot image was segmented with region growing algorithm(RGA).Thirty-eight classifying features of color,texture and shape were extracted from each spot image.To reduce the dimensionality of the feature space and improve the accuracy of the apple leaf disease identification,the most valuable features were selected by combining genetic algorithm(GA)and correlation based feature selection(CFS).Finally,the diseases were recognized by SVM classifier.In the proposed method,the selected feature subset was globally optimum.The experimental results of more than 90%correct identification rate on the apple diseased leaf image database which contains 90 disease images for there kinds of apple leaf diseases,powdery mildew,mosaic and rust,demonstrate that the proposed method is feasible and effective.

Identification of metastasis-associated genes in colorectal cancer through an integrated genomic and transcriptomic analysis

Objective： Identification of colorectal cancer （CRC） metastasis genes is one of the most important issues in CRC research. For the purpose of mining CRC metastasis-associated genes, an integrated analysis of mJcroarray data was presented, by combined with evidence acquired from comparative genornic hybridization （CGH） data. Methods： Gene expression profile data of CRC samples were obtained at Gene Expression Omnibus （GEO） website. The 15 important chromosomal aberration sites detected by using CGH technology were used for integrated genomic and transcriptomic analysis. Significant Analysis of Microarray （SAM） was used to detect significantly differentially expressed genes across the whole genome. The overlapping genes were selected in their corresponding chromosomal aberration regions, and analyzed by using the Database for Annotation, Visualization and Integrated Discovery （DAVID）. Finally, SVM-T-RFE gene selection algorithm was applied to identify ted genes in CRC. Results： A minimum gene set was obtained with the minimum number [14] of genes, and the highest classification accuracy （100%） in both PRI and META datasets. A fraction of selected genes are associated with CRC or its metastasis. Conclusions- Our results demonstrated that integration analysis is an effective strategy for mining cancer- associated genes.