Mirza Mohtashim Alam

Mirza Mohtashim Alam

Auto-generated profile, based on publicly available information

Mirza Mohtashim Alam

FIZ Karlsruhe, Karlsruhe, Germany

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
21 October 2023
Verified
Conference Paper
Open access
KMKarishma Mohiuddin
Karishma Mohiuddin
MAMirza Ariful Alam
Mirza Ariful Alam
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
PWPascal Welke
Pascal Welke
MMMichael Martin
Michael Martin
SVSahar Vahdati
Sahar Vahdati
Skilled employees are the most important pillars of an organization. Despite this, most organizations face high attrition and turnover rates. While several machine learning models have been developed to analyze attrition and its causal factors, the interpretations of those models remain opaque. In this paper, we propose the HR-DSS approach, which stands for Human Resource (HR) Decision Support System, and uses explainable AI for employee attrition problems. The system is designed to assist HR departments in interpreting the predictions provided by machine learning models. In our experiments, we employ eight machine learning models to provide predictions. We further process the results achieved by the best-performing model by the SHAP explainability process and use the SHAP values to generate natural language explanations which can be valuable for HR. Furthermore, using "What-if-analysis", we aim to observe plausible causes for attrition of an individual employee. The results show that by adjusting the specific dominant features of each individual, employee attrition can turn into employee retention through informative business decisions.

20 October 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MNMojtaba Nayyeri
Mojtaba Nayyeri
CXChengjin Xu
Chengjin Xu
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
JLJens Lehmann
Jens Lehmann
HYHamed Shariat Yazdi
Hamed Shariat Yazdi
Knowledge graph embedding models have gained significant attention in AI research. The aim of knowledge graph embedding is to embed the graphs into a vector space in which the structure of the graph is preserved. Recent works have shown that the inclusion of background knowledge, such as logical rules, can improve the performance of embeddings in downstream machine learning tasks. However, so far, most existing models do not allow the inclusion of rules. We address the challenge of including rules and present a new neural based embedding model (LogicENN). We prove that LogicENN can learn every ground truth of encoded rules in a knowledge graph. To the best of our knowledge, this has not been proved so far for the neural based family of embedding models. Moreover, we derive formulae for the inclusion of various rules, including (anti-)symmetric, inverse, irreflexive and transitive, implication, composition, equivalence and negation. Our formulation allows to avoid grounding for implication and equivalence relations. Our experiments show that LogicENN outperforms the existing models in link prediction.

18 July 2022 in IEEE Access
Verified
Journal Article
Open access
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
RRRashad Al Hasan Rony
Rashad Al Hasan Rony
MNMojtaba Nayyeri
Mojtaba Nayyeri
KMKarishma Mohiuddin
Karishma Mohiuddin
MAM. S. T. Mahfuja Akter
M. S. T. Mahfuja Akter
JLJens Lehmann
Jens Lehmann
Knowledge graph embedding models have become a popular approach for knowledge graph completion through predicting the plausibility of (potential) triples. This is performed by transforming the entities and relations of the knowledge graph into an embedding space. However, knowledge graphs often include further textual information stored in literal, which is ignored by such embedding models. As a consequence, the learning process stays limited to the structure and the connections between the entities, which has the potential to negatively influence the performance. We bridge this gap by leveraging the capabilities of pre-trained language models to include textual knowledge in the learning process of embedding models. This is achieved by introducing a new loss function that guides embedding models in measuring the likelihood of triples by taking such complementary knowledge into consideration. The proposed solution is a model-independent loss function that can be plugged into any knowledge graph embedding model. In this paper, Sentence-BERT and fastText are used as pre-trained language models from which the embeddings of the textual knowledge are obtained and injected into the loss function. The loss function contains a trainable slack variable that determines the degree to which the language models influence the plausibility of triples. Our experimental evaluation on six benchmarks, namely Nations, UMLS, WordNet, and three versions of CodEx confirms the advantage of using pre-trained language models for boosting the accuracy of knowledge graph embedding models. We showcase this by performing evaluations on top of the five well-known knowledge graph embedding models such as TransE, RotatE, ComplEx, DistMult, and QuatE. The results show an improvement in accuracy up to 9% on UMLS dataset for the Distmult model and 4.2% on the Nations dataset for the ComplEx model when they are guided by pre-trained language models. We additionally studied the effect of multiple factors such as the structure of the knowledge graphs and training steps and presented them as ablation studies.

2 November 2018
Verified
Book Chapter
Closed access
PDF file
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
KMKarishma Mohiuddin
Karishma Mohiuddin
KIKabirul Islam
Kabirul Islam
MHMehedi Hassan
Mehedi Hassan
AHArshad-Ul Hoque
Arshad-Ul Hoque
SAShaikh Muhammad Allayear
Shaikh Muhammad Allayear

27 October 2020 in IEEE Access
Verified
Journal Article
Open access
MNMojtaba Nayyeri
Mojtaba Nayyeri
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
JLJens Lehmann
Jens Lehmann
SVSahar Vahdati
Sahar Vahdati
Knowledge Graph Embeddings (KGE) are used for representation learning in Knowledge Graphs (KGs) by measuring the likelihood of a relation between nodes. Rotation-based approaches, specially axis-angle representations, were shown to improve the performance of many Machine Learning (ML)-based models in different tasks including link prediction. There is a perceived disconnect between the topics of KGE models and axis-angle rotation-based approaches. This is particuarly visible when considering the ability of KGEs to learn relational patterns such as symmetry, inversion, implication, equivalence, composition, and reflexivity considering axis-angle rotation-based approaches. In this article, we propose RodE , a new KGE model which employs an axis-angle representation for rotations based on Rodrigues’ formula. RodE inherits the main advantages of 3-dimensional rotation from angle, orientation and distance preservation in the embedding space. Thus, the model efficiently captures the similarity between the nodes in a graph in the vector space. Our experiments show that RodE outperforms state-of-the-art models on standard datasets.

16 August 2023 in arXiv
Verified
Preprint
Open access
PDF file
MNMojtaba Nayyeri
Mojtaba Nayyeri
ZWZihao Wang
Zihao Wang
MAMst. Mahfuja Akter
Mst. Mahfuja Akter
MAMirza Mohtashim Alam
Mirza Mohtashim Alam
RRRashad Al Hasan Rony
Rashad Al Hasan Rony
SSSteffen Staab
Steffen Staab
Knowledge Graphs, such as Wikidata, comprise structural and textual knowledge in order to represent knowledge. For each of the two modalities dedicated approaches for graph embedding and language models learn patterns that allow for predicting novel structural knowledge. Few approaches have integrated learning and inference with both modalities and these existing ones could only partially exploit the interaction of structural and textual knowledge. In our approach, we build on existing strong representations of single modalities and we use hypercomplex algebra to represent both, (i), single-modality embedding as well as, (ii), the interaction between different modalities and their complementary means of knowledge representation. More specifically, we suggest Dihedron and Quaternion representations of 4D hypercomplex numbers to integrate four modalities namely structural knowledge graph embedding, word-level representations (e.g.\ Word2vec, Fasttext), sentence-level representations (Sentence transformer), and document-level representations (sentence transformer, Doc2vec). Our unified vector representation scores the plausibility of labelled edges via Hamilton and Dihedron products, thus modeling pairwise interactions between different modalities. Extensive experimental evaluation on standard benchmark datasets shows the superiority of our two new models using abundant textual information besides sparse structural knowledge to enhance performance in link prediction tasks.