Hossein Ghomeshi

Hossein Ghomeshi

Auto-generated profile, based on publicly available information

Hossein Ghomeshi

Birmingham City University

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
13 February 2019 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
HGHossein Ghomeshi
Hossein Ghomeshi
MGMohamed Gaber
Mohamed Gaber
YKYevgeniya Kovalchuk
Yevgeniya Kovalchuk
This paper presents a novel ensemble learning method based on evolutionary algorithms to cope with different types of concept drifts in non-stationary data stream classification tasks. In ensemble learning, multiple learners forming an ensemble are trained to obtain a better predictive performance compared to that of a single learner, especially in non-stationary environments, where data evolve over time. The evolution of data streams can be viewed as a problem of changing environment, and evolutionary algorithms offer a natural solution to this problem. The method proposed in this paper uses random subspaces of features from a pool of features to create different classification types in the ensemble. Each such type consists of a limited number of classifiers (decision trees) that have been built at different times over the data stream. An evolutionary algorithm (replicator dynamics) is used to adapt to different concept drifts; it allows the types with a higher performance to increase and those with a lower performance to decrease in size. Genetic algorithm is then applied to build a two-layer architecture based on the proposed technique to dynamically optimise the combination of features in each type to achieve a better adaptation to new concepts. The proposed method, called EACD, offers both implicit and explicit mechanisms to deal with concept drifts. A set of experiments employing four artificial and five real-world data streams is conducted to compare its performance with that of the state-of-the-art algorithms using the immediate and delayed prequential evaluation methods. The results demonstrate favourable performance of the proposed EACD method in different environments.

1 January 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
HGHossein Ghomeshi
Hossein Ghomeshi
MGMohamed Gaber
Mohamed Gaber
YKYevgeniya Kovalchuk
Yevgeniya Kovalchuk

29 July 2018
Verified
Book Chapter
Closed access
PDF file
HGHossein Ghomeshi
Hossein Ghomeshi
MGMohamed Gaber
Mohamed Gaber
YKYevgeniya Kovalchuk
Yevgeniya Kovalchuk

21 November 2019 in IEEE Access
Verified
Journal Article
Open access
HGHossein Ghomeshi
Hossein Ghomeshi
MGMohamed Gaber
Mohamed Gaber
YKYevgeniya Kovalchuk
Yevgeniya Kovalchuk
The extensive growth of digital technologies such as the Internet of Things (IoT), social media networks and forecasting systems has led to new challenges regarding computational complexity and big data mining. The classification task in such applications is not trivial due to the high volume of related data and limited time available for the task. It is particularly difficult when dealing with data streams, where each instance of data is typically processed once on its arrival (i.e. online) while the underlying data distribution often changes due to the changing environment. In this paper, we propose a novel ensemble-based framework called Replicator Dynamics & Genetic Algorithms Approach (RED-GENE) for effective data stream classification in the context of changing environment leading to concept drifts (i.e. evolution of data streams). RED-GENE employs three novel Replicator Dynamics (RD) strategies along with a Genetic Algorithm (GA) optimisation technique to flexibly adapt to different types of concept drifts when performing data stream classification tasks. The proposed framework works as follows. First, a set of random feature combinations is drawn from a given pool of features of the target data stream to create different classification types. Next, RD is used to allow the classification types achieving higher classification accuracy to grow and those with lower accuracy to shrink. A modified version of the classic GA is then employed to optimise the randomly drawn combinations of features in each classification type. The proposed framework was tested using nine data streams (including both real-world and synthetic datasets) to investigate different variations of the proposed framework and compare its performance to other state-of-the-art algorithms using immediate and delayed prequential evaluation methods. The results demonstrated that the proposed framework can provide the best accuracy on average when comparing to five other state-of-the-art algorithms.