Khubaib Amjad Alam

Dr. Khubaib Amjad Alam


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 December 2015 in Information Systems
Verified
Journal Article
Closed access
KAKhubaib Amjad Alam
Khubaib Amjad Alam
RARodina Ahmad
Rodina Ahmad
Adnan AkhunzadaAdnan Akhunzada
Adnan Akhunzada
MNMohd Hairul Nizam Md Nasir
Mohd Hairul Nizam Md Nasir
SKSamee U. Khan
Samee U. Khan

9 January 2023 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
MAMohsin Ahmed
Mohsin Ahmed
Saif Ur Rehman KhanSaif Ur Rehman Khan
Saif Ur Rehman Khan
KAKhubaib Amjad Alam
Khubaib Amjad Alam

12 August 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
Syed Manzar AbbasSyed Manzar Abbas
Syed Manzar Abbas
KAKhubaib Amjad Alam
Khubaib Amjad Alam
SSShahaboddin Shamshirband
Shahaboddin Shamshirband
Context-aware video recommender systems (CAVRS) seek to improve recommendation performance by incorporating contextual features along with the conventional user-item ratings used by video recommender systems. In addition, the selection of influential and relevant contexts has a significant effect on the performance of CAVRS. However, it is not guaranteed that, under the same contextual scenario, all the items are evaluated by users for providing dense contextual ratings. This problem cause contextual sparsity in CAVRS because the influence of each contextual factor in traditional CAVRS assumes the weights of contexts homogeneously for each of the recommendations. Hence, the selection of influencing contexts with minimal conflicts is identified as a potential research challenge. This study aims at resolving the contextual sparsity problem to leverage user interactions at varying contexts with an item in CAVRS. This problem may be investigated by considering a formal approximation of contextual attributes. For the purpose of improving the accuracy of recommendation process, we have proposed a novel contextual information selection process using Soft-Rough Sets. The proposed model will select a minimal set of influencing contexts using a weights assign process by Soft-Rough sets. Moreover, the proposed algorithm has been extensively evaluated using “LDOS-CoMoDa” dataset, and the outcome signifies the accuracy of our approach in handling contextual sparsity by exploiting relevant contextual factors. The proposed model outperforms existing solutions by identifying relevant contexts efficiently based on certainty, strength, and relevancy for effective recommendations.

27 April 2017 in IEEE Access
Verified
Journal Article
Open access
KAKhubaib Amjad Alam
Khubaib Amjad Alam
RARodina Ahmad
Rodina Ahmad
Kwang-Man KoKwang-Man Ko
Kwang-Man Ko
Far-edge analytics refers to the enablement of data mining algorithms in far-edge mobile devices that are part of mobile edge cloud computing (MECC) systems. Far-edge analytics enables data reduction in mobile environments, hence reducing the data transfer rate and bandwidth utilization cost for mobile-edge communication. In addition, far-edge analytics facilitates local knowledge availability to enable personalized mobile data stream mining applications. Existing literature mainly addresses classification and clustering problems in far-edge mobile devices, but the problem of frequent pattern mining (FPM) remains unexplored. This paper presents the results of an experimental study on the performance profiling of frequent pattern mining algorithms. We developed a real mobile application for performance analysis and profiling of 21 FPM algorithms with various real data sets in terms of execution time, storage complexity, sparsity, density, and data set size. According to the experimental results, large-sized data sets with high sparsity increase computational and storage cost in far-edge mobile devices. To address these issues, we propose a framework and discuss the relevant research challenges for seamless execution of FPM algorithms in MECC systems.

1 July 2019
Verified
Conference Paper
Open access
PDF file
PTPariwish Touseef
Pariwish Touseef
KAKhubaib Amjad Alam
Khubaib Amjad Alam
AJAbid Jamil
Abid Jamil
HTHamza Tauseef
Hamza Tauseef
SASahar Ajmal
Sahar Ajmal
SMSumaira Mustafa
Sumaira Mustafa

1 July 2020
Verified
Conference Paper
Closed access
Syed Manzar AbbasSyed Manzar Abbas
Syed Manzar Abbas
KAKhubaib Amjad Alam
Khubaib Amjad Alam
Kwang-Man KoKwang-Man Ko
Kwang-Man Ko
Context-aware recommender system (CARS) plays a vital role to paved way for improving traditional recommendation phenomena. A key issue in CARS is the selection of influencing contextual group which is most suitable for the recommendation of an item. In general, the selection of suitable contextual group in CARS is faced with challenges due to uncertainty in the classification of items with missing non-binary ratings. The underlying reaction of each user towards an item is implicitly assumed to be binary in nature because of which uncertainty occurs in the item classification. In particular, such a situation where ratings are missing for an item, make the exploitation of appropriate contextual group difficult for an item recommendation. In this article, we address the problem of the inappropriate classification of items into irrelevant contextual groups due to missing non-binary ratings. To this extent, we propose a three-way classification model using game-theoretic N-soft sets for improving the classification process by handling missing ratings. In particular, a game is formulated using game-theoretic N-soft sets to determine the effective threshold configuration used to induce three-way classification of items with missing non-binary ratings. Moreover, a thorough evaluation of our proposed model is carried out on the datasets of LDOS-CoMoDa and InCarMusic, where outcome signifies the effectiveness and performance of the proposed model.