Nasrin Shabani

Mrs. Nasrin Shabani

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
8 January 2024 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
NSNasrin Shabani
Nasrin Shabani
Jia WUJia WU
Jia WU
ABAmin Beheshti
Amin Beheshti
Michael ShengMichael Sheng
Michael Sheng
JFJin Foo
Jin Foo
MSMaryam Shahabikargar
Maryam Shahabikargar
As large-scale graphs become more widespread, more and more computational challenges with extracting, processing, and interpreting large graph data are being exposed. It is therefore natural to search for ways to summarize these expansive graphs while preserving their key characteristics. In the past, most graph summarization techniques sought to capture the most important part of a graph statistically. However, today, the high dimensionality and complexity of modern graph data are making deep learning techniques more popular. Hence, this paper presents a comprehensive survey of progress in deep learning summarization techniques that rely on graph neural networks (GNNs). Our investigation includes a review of the current state-of-the-art approaches, including recurrent GNNs, convolutional GNNs, graph autoencoders, and graph attention networks. A new burgeoning line of research is also discussed where graph reinforcement learning is being used to evaluate and improve the quality of graph summaries. Additionally, the survey provides details of benchmark datasets, evaluation metrics, and open-source tools that are often employed in experimentation settings, along with a detailed comparison, discussion, and takeaways for the research community focused on graph summarization. Finally, the survey concludes with a number of open research challenges to motivate further study in this area.

20 March 2023 in AppliedMath
Verified
Journal Article
Open access
PDF file
NSNasrin Shabani
Nasrin Shabani
ABAmin Beheshti
Amin Beheshti
HFHelia Farhood
Helia Farhood
MBMatt Bower
Matt Bower
MGMichael Garrett
Michael Garrett
HRHamid Rokny
Hamid Rokny
Numerous studies have established a correlation between creativity and intrinsic motivation to learn, with creativity defined as the process of generating original and valuable ideas, often by integrating perspectives from different fields. The field of educational technology has shown a growing interest in leveraging technology to promote creativity in the classroom, with several studies demonstrating the positive impact of creativity on learning outcomes. However, mining creative thinking patterns from educational data remains a challenging task, even with the proliferation of research on adaptive technology for education. This paper presents an initial effort towards formalizing educational knowledge by developing a domain-specific Knowledge Base that identifies key concepts, facts, and assumptions essential for identifying creativity patterns. Our proposed pipeline involves modeling raw educational data, such as assessments and class activities, as a graph to facilitate the contextualization of knowledge. We then leverage a rule-based approach to enable the mining of creative thinking patterns from the contextualized data and knowledge graph. To validate our approach, we evaluate it on real-world datasets and demonstrate how the proposed pipeline can enable instructors to gain insights into students’ creative thinking patterns from their activities and assessment tasks.

23 January 2025 in Neurocomputing
Verified
Journal Article
Open access
MNMaryam Khanian Najafabadi
Maryam Khanian Najafabadi
RCRei-An Chen
Rei-An Chen
JRJavad Rezazadeh
Javad Rezazadeh
ABAmin Beheshti
Amin Beheshti
NSNasrin Shabani
Nasrin Shabani

21 April 2025 in Algorithms
Verified
Journal Article
Open access
PDF file
MSMaryam Shahabikargar
Maryam Shahabikargar
ABAmin Beheshti
Amin Beheshti
WMWathiq Mansoor
Wathiq Mansoor
XZXuyun Zhang
Xuyun Zhang
EFEu Jin Foo
Eu Jin Foo
NSNasrin Shabani
Nasrin Shabani
Customers are the cornerstone of business success across industries. Companies invest significant resources in acquiring new customers and, more importantly, retaining existing ones. However, customer churn remains a major challenge, leading to substantial financial losses. Addressing this issue requires a deep understanding of customers’ cognitive status and behaviours, as well as early signs of churn. Predictive and Machine Learning (ML)-based analysis, when trained with appropriate features indicative of customer behaviour and cognitive status, can be highly effective in mitigating churn. A robust ML-driven churn analysis depends on a well-developed feature engineering process. Traditional churn analysis studies have primarily relied on demographic, product usage, and revenue-based features, overlooking the valuable insights embedded in customer–company interactions. Recognizing the importance of domain knowledge and human expertise in feature engineering and building on our previous work, we propose the Customer Churn-related Knowledge Base (ChurnKB) to enhance feature engineering for churn prediction. ChurnKB utilizes textual data mining techniques such as Term Frequency-Inverse Document Frequency (TF-IDF), cosine similarity, regular expressions, word tokenization, and stemming to identify churn-related features within customer-generated content, including emails. To further enrich the structure of ChurnKB, we integrate Generative AI, specifically large language models, which offer flexibility in handling unstructured text and uncovering latent features, to identify and refine features related to customer cognitive status, emotions, and behaviours. Additionally, feedback loops are incorporated to validate and enhance the effectiveness of ChurnKB.Integrating knowledge-based features into machine learning models (e.g., Random Forest, Logistic Regression, Multilayer Perceptron, and XGBoost) improves predictive performance of ML models compared to the baseline, with XGBoost’s F1 score increasing from 0.5752 to 0.7891. Beyond churn prediction, this approach potentially supports applications like personalized marketing, cyberbullying detection, hate speech identification, and mental health monitoring, demonstrating its broader impact on business intelligence and online safety.


12 November 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MNMaryam Khanian Najafabadi
Maryam Khanian Najafabadi
TKThoon Zar Chi Ko
Thoon Zar Chi Ko
Saman Shojae ChaeikarSaman Shojae Chaeikar
Saman Shojae Chaeikar
NSNasrin Shabani
Nasrin Shabani
Sarcasm detection in text poses significant challenges for traditional sentiment analysis, as it often requires an understanding of context, word meanings, and emotional undertones. For example, in the sentence “I totally love working on Christmas holiday”, detecting sarcasm depends on capturing the contrast between affective words and their context. Existing methods often focus on single-embedding levels, such as word-level or affective-level, neglecting the importance of multi-level context. In this paper, we propose SAWE (Sentence, Affect, and Word Embeddings), a framework that combines sentence-level, affect-level, and context-dependent word embeddings to improve sarcasm detection. We use pre-trained transformer models SBERT and RoBERTa, enhanced with a bidirectional GRU and self-attention, alongside SenticNet to extract affective words. The combined embeddings are processed through a CNN and classified using a multilayer perceptron (MLP). SAWE is evaluated on two benchmark datasets, Sarcasm Corpus V2 (SV2) and Self-Annotated Reddit Corpus 2.0 (SARC 2.0), outperforming previous methods, particularly on long texts, with a 4.2% improvement on F1-Score for SV2. Our results emphasize the importance of multi-level embeddings and contextual information in detecting sarcasm, demonstrating a new direction for future research.