TY - GEN
T1 - Unveiling Smoking Behavior Dynamics Through Graph Neural Network Analysis
AU - Deepak, Goutham
AU - Lavankumar, R.
AU - Muralidharan, C.
AU - Aralikatti, Shivam Anand
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
PY - 2025
Y1 - 2025
N2 - This research work presents a novel approach for detecting and classifying text related to smoking, leveraging Natural Language Processing (NLP) and Graph Neural Networks (GNNs). In this method, we innovatively differentiate between texts that promote smoking and those that either advice against smoking or merely contain related keywords without intent to discuss the act or consequences of smoking. Our methodology integrates various text preprocessing methods, Latent Dirichlet Allocation (LDA) for topic modeling, and graph theory to construct a relational representation of textual data. The LDA model identifies thematic structures within a dataset of 480 texts, which is further encapsulated into a graph structure, with nodes representing individual documents and edges weighted by TF-IDF-based cosine similarity scores. This graph serves as the backbone for a GNN that learns to classify the textual data effectively. Our system demonstrates a high degree of precision in identifying smoking-related content. By bridging the gap between traditional text classification and contemporary graph-based learning, our approach paves the way for novel applications in thematic text analysis.
AB - This research work presents a novel approach for detecting and classifying text related to smoking, leveraging Natural Language Processing (NLP) and Graph Neural Networks (GNNs). In this method, we innovatively differentiate between texts that promote smoking and those that either advice against smoking or merely contain related keywords without intent to discuss the act or consequences of smoking. Our methodology integrates various text preprocessing methods, Latent Dirichlet Allocation (LDA) for topic modeling, and graph theory to construct a relational representation of textual data. The LDA model identifies thematic structures within a dataset of 480 texts, which is further encapsulated into a graph structure, with nodes representing individual documents and edges weighted by TF-IDF-based cosine similarity scores. This graph serves as the backbone for a GNN that learns to classify the textual data effectively. Our system demonstrates a high degree of precision in identifying smoking-related content. By bridging the gap between traditional text classification and contemporary graph-based learning, our approach paves the way for novel applications in thematic text analysis.
UR - https://www.scopus.com/pages/publications/105006882092
UR - https://www.scopus.com/pages/publications/105006882092#tab=citedBy
U2 - 10.1007/978-981-96-0924-6_44
DO - 10.1007/978-981-96-0924-6_44
M3 - Conference contribution
AN - SCOPUS:105006882092
SN - 9789819609239
T3 - Lecture Notes in Networks and Systems
SP - 559
EP - 571
BT - Soft Computing and Signal Processing - Proceedings of 7th ICSCSP 2024
A2 - Reddy, V. Sivakumar
A2 - Wang, Jiacun
A2 - Chetti, Prasad
A2 - Reddy, K.T.V.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 7th International Conference on Soft Computing and Signal Processing, ICSCSP 2024
Y2 - 20 June 2024 through 21 June 2024
ER -