Helena Bahrami

Dr. Helena Bahrami

Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand
orcid
AI and Machine Learning Lead Expert

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2013 in Applied Soft Computing
Verified
Journal Article
Closed access
MAMarjan Abdechiri
Marjan Abdechiri
MMMohammad Reza Meybodi
Mohammad Reza Meybodi
Helena BahramiHelena Bahrami
Helena Bahrami

1 December 2021 in Neural Networks
Verified
Journal Article
Closed access
Maryam DoborjehMaryam Doborjeh
Maryam Doborjeh
ZDZohreh Doborjeh
Zohreh Doborjeh
AMAlexander Merkin
Alexander Merkin
Helena BahramiHelena Bahrami
Helena Bahrami
ASAlexander Sumich
Alexander Sumich
NKNikola Kasabov
Nikola Kasabov

1 January 2010
Verified
Conference Paper
Closed access
Helena BahramiHelena Bahrami
Helena Bahrami
Karim FaezKarim Faez
Karim Faez
MAMarjan Abdechiri
Marjan Abdechiri
The Imperialist Competitive Algorithm (ICA) that was recently introduced has shown its good performance in optimization problems. This novel optimization algorithm is inspired by socio-political process of imperialistic competition in the real world. In this paper a new Imperialist Competitive Algorithm using chaotic maps (CICA) is proposed. In the proposed algorithm, the chaotic maps are used to adapt the angle of colonies movement towards imperialist's position to enhance the escaping capability from a local optima trap. The ICA is easily stuck into a local optimum when solving high-dimensional multi-model numerical optimization problems. To overcome this shortcoming, we use four different chaotic map incorporated into ICA to enhance the exploration capability. Some famous unconstraint benchmark functions are used to test the CICA performance. Simulation results show this variant can improve the performance significantly.

1 May 2010
Verified
Conference Paper
Closed access
MAMarjan Abdechiri
Marjan Abdechiri
Karim FaezKarim Faez
Karim Faez
Helena BahramiHelena Bahrami
Helena Bahrami
Imperialist Competitive Algorithm (ICA) is a novel optimization algorithm that inspired by socio-political process of imperialistic competition. ICA shown its excellent capability in diverse optimization tasks. In this paper, a new method for training an Artificial Neural Network using Chaotic Imperialist Competitive Algorithm is proposed. In Chaotic Imperialist Competitive Algorithm (CICA) the chaos theory has been used to adjust the movement angle of colonies towards the imperialists. Using Chaotic Imperialist Competitive Algorithm (CICA), the weights of the Neural Network in its training phase are updated. In this paper, a multi layer Perceptron Neural Network used for prediction of the maximum worth of the stocks change in Tehran's Bourse Market. We trained this Neural Network with CICA, ICA, PSO and GA algorithms and compared the experimental results obtained from these four methods. The consideration of results showed that the training and test error of the network trained by CICA algorithm has been reduced in comparison to the other three methods. However, the run time of the proposed algorithm in training the neural network is less than PSO and GA algorithm it is a little more than ICA algorithm.

1 July 2010
Verified
Conference Paper
Closed access
MAMarjan Abdechiri
Marjan Abdechiri
Karim FaezKarim Faez
Karim Faez
Helena BahramiHelena Bahrami
Helena Bahrami
The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by sociopolitical process of imperialistic competition of human being in the real world. In this paper, a new Adaptive Imperialist Competitive Algorithm (AICA) is proposed. In the proposed algorithm, for an effective search, the Absorption Policy changed dynamically to adapt the angle of colonies movement towards imperialist's position. The ICA is easily stuck into a local optimum when solving high-dimensional multi-model numerical optimization problems. To overcome this shortcoming, we use probabilistic model that utilize the information of colonies positions to balance the exploration and exploitation abilities of the imperialistic competitive algorithm. Using this mechanism, ICA exploration capability will enhance. Some famous unconstraint benchmark functions used to test the AICA performance. Also, we use the AICA Algorithm to adjust the weights of a three-layered Perceptron neural network to predict the maximum worth of the stocks change in Tehran's Bourse Market. Simulation results show this strategy can improve the performance of the ICA algorithm significantly.

9 March 2012 in International Journal of Intelligent Systems and Applications
Verified
Journal Article
Open access
PDF file
Helena BahramiHelena Bahrami
Helena Bahrami
MAMarjan Abdechiri
Marjan Abdechiri
MMMohammad Reza Meybodi
Mohammad Reza Meybodi
The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by socio-political process of imperialistic competition of human being in the real world. In this paper, a new Imperialist Competitive Algorithm with Adaptive Radius of Colonies movement (ICAR) is proposed. In the proposed algorithm, for an effective search, the Absorption Policy changed dynamically to adapt the radius of colonies movement towards imperialist's position. The ICA is easily stuck into a local optimum when solves high-dimensional multi-modal numerical optimization problems. To overcome this shortcoming, we use probabilistic model that utilize the information of colonies positions to balance the exploration and exploitation abilities of the Imperialist Competitive Algorithm. Using this mechanism, ICA exploration capability will enhance. Some famous unconstraint benchmark functions used to test the ICAR performance. Simulation results show this strategy can improve the performance of the ICA algorithm significantly.