Search

This paper proposes a cloud computing-based approach to efficiently process the massive data produced in intelligent machine tool diagnosis flow. By collecting and extracting the vibration, power and other useful system signals during the machining operation of machine tools, the cutting process samples and cutting gap samples of machine tools can be accurately segmented, in order to construct a set of signal samples that can effectively and completely characterize the level of tool wear. We propose a visual detection method that relies on local threshold segmentation to predict tool wear status. The machine tool image is divided into several small blocks, and each image block is segmented to obtain the segmentation threshold, which is defined as the local threshold of each block. Then, the detection method scans the whole image based on the maximum local threshold among all blocks. Considering the complicated flow of visual detection and the high volume of machine tool diagnosis data, we further propose a big data processing approach which is implemented on a cloud computing architecture. By modeling the workflow of the proposed visual detection method as a directed acyclic graph, we develop a scheduling model that aims at minimizing the execution time of massive tool diagnosis data processing with available cloud computing resources. A effective metaheuristic based on search strategy of artificial bee colony is developed to solve the formulation scheduling problem. Experimental results on a cloud-based system demonstrate that, the visual detection method enhances the accuracy of tool wear detection, and the cloud-based approach significantly reduces the execution time of tool diagnosis flow by means of distributed computing. [ABSTRACT FROM AUTHOR]

For an industrial system reliability, availability and maintainability (RAM) analysis play an important role in any design modification for achieving its optimum performance. However, it is difficult to predict these parameters by using available and imprecise data up to a desired degree of accuracy. For this, a novel technique named as an artificial bee colony based Lambda-Tau has been presented for computing these parameters by utilizing available or collected data up to a desired degree of accuracy. In this technique expression of RAM parameters are calculated by Lambda-Tau methodology and their corresponding membership functions are computed by formulating a nonlinear programming problem. A generalized RAM-Index has been used for ranking the components of the system based on its performance for improving the system productivity. The presented approach has been investigated through a case study of washing unit of paper industry and computed results are compared with existing Lambda-Tau and evolutionary algorithm techniques. [ABSTRACT FROM AUTHOR]

This paper introduces a novel algorithm called variable population size artificial bee colony (VPS-ABC) optimization algorithm. VPS-ABC is proposed to overcome the impact of the effect of initial population and improve the convergence rate of classical ABC. The main idea is based on reducing the number of food sources gradually and moving the bees towards the global best food source in each re-initialization process. Moreover, an analysis for convergence of the ABC algorithm is proofed in details. The convergence analysis is based on the relation between ABC variants and the general solution of the food source regeneration equation. To show the fitness of the proposed algorithm, a comparison is made between VPS-ABC versus classical ABC, PSO, and GA algorithms in tuning the proportional-integral-derivative (PID) controllers. Simulation results show that VPS-ABC algorithm is highly competitive, often outperforming PSO and GA algorithms. [ABSTRACT FROM AUTHOR]

Modeling user knowledge and creating user profiles not only for special web-based social media but also for complex and mixed personalized learning environments are important research challenges. The key component for adaptation is the user's knowledge model. This paper introduces fuzzy metric (FM)-based novel and efficient similarity measurement method and adaptive artificial neural network (AANN) and artificial bee colony (ABC)-based knowledge classification approaches for personalized learning environments. For this purpose, FM-based method has been developed to measure distances more efficiently among the users and their knowledge model using the web logs/session data. In addition, a novel knowledge classifier based on ABC and AANN having combined with the generic object model has been developed for user modeling strategies and user modeling server of adaptive educational electric course (AEEC). Finally, the approaches have been tested to compare the classification performance of the user modeling methods developed for user modeling task. The experimental results have shown that proposed methods have improved similarity measurements considerably and decreased the misclassifications in user modeling processes. Thus, powerful user modeling approaches have been presented to the literature. It is expected that the approaches introduced in this article can be a reference to others researches and to develop more adaptive and personalized web applications in future. [ABSTRACT FROM AUTHOR]

