Applying the SAC Algorithm to Extract the Cardiologic Indicators of an Athlete's Level
International Journal of Intelligent Information Systems
Volume 5, Issue 3-1, May 2016, Pages: 23-27
Received: Dec. 19, 2015;
Accepted: Dec. 21, 2015;
Published: Jun. 18, 2016
Views 3476 Downloads 110
Mohamed Hamlich, Electrical Engineering Department of Hassan II University, ENSAM, Casablanca, Morocco
Mohammed Ramdani, Computer Science Lab of Hassan II University, FSTM, Mohammedia, Morocco
The objective of this paper is to identify the parameters that determine the level (high or low) of an athlete. The developed method is based on the algorithms of ant colonies. In this paper We will focus on the application of an algorithm named: SAC “Scout Ant for Clustering”. This method is an extension of existing data clustering algorithms (ACO) based on ant colonies. The clusters’ separation test was improved by using the probabilities determined in step search of the best path between all instances. The SAC method treated any data sets (heterogeneous attributes: continuous and nominal) and represents each cluster by its prototype. This is determined for each cluster and it is the closest instance to all elements of the cluster. This method will be applied to cardiological data, which are taken on athletes.
Applying the SAC Algorithm to Extract the Cardiologic Indicators of an Athlete's Level, International Journal of Intelligent Information Systems. Special Issue: Smart Applications and Data Analysis for Smart Cities.
Vol. 5, No. 3-1,
2016, pp. 23-27.
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/
) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
M. Hamlich, and M. Ramdani, “Data classification by Fuzzy Ant-Miner”, IJCSI International Journal of Computer Sciences issues, Vol 9, Issue 2, N° 3, Marsh 2012, ISSN (Online) 1694-08 14.
M. Hamlich, and M. Ramdani, «Improved ant colony algorithms for data classification», Complex Systems (ICCS), 2012, Agadir, ISBN: 978-1-4673-4764-8, IEE Xplore.
D. Dubois, H. Prade (1996). What are fuzzy rules and how to use them. Fuzzy Sets and Systems, Vol. 84 (2), pp. 169-186.
Y. Kao and K. Cheng, “An ACO-Based Clustering Algorithm”, Tatung University, Taipei, Taiwan (2006).
K. Socha, ACO for Continuous and Mixed-Variable Optimization, Proceedings of the Fourth International workshop on Ant Colony Optimization and Swarm Intelligence, Brussels, Belgium, 2004.
D. Costa and A. Hertz, “Ants Can Colour Graphs.” Journal of the Operational Research Society, 48, 295-305, 1997.
M. Divyavani, T. Amudha, “Comparing the Clustering Efficiency of ACO and K-Harmonic Means Techniques”, International Journal of Computer Science. Engineering and Applications (IJCSEA) Vol. 1, No. 4, August 2011.
M. Hamlich and M. Ramdani, «Applying the Fuzzy Ant-Miner algorithm to extract the success indicators of Balloon Dilation», Congrès International sur les Sciences et Technologies de l’Information et de la Communication (CISTIC2014), Decembre 02-04, 2014.
M. Hamlich and M. Ramdani, “Scout Ants for Clustering”, Journal of Theoretical and Applied Information Technology (JATIT), September 2013 -- Vol. 55. No. 1--2013.
U. Maulik, and S. Bandyopadhyay, (2002) "Performance evaluation of some clustering algorithms and validity indices," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 12.
M. Hamlich and M. Ramdani, “Fuzzy Ant-Miner”, IADIS European Conference Data Mining 2012, Lisboa Portugal, ISBN 978-972-8939-69-4.
G, A. Chan, and A. Freitas, “A new classification-rule pruning procedure for an ant colony algorithm”, Lecture Notes in Artificial Intelligence 2005, 3871 25–36.
RUI XU and DONALD C. WUNSCH, II, “Clustering”, Published by John Wiley & Sons, Inc., Hoboken, New Jersey, 2009 by Institute of Electrical and Electronics Engineers, Library of Congress Cataloging - in-Publication Data is available. ISBN: 978-0-470-27680-8.