(Publisher of Peer Reviewed Open Access Journals)

International Journal of Advanced Computer Research (IJACR)

ISSN (Print):2249-7277    ISSN (Online):2277-7970
Volume-6 Issue-25 July-2016
Full-Text PDF
DOI:10.19101/IJACR.2016.625020
Paper Title : Independent component analysis based on adaptive artificial bee colony
Author Name : Shi Zhang, Chao-Wei Bao and Hai-Bin Shen
Abstract :

Independent component analysis has been more attractive in the signal processing field. An independent component analysis method based on adaptive artificial bee colony algorithm is proposed in this paper, aiming at the problems of slow convergence and low computational precision in existing independent component analysis methods. The algorithm uses the Givens rotation to reduce the amount of variables to be solved. An adaptive global guidance item is introduced in searching strategy to dynamically adjust optimal guiding role. Simulation results show that the adaptive algorithm can separate the linear combinations of sub-Gaussian and super-Gaussian sources successfully and improve the accuracy of separation.

Keywords : Independent component analysis, Artificial bee colony, Adaptive, Search strategy.
Cite this article : Shi Zhang, Chao-Wei Bao and Hai-Bin Shen, " Independent component analysis based on adaptive artificial bee colony " , International Journal of Advanced Computer Research (IJACR), Volume-6, Issue-25, July-2016 ,pp.146-152.DOI:10.19101/IJACR.2016.625020
References :
[1]Lee TW. Independent component analysis. In independent component analysis 1998 (pp. 27-66). Springer.
[Google Scholar]
[2]Comon P, Jutten C, editors. Handbook of blind source separation: independent component analysis and applications. Academic press; 2010.
[Google Scholar]
[3]Liu JQ, Feng DZ, Zhang WW. Adaptive improved natural gradient algorithm for blind source separation. Neural Computation. 2009; 21(3):872-89.
[Crossref] [Google Scholar]
[4]Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, engineering faculty, computer engineering department; 2005.
[Google Scholar]
[5]Ebrahimzadeh A, Mavaddati S. A novel technique for blind source separation using bees colony algorithm and efficient cost functions. Swarm and Evolutionary Computation. 2014:15-20.
[Crossref] [Google Scholar]
[6]Karaboga D, Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization. 2007; 39(3):459-71.
[Crossref] [Google Scholar]
[7]Karaboga D, Basturk B. On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing. 2008; 8(1):687-97.
[Crossref] [Google Scholar]
[8]Mladenova CD, Mladenov IM, Todorov MD. About parametric representations of SO (n) matrices and plane rotations. In AIP conference proceedings-American institute of physics 2012 (pp. 280-7).
[Crossref] [Google Scholar]
[9]Wang J, Yao Y, Mao Y, Sheng B, Mi N. Fresh: fair and efficient slot configuration and scheduling for hadoop clusters. In IEEE 7th International conference on cloud computing 2014 (pp. 761-8). IEEE.
[Crossref] [Google Scholar]
[10]Bawa RK, Sharma G. Modified min-min heuristic for job scheduling based on QoS in grid environment. In international conference on information management in the knowledge economy (IMKE) 2013 (pp. 166-71). IEEE.
[Google Scholar]
[11]Chen H, Wang F, Helian N, Akanmu G. User-priority guided min-min scheduling algorithm for load balancing in cloud computing. In national conference on parallel computing technologies 2013 (pp. 1-8). IEEE.
[Crossref] [Google Scholar]
[12]Diaz CO, Pecero JE, Bouvry P. Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems. The Journal of Supercomputing. 2014; 67(3):837-53.
[Crossref] [Google Scholar]
[13]Huang SC, Jiau MK, Lin CH. A genetic-algorithm-based approach to solve carpool service problems in cloud computing. IEEE Transactions on Intelligent Transportation Systems. 2015; 16(1):352-64.
[Crossref] [Google Scholar]