scholarly journals Ant Colony Algorithm for Determining Dynamic Travel Routes Based on Traffic Information from Twitter

2019 ◽  
Vol 125 ◽  
pp. 23012
Author(s):  
Edy Subowo ◽  
Eko Sediyono ◽  
Farikhin
Keyword(s):  
Ant Colony Algorithm ◽  
Fire Suppression ◽  
Computation Time ◽  
Ant Colony ◽  
Training Data ◽  
Traffic Information ◽  
Support Vector ◽  
Weighting Method ◽  
Shortest Distance ◽  
Simple Additive Weighting

Combining the search method for fire suppression routes with ant colony algorithms and methods of analyzing twitter events on the highway is the basis of the problems to be studied. The results of the twitter data feature extraction are classified with Support Vector Machine after it is implemented in the Simple Additive Weighting method in calculating path weights with criteria of distance, congestion, multiple branching, and many holes. Line weights are also used as initial pheromone values. The C-means method is used to group the weights of each path and distance so that the path with the lowest weight and the shortest distance that will be simulated using the Ant Colony. The validation results with cross fold on SVM with linear kernels produce the greatest accuracy value is 97.93% for training data distribution: test data 6: 4. The simulation of the selection of the damkar car path from Feather to Pleburan with Ant Colony obtained 50 seconds of computation time, whereas with Ant Colony with Clustering the computation time was 15, resulting in a reduction in computing of 35. Ant colony with MinMax optimization gives the best computation time of 14.47 seconds with 100 iterations and 10 nodes.

scholarly journals Contactless Distribution Path Optimization Based on Improved Ant Colony Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Feng Wu
Keyword(s):  
Customer Service ◽  
User Satisfaction ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Cost Model ◽  
Ant Colony ◽  
Path Optimization ◽  
Traffic Information ◽  
Research Areas ◽  
Improved Ant Colony Algorithm

In the context of the normalization of the epidemic, contactless delivery is becoming one of the most concerned research areas. In the severe epidemic environment, due to the frequent encounter of bayonet temperature measurement, road closure, and other factors, the real-time change frequency of each traffic information is high. In order to improve the efficiency of contactless distribution and enhance user satisfaction, this paper proposes a contactless distribution path optimization algorithm based on improved ant colony algorithm. First of all, the possible traffic factors in the epidemic environment were analyzed, and the cost of each link in the distribution process was modeled. Then, the customer satisfaction is analyzed according to the customer service time window and transformed into a cost model. Finally, the total delivery cost and user satisfaction cost were taken as the optimization objectives, and a new pheromone updating method was adopted and the traditional ant colony algorithm was improved. In the experiment, the effectiveness of the proposed model and algorithm is verified through the simulation optimization and comparative analysis of an example.

A Kind of Network Intrusion Detection Method Using Improved Support Vector Machine Based on Ant Colony Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2995-2998
Author(s):  
Xiaoqin Zhang ◽  
Guo Jun Jia
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Feature Extraction ◽  
Ant Colony Algorithm ◽  
Small Sample ◽  
Ant Colony ◽  
Support Vector ◽  
Algorithm Selection ◽  
Data Set ◽  
Network Intrusion

Support vector machine (SVM) is suitable for the classification problem which is of small sample, nonlinear, high dimension. SVM in data preprocessing phase, often use genetic algorithm for feature extraction, although it can improve the accuracy of classification. But in feature extraction stage the weak directivity of genetic algorithm impact the time and accuracy of the classification. The ant colony algorithm is used in genetic algorithm selection stage, which is better for the data pretreatment, so as to improve the classification speed and accuracy. The experiment in the KDD99 data set shows that this method is feasible.

scholarly journals Improving the Interpretability of Classification Rules Discovered by an Ant Colony Algorithm: Extended Results

2016 ◽  
Vol 24 (3) ◽  
pp. 385-409 ◽  
Author(s):  
Fernando E. B. Otero ◽  
Alex A. Freitas
Keyword(s):  
Ant Colony Algorithm ◽  
Predictive Accuracy ◽  
Ant Colony ◽  
Support Vector ◽  
Classification Rules ◽  
Class Prediction ◽  
Vector Machines ◽  
Size Measure ◽  
The Impact

Most ant colony optimization (ACO) algorithms for inducing classification rules use a ACO-based procedure to create a rule in a one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-Miner[Formula: see text] algorithm, where an ACO-based procedure is used to create a complete list of rules (ordered rules), i.e., the ACO search is guided by the quality of a list of rules instead of an individual rule. In this paper we propose an extension of the cAnt-Miner[Formula: see text] algorithm to discover a set of rules (unordered rules). The main motivations for this work are to improve the interpretation of individual rules by discovering a set of rules and to evaluate the impact on the predictive accuracy of the algorithm. We also propose a new measure to evaluate the interpretability of the discovered rules to mitigate the fact that the commonly used model size measure ignores how the rules are used to make a class prediction. Comparisons with state-of-the-art rule induction algorithms, support vector machines, and the cAnt-Miner[Formula: see text] producing ordered rules are also presented.