Data clustering is a common data mining techniques used in many applications such as data analysis and pattern recognition. K-means algorithm is the common clustering method which has fallen into the trap of local optimization and does not always create the optimized response to the problem, although having more advantages such as high speed. Artificial bee colony (ABC) is a novel biological-inspired optimization algorithm, having the advantage of less control parameters, strong global optimization ability and easy to implement. However, there are still some problems in ABC algorithm, like inability to find the best solution from all possible solutions. Due to the large step of searching equation in ABC, the chance of skipping the true solution is high. Therefore, in this paper, to balance the diversity and convergence ability of the ABC, Mantegna Lévy distribution random walk is proposed and incorporated with ABC. The new algorithm, ABCL, brings the power of the Artificial Bee Colony algorithm to the K-means algorithm. The proposed algorithm benefits from Mantegna Lévy distribution to promote the ABC algorithm in solving the number of functional evaluation and also obtaining better convergence speed and high accuracy in a short time. We empirically evaluate the performance of our proposed method on nine standard datasets taken from the UCI Machine Learning Repository. The experimental results show that the proposed algorithm has ability to obtain better results in terms of convergence speed, accuracy, and reducing the number of functional evaluation. [ABSTRACT FROM AUTHOR]

In data mining, classification rule learning extracts the knowledge in the representation of IF_THEN rule which is comprehensive and readable. It is a challenging problem due to the complexity of data sets. Various meta-heuristic machine learning algorithms are proposed for rule learning. Cooperative rule learning is the discovery process of all classification rules with a single run concurrently. In this paper, a novel cooperative rule learning algorithm, called CoABCMiner, based on Artificial Bee Colony is introduced. The proposed algorithm handles the training data set and discovers the classification model containing the rule list. Token competition, new updating strategy used in onlooker and employed phases, and new scout bee mechanism are proposed in CoABCMiner to achieve cooperative learning of different rules belonging to different classes. We compared the results of CoABCMiner with several state-of-the-art algorithms using 14 benchmark data sets. Non parametric statistical tests, such as Friedman test, post hoc test, and contrast estimation based on medians are performed. Nonparametric tests determine the similarity of control algorithm among other algorithms on multiple problems. Sensitivity analysis of CoABCMiner is conducted. It is concluded that CoABCMiner can be used to discover classification rules for the data sets used in experiments, efficiently. [ABSTRACT FROM AUTHOR]

To solve the imperfect springs structure parameters in the design of energy storage springs of the universal circuit breakers, and problems such as large volume of circuit breakers and low design efficiency, an approach to optimize the parameters of the energy storage springs of the circuit breakers is proposed based on the Artificial Bee Colony (ABC) algorithm. First, the mathematical optimization model of energy storage springs and the constraints of the spring parameters are derived in accordance with the working principle of energy storage springs. Then combined with cloud model and cross operation, the ABC algorithm is improved, which can adjust the cross factor, accelerate the convergence speed of ABC algorithm and improve the global search ability. And the classical test-function simulations verify that the improved ABC algorithm is superior to other evolutionary algorithms. Finally, the two different types of energy storage springs optimization models of universal circuit breakers are experimentally analyzed by use of the improved ABC algorithm, and the corresponding springs' parameters are calculated. The experiment results show that the proposed approach is effective, which can reasonably design the parameters of energy storage springs of circuit breakers and improve the design efficiency. [ABSTRACT FROM AUTHOR]

This work proposed a memetic version of Artificial Bee Colony algorithm, or called LSABC, which employed a "shrinking" local search strategy. By gradually shrinking the local search space along with the optimization process, the proposed LSABC algorithm randomly explores a large space in the early run time. This helps to avoid premature convergence. Then in the later evolution process, the LSABC finely exploits a small region around the current best solution to achieve a more accurate output value. The optimization behavior of the LSABC algorithm was studied and analyzed in the work. Compared with the classic ABC and several other state-of-the-art optimization algorithms, the LSABC shows a better performance in terms of convergence rate and quality of results for high-dimensional problems. [ABSTRACT FROM AUTHOR]

Microblogging is a type of blog used by people to express their opinions, attitudes, and feelings toward entities with a short message and this message is easily shared through the network of connected people. Knowing their sentiments would be beneficial for decision-making, planning, visualization, and so on. Grouping similar microblogging messages can convey some meaningful sentiments toward an entity. This task can be accomplished by using a simple and fast clustering algorithm, K -means. As the microblogging messages are short and noisy they cause high sparseness and high-dimensional dataset. To overcome this problem, term frequency–inverse document frequency (tf–idf) technique is employed for selecting the relevant features, and singular value decomposition (SVD) technique is employed for reducing the high-dimensional dataset while still retaining the most relevant features. These two techniques adjust dataset to improve the K -means efficiently. Another problem comes from K -means itself. K -means result relies on the initial state of centroids, the random initial state of centroids usually causes convergence to a local optimum. To find a global optimum, artificial bee colony (ABC), a novel swarm intelligence algorithm, is employed to find the best initial state of centroids. Silhouette analysis technique is also used to find optimal K. After clustering into K groups, each group will be scored by SentiWordNet and we analyzed the sentiment polarities of each group. Our approach shows that combining various techniques (i.e., tf–idf, SVD, and ABC) can significantly improve K -means result (41% from normal K -means). [ABSTRACT FROM AUTHOR]

