Omid Tarkhaneh

Dr. Omid Tarkhaneh


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 December 2019 in Expert Systems with Applications
Verified
Journal Article
Closed access
OTOmid Tarkhaneh
Omid Tarkhaneh
HSHaifeng Shen
Haifeng Shen

1 April 2019 in Heliyon
Verified
Journal Article
Open access
OTOmid Tarkhaneh
Omid Tarkhaneh
HSHaifeng Shen
Haifeng Shen
Artificial Neural networks (ANNs) are often applied to data classification problems. However, training ANNs remains a challenging task due to the large and high dimensional nature of search space particularly in the process of fine-tuning the best set of control parameters in terms of weight and bias. Evolutionary algorithms are proved to be a reliable optimization method for training the parameters. While a number of conventional training algorithms have been proposed and applied to various applications, most of them share the common disadvantages of local optima stagnation and slow convergence. In this paper, we propose a new evolutionary training algorithm referred to as LPSONS, which combines the velocity operators in Particle Swarm Optimization (PSO) with Mantegna Lévy distribution to produce more diverse solutions by dividing the population and generation between different sections of the algorithm. It further combines Neighborhood Search with Mantegna Lévy distribution to mitigate premature convergence and avoid local minima. The proposed algorithm can find optimal results and at the same time avoid stagnation in local optimum solutions as well as prevent premature convergence in training Feedforward Multi-Layer Perceptron (MLP) ANNs. Experiments with fourteen standard datasets from UCI machine learning repository confirm that the LPSONS algorithm significantly outperforms a gradient-based approach as well as some well-known evolutionary algorithms that are also based on enhancing PSO.

1 January 2018 in International Journal of Computer Applications in Technology
Verified
Journal Article
Closed access
OTOmid Tarkhaneh
Omid Tarkhaneh
AIAyaz Isazadeh
Ayaz Isazadeh
HKHossein Jabbari Khamnei
Hossein Jabbari Khamnei
Data clustering is one of the data mining techniques which is widely used in some applications, such as pattern recognition, machine learning, image processing, etc. Swarm intelligence-based algorithms are extensively used in data clustering in recent years. Cuckoo Search (CS) is one of the recently proposed algorithms in the category of swarm intelligence-based techniques. In this paper, a new hybrid algorithm which utilises CS, Particle Swarm Optimisation (PSO) and k-means has been proposed (HCSPSO). The proposed algorithm employed PSO and k-means to produce new nests in standard CS to obtain better results. It also benefits from Mantegna levy distribution to obtain higher convergence speed as well as local search. To eliminate the problem of the high number of functional evaluations in standard CS, a fraction of nests has assigned to every section of the algorithm. The proposed algorithm's performance was evaluated by ten standard benchmark datasets. Evaluation results show that the proposed algorithm is an efficient method for data clustering and produces more optimised results in comparison with standard CS, PSO, Elephant Search Algorithm (ESA), Enhanced Bat Algorithm (EBA), Bird Flock Gravitational Search Algorithm (BFGSA), Improved Cuckoo Search (ICS) and k-means.