scholarly journals GENERATOR FUEL COST OPTIMIZATION USING ANT COLONY ALGORITHM

2019 ◽  
Vol 1 (1) ◽  
pp. 1-4
Author(s):  
Indri Suryawati ◽  
Sagita Rochman
Keyword(s):  
Power Flow ◽  
Power Plants ◽  
Optimal Power Flow ◽  
Ant Colony Algorithm ◽  
Fitness Function ◽  
Cost Optimization ◽  
Ant Colony ◽  
Fuel Cost ◽  
Ant Behavior ◽  
Shortest Distance

Ant Colony Algorithm (ACA) is an optimization algorithm was inspired by ant behavior when searching for the shortest distance from the food center. In this study, ACA is used for power plants with a fuel cost fitness function. ACA can search destinations faster than conventional methods such as Lagrange. In this study ACA used the optimal power flow of six power plants in the Java Bali 500 KV system, the optimization results reduced fuel costs by 23% and Lagrange 17.4% compared to real conditions.  

scholarly journals LEAST SQUARES SUPPORT VECTOR MACHINES PARAMETER OPTIMIZATION BASED ON IMPROVED ANT COLONY ALGORITHM FOR HEPATITIS DIAGNOSIS

2017 ◽  
Vol 10 (1) ◽  
pp. 43 ◽  
Author(s):  
Nursuci Putri Husain ◽  
Nursanti Novi Arisa ◽  
Putri Nur Rahayu ◽  
Agus Zainal Arifin ◽  
Darlis Herumurti
Keyword(s):  
Support Vector Machines ◽  
Least Squares ◽  
Classification Accuracy ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Support Vector ◽  
Optimal Parameters ◽  
Local Fisher Discriminant Analysis ◽  
Vector Machines ◽  
Improved Ant Colony Algorithm

Many kinds of classification method are able to diagnose a patient who suffered Hepatitis disease. One of classification methods that can be used was Least Squares Support Vector Machines (LSSVM). There are two parameters that very influence to improve the classification accuracy on LSSVM, they are kernel parameter and regularization parameter. Determining the optimal parameters must be considered to obtain a high classification accuracy on LSSVM. This paper proposed an optimization method based on Improved Ant Colony Algorithm (IACA) in determining the optimal parameters of LSSVM for diagnosing Hepatitis disease. IACA create a storage solution to keep the whole route of the ants. The solutions that have been stored were the value of the parameter LSSVM. There are three main stages in this study. Firstly, the dimension of Hepatitis dataset will be reduced by Local Fisher Discriminant Analysis (LFDA). Secondly, search the optimal parameter LSSVM with IACA optimization using the data training, And the last, classify the data testing using optimal parameters of LSSVM. Experimental results have demonstrated that the proposed method produces high accuracy value (93.7%) for  the 80-20% training-testing partition.

Natural Image Classification Based on Improved Support Vector Machine

2011 ◽  
Vol 58-60 ◽  
pp. 2387-2391
Author(s):  
Ying Jian Qi ◽  
Zhi Wei Ou ◽  
Bin Zhang ◽  
Ting Zhan Liu ◽  
Ying Li
Keyword(s):  
Support Vector Machine ◽  
Image Classification ◽  
Ant Colony Algorithm ◽  
Image Representation ◽  
Image Features ◽  
Ant Colony ◽  
Function Parameter ◽  
Support Vector ◽  
Natural Image ◽  
Improved Support Vector Machine

Local image representation based natural image classification is an important task. SIFT descriptors and bag-of-visterm (BOV)method have achieved very good results. Many studies focused on improving the representation of the image, and then use the support vector machine to classify and identify the image category. However, due to support vector machine its own characteristics, it shows inflexible and slower convergence rate for large samples，with the selection of parameters influencing the results for the algorithm very much. Therefore, this paper will use the improved support vector machine algorithm be based on ant colony algorithm in classification step. The method adopt dense SIFT descriptors to describe image features and then use two levels BOV method to obtain the image representation. In recognition step, we use the support vector machine as a classifier but ant colony optimization method is used to selects kernel function parameter and soft margin constant C penalty parameter. Experiment results show that this solution determined the parameter automatically without trial and error and improved performance on natural image classification tasks.

Bankruptcy Prediction by Genetic Ant Colony Algorithm

2011 ◽  
Vol 186 ◽  
pp. 459-463 ◽  
Author(s):  
Yu Dong Zhang ◽  
Le Nan Wu
Keyword(s):  
Success Rate ◽  
Ant Colony Algorithm ◽  
Computation Time ◽  
Bankruptcy Prediction ◽  
Ant Colony ◽  
Misclassification Error ◽  
Average Computation Time ◽  
Novel Method ◽  
Statistical Resampling ◽  
Training Subset

