Bassam Al-Salemi

Bassam Al-Salemi

Auto-generated profile, based on publicly available information

Bassam Al-Salemi

Universiti Kebangsaan Malaysia, Malaysia

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 January 2019 in Information Processing & Management
Verified
Journal Article
Closed access
BABassam Al-Salemi
Bassam Al-Salemi
MAMasri Ayob
Masri Ayob
GKGraham Kendall
Graham Kendall
SNShahrul Azman Mohd Noah
Shahrul Azman Mohd Noah

1 July 2016 in Knowledge-Based Systems
Verified
Journal Article
Closed access
BABassam Al-Salemi
Bassam Al-Salemi
SNShahrul Azman Mohd Noah
Shahrul Azman Mohd Noah
MAMohd Juzaiddin Ab Aziz
Mohd Juzaiddin Ab Aziz

1 December 2018 in Expert Systems with Applications
Verified
Journal Article
Closed access
BABassam Al-Salemi
Bassam Al-Salemi
MAMasri Ayob
Masri Ayob
SNShahrul Azman Mohd Noah
Shahrul Azman Mohd Noah

3 October 2014 in Journal of Information Science
Verified
Journal Article
Closed access
BABassam Al-Salemi
Bassam Al-Salemi
MAMohd. Juzaiddin Ab Aziz
Mohd. Juzaiddin Ab Aziz
SNShahrul Azman Mohd Noah
Shahrul Azman Mohd Noah
AdaBoost.MH is a boosting algorithm that is considered to be one of the most accurate algorithms for multilabel classification. It works by iteratively building a committee of weak hypotheses of decision stumps. To build the weak hypotheses, in each iteration, AdaBoost.MH obtains the whole extracted features and examines them one by one to check their ability to characterize the appropriate category. Using Bag-Of-Words for text representation dramatically increases the computational time of AdaBoost.MH learning, especially for large-scale datasets. In this paper we demonstrate how to improve the efficiency and effectiveness of AdaBoost.MH using latent topics, rather than words. A well-known probabilistic topic modelling method, Latent Dirichlet Allocation, is used to estimate the latent topics in the corpus as features for AdaBoost.MH. To evaluate LDA-AdaBoost.MH, the following four datasets have been used: Reuters-21578-ModApte, WebKB, 20-Newsgroups and a collection of Arabic news. The experimental results confirmed that representing the texts as a small number of latent topics, rather than a large number of words, significantly decreased the computational time of AdaBoost.MH learning and improved its performance for text categorization.

1 January 2011 in Journal of Computer Science
Verified
Journal Article
Open access
PDF file
ASAl- Salemi
Al- Salemi
BABassam Al-Salemi
Bassam Al-Salemi
MAMohd. Juzaiddin Ab Aziz
Mohd. Juzaiddin Ab Aziz
Problem statement: The rapid increasing of online Arabic documents necessitated applying Text Categorization techniques that are commonly used for English language to categorize them automatically. The complex morphology of Arabic language and its large vocabulary size make applying these techniques directly difficult and costly in time and effort. Approach: We have investigated Bayesian learning models in order to enhance Arabic ATC. Three classifiers based on Bayesian theorem had been implemented which are Simple Naïve Bayes (NB), Multi-variant Bernoulli Naïve Bayes (MBNB) and Multinomial Naïve Bayes (MNB) models. TREC-2002 Light Stemmer was applied for Arabic stemming. For text representation, Bag-Of-Word and character-level n-gram with the length 3, 4 and 5 are used. In order to reduce the dimensionality of feature space, the following feature selection methods: Mutual Information, Chi-Square statistic, Odds Ratio and GSS-coefficient were used. Conclusion: MBNB classifier outperformed both of NB and MNB classifiers. BOW representation leads to the best classification performance; nevertheless, using character-level n-gram leads to satisfying results for Arabic ATC based on Bayesian learning. Moreover, the use of feature selection methods dramatically increases the categorization performance.

30 June 2015 in Journal of Information Science
Verified
Journal Article
Closed access
BABassam Al-Salemi
Bassam Al-Salemi
MAMohd. Juzaiddin Ab Aziz
Mohd. Juzaiddin Ab Aziz
SNShahrul Azman Mohd Noah
Shahrul Azman Mohd Noah
Boosting algorithms have received significant attention over the past several years and are considered to be the state-of-the-art classifiers for multi-label classification tasks. The disadvantage of using boosting algorithms for text categorization (TC) is the vast number of features that are generated using the traditional Bag-of-Words (BOW) text representation, which dramatically increases the computational complexity. In this paper, an alternative text representation method using topic modeling for enhancing and accelerating multi-label boosting algorithms is concerned. An extensive empirical experimental comparison of eight multi-label boosting algorithms using topic-based and BOW representation methods was undertaken. For the evaluation, three well-known multi-label TC datasets were used. Furthermore, to justify boosting algorithms performance, three well-known instance-based multi-label algorithms were involved in the evaluation. For completely credible evaluations, all algorithms were evaluated using their native software tools, except for data formats and user settings. The experimental results demonstrated that the topic-based representation significantly accelerated all algorithms and slightly enhanced the classification performance, especially for near-balanced and balanced datasets. For the imbalanced dataset, BOW representation led to the best performance. The MP-Boost algorithm is the most efficient and effective algorithm for imbalanced datasets using BOW representation. For topic-based representation, AdaBoost.MH with meta base learners, Hamming Tree (AdaMH-Tree) and Product (AdaMH-Product) achieved the best performance; however, with respect to the computational time, these algorithms are the slowest overall. Moreover, the results indicated that topic-based representation is more significant for instance-based algorithms; nevertheless, boosting algorithms, such as MP-Boost, AdaMH-Tree and AdaMH-Product, notably exceed their performance.