Computation Intelligence has inspired many researchers to develop the capability of computers to learn and solve a complex task in real-world problems. In this work, we propose an Artificial Bee Colony (ABC) to deal with the Stock Selection problem. We apply a Sigmoid-based Discrete-Continuous model with ABC to select appropriate features for stock scoring. The empirical study tests the performance of ABC compared with Genetic Algorithm (GA) and Differential Evolution (DE) algorithm by using data from the Stock Exchange Thailand. The empirical results show that the novel model stock selection significantly outperforms in terms of both investment return, diversity and model robustness. [ABSTRACT FROM AUTHOR]

Feature subset selection assumes an essential part in the fields of data mining and machine learning. A good feature subset selection algorithm can adequately expel unimportant and repetitive elements and consider feature interaction. This not just paves the way to an understanding comprehension of the information, additionally enhances the execution of a learner by improving the generalization capacity and the interpretability of the learning model. Initially, the input micro array dataset is selected from the medical database. Then preprocessing step is done in the input micro array dataset. The resultant output is fed to the second step; here the features are optimally selected using clustering and optimization process. In our proposed technique, the optimal hybrid fuzzy c-means clustering algorithm with artificial bee colony algorithm is applied on the high dimensional micro array dataset to select the important features. Here the proposed method is optimally select the features with the help of social spider optimization algorithm. After that, the classification is done through improved support vector machine classifier. At last, the experimentation is performed by means of different micro array dataset. Experimental results indicate that the proposed classification framework has outperformed by having better accuracy of 93.19% for GLA-BRA-180 dataset when compared existing SVM and neuro fuzzy classifier only achieved 90.69% and 89%. [ABSTRACT FROM AUTHOR]

The swarm intelligence optimization algorithms are used widely in static purposes and applications. They solve the static optimization problems successfully. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments as well. The dynamic optimization problems indicate the ones whose solutions change over time. The artificial bee colony algorithm is one of the swarm intelligence optimization algorithms. In this study, a clustering and memory-based chaotic artificial bee colony algorithm, denoted by CMCABC, has been proposed for solving the dynamic optimization problems. A chaotic system has a more accurate prediction for future in the real-world applications compared to a random system, because in the real-world chaotic behaviors have emerged, but random behaviors havenot been observed. In the proposed CMCABC method, explicit memory has been used to save the previous good solutions which are not very old. Maintaining diversity in the dynamic environments is one of the fundamental challenges while solving the dynamic optimization problems. Using clustering technique in the proposed method can well maintain the diversity of the problem environment. The proposed CMCABC method has been tested on the moving peaks benchmark (MPB). The MPB is a good simulator to evaluate the efficiency of the optimization algorithms in dynamic environments. The experimental results on the MPB reveal the appropriate efficiency of the proposed CMCABC method compared to the other state-of-the-art methods in solving dynamic optimization problems. [ABSTRACT FROM AUTHOR]

A new method for reinforcement fuzzy controllers is presented by this article. The method uses Artificial Bee Colony algorithm based on Q-Value to control reinforcement fuzzy system; the algorithm is called Artificial Bee Colony-Fuzzy Q learning (ABC-FQ). In fuzzy inference system, precondition part of rules is generated by prior knowledge, but ABC-FQ algorithm is responsible to achieve the best combination of actions for the consequence part of the rules. In ABC-FQ algorithm, each combination of actions is considered a food source for consequence part of the rules and the fitness level of this food source is determined by Q-Value. ABC-FQ Algorithm selects the best food resource, which is the best combination of actions for fuzzy system, using Q criterion. This algorithm tries to generate the best reinforcement fuzzy system to control the agent. ABC-FQ algorithm is used to solve the problem of Truck Backer-Upper Control, a reinforcement fuzzy control. The results have indicated that this method arrives to a result with higher speed and fewer trials in comparison to previous methods. [ABSTRACT FROM AUTHOR]