Corporate bankruptcy is a hot topic in economical research. Traditional methods cannot reach satisfying classification accuracy due to the high dimensional features. In this study, we proposed a novel method based on wrapper-based feature selection. Moreover, a novel genetic ant colony algorithm (GACA) was proposed as the search method, and the rule-based model was employed as the classifier. Stratified K-fold cross validation method was taken as the statistical resampling to reduce overfitting. Simulations take 1,000 runs of each algorithm on the dataset of 800 corporations during the period 2006-2008. The results of the training subset show that the GACA obtains 84.3% success rate, while GA obtains only 48.8% and ACA obtains 22.1% success rate. The results on test subset demonstrate that the mean misclassification error of GACA is only 7.79%, less than those of GA (19.31%) and ACA (23.89%). The average computation time of GACA is only 0.564s compared to the GA (1.203s) and ACA (1.109s).

scholarly journals Hybrid Deep Learning Models for Sentiment Analysis

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Cach N. Dang ◽  
María N. Moreno-García ◽  
Fernando De la Prieta
Keyword(s):  
Deep Learning ◽  
Sentiment Analysis ◽  
Short Term Memory ◽  
Computation Time ◽  
Hybrid Models ◽  
Training Data ◽  
Support Vector ◽  
Learning Models ◽  
Hybrid Techniques ◽  
Wide Range

Sentiment analysis on public opinion expressed in social networks, such as Twitter or Facebook, has been developed into a wide range of applications, but there are still many challenges to be addressed. Hybrid techniques have shown to be potential models for reducing sentiment errors on increasingly complex training data. This paper aims to test the reliability of several hybrid techniques on various datasets of different domains. Our research questions are aimed at determining whether it is possible to produce hybrid models that outperform single models with different domains and types of datasets. Hybrid deep sentiment analysis learning models that combine long short-term memory (LSTM) networks, convolutional neural networks (CNN), and support vector machines (SVM) are built and tested on eight textual tweets and review datasets of different domains. The hybrid models are compared against three single models, SVM, LSTM, and CNN. Both reliability and computation time were considered in the evaluation of each technique. The hybrid models increased the accuracy for sentiment analysis compared with single models on all types of datasets, especially the combination of deep learning models with SVM. The reliability of the latter was significantly higher.

scholarly journals HYBRID OPTIMIZATION OF OBJECT-BASED CLASSIFICATION IN HIGH-RESOLUTION IMAGES USING CONTINOUS ANT COLONY ALGORITHM WITH EMPHASIS ON BUILDING DETECTION

2017 ◽  
Vol XLII-4/W4 ◽  
pp. 271-279
Author(s):  
E. Tamimi ◽  
H. Ebadi ◽  
A. Kiani
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Computational Time ◽  
Support Vector ◽  
Building Detection ◽  
Svm Classification ◽  
Spectral Bands ◽  
Object Based ◽  
High Resolution Images ◽  
Independent Features

Automatic building detection from High Spatial Resolution (HSR) images is one of the most important issues in Remote Sensing (RS). Due to the limited number of spectral bands in HSR images, using other features will lead to improve accuracy. By adding these features, the presence probability of dependent features will be increased, which leads to accuracy reduction. In addition, some parameters should be determined in Support Vector Machine (SVM) classification. Therefore, it is necessary to simultaneously determine classification parameters and select independent features according to image type. Optimization algorithm is an efficient method to solve this problem. On the other hand, pixel-based classification faces several challenges such as producing salt-paper results and high computational time in high dimensional data. Hence, in this paper, a novel method is proposed to optimize object-based SVM classification by applying continuous Ant Colony Optimization (ACO) algorithm. The advantages of the proposed method are relatively high automation level, independency of image scene and type, post processing reduction for building edge reconstruction and accuracy improvement. The proposed method was evaluated by pixel-based SVM and Random Forest (RF) classification in terms of accuracy. In comparison with optimized pixel-based SVM classification, the results showed that the proposed method improved quality factor and overall accuracy by 17% and 10%, respectively. Also, in the proposed method, Kappa coefficient was improved by 6% rather than RF classification. Time processing of the proposed method was relatively low because of unit of image analysis (image object). These showed the superiority of the proposed method in terms of time and accuracy.

Fault diagnosis based on support vector machines with parameter optimization by an ant colony algorithm

2009 ◽  
Vol 224 (1) ◽  
pp. 217-229 ◽  
Author(s):  
X L Zhang ◽  
X F Chen ◽  
Z J He
Keyword(s):  
Fault Diagnosis ◽  
Support Vector Machines ◽  
Parameter Optimization ◽  
Ant Colony Algorithm ◽  
Small Sample ◽  
Ant Colony ◽  
Support Vector ◽  
Optimal Parameters ◽  
Vector Machines ◽  
Diagnosis Method

Since support vector machines (SVM) exhibit a good generalization performance in the small sample cases, these have a wide application in machinery fault diagnosis. However, a problem arises from setting optimal parameters for SVM so as to obtain optimal diagnosis result. This article presents a fault diagnosis method based on SVM with parameter optimization by ant colony algorithm to attain a desirable fault diagnosis result, which is performed on the locomotive roller bearings to validate its feasibility and efficiency. The experiment finds that the proposed algorithm of ant colony optimization with SVM (ACO—SVM) can help one to obtain a good fault diagnosis result, which confirms the advantage of the proposed ACO—SVM approach.

Sign in / Sign up

Export Citation Format

Share Document