Email this article 
Open Access
Subscription or Fee Access
Chaos Genetic Algorithm and Adaboost Algorithm for Clustering the Data
Abstract
In this research the performance of AdaBoost algorithm and Chaos Genetic Algorithm were made in real learning problems. To cluster the data two experiments were made, initially the experiment were made to compare the AdaBoost with Chaos Genetic Algorithm when used to aggregate various classifiers. Secondly the Time-Cost Tradeoff (TCT) problems have been studied with the optimization techniques. With higher efficiency the two methods were compared and processed. It avoids local convergence when comparing the diversity of Chaos Genetic Algorithm with AdaBoost. Moreover, the experimental results shows that the proposed method minimizes the number of iterations in optimization problems and significantly increase the performance of the adaboost. This paper compared the performance of these two methods by using the machine learning benchmarks.
Keywords
References
Veyssieres, M. P., & Plant, R. E. (1998). Identification of vegetation state and transition domains in California’s hardwood rangelands. University of California, 101.
Freund, Y., Schapire, R., & Abe, N. (1999). A short introduction to boosting. Journal-Japanese Society For Artificial Intelligence, 14(771-780), 1612.
Liu, T., Rosenberg, C., & Rowley, H. A. (2007, February). Clustering billions of images with large scale nearest neighbor search. In Applications of Computer Vision, 2007. WACV'07. IEEE Workshop on (pp. 28-28). IEEE.
Liu, T., Moore, A. W., Yang, K., & Gray, A. G. (2004). An investigation of practical approximate nearest neighbor algorithms. In Advances in neural information processing systems (pp. 825-832).
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software (TOMS), 3(3), 209-226.
Chang, W. D. (2007). Nonlinear system identification and control using a real-coded genetic algorithm. Applied Mathematical Modelling, 31(3), 541-550.
Cheng, M. Y., & Huang, K. Y. (2010). Genetic algorithm-based chaos clustering approach for nonlinear optimization. Journal of Marine Science and Technology, 18(3), 435-441.
Eshelman, L. J., & Schaffer, J. D. (1991, July). Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. In ICGA (Vol. 91, pp. 115-122).
Nanayakkara, S. C., Srinivasan, D., Lup, L. W., German, X., Taylor, E., & Ong, S. H. (2007, September). Genetic algorithm based route planner for large urban street networks. In 2007 IEEE Congress on Evolutionary Computation (pp. 4469-4474). IEEE.
Yan, L., & Kongyu, Y. (2008, December). Immunity genetic algorithm based on elitist strategy and its application to the TSP problem. In Intelligent Information Technology Application Workshops, 2008. IITAW'08. International Symposium on (pp. 3-6). IEEE.
Snaselova, P., & Zboril, F. (2015). Genetic Algorithm using Theory of Chaos. Procedia Computer Science, 51, 316-325.
Finley, T., & Joachims, T. (2005, August). Supervised clustering with support vector machines. In Proceedings of the 22nd international conference on Machine learning (pp. 217-224). ACM.
Quinlan, J. R. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993.
Garcia, S., Saad, M., & Akhrif, O. (2006). Nonlinear tuning of aircraft controllers using genetic global optimization: A new periodic mutation operator. Canadian Journal of Electrical and Computer Engineering, 31(3), 149-158.
Huang, H. W., Lu, C. H., & Fu, L. C. (2007, September). Lot dispatching and scheduling integrating OHT traffic information in the 300mm Wafer Fab. In 2007 IEEE International Conference on Automation Science and Engineering (pp. 495-500). IEEE.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.