TY - JOUR
T1 - An Unsupervised Model Based on Knowledge Graph and Concepts for Sentiment Analysis
AU - Mamani-Coaquira, Yonatan
AU - Villanueva, Edwin
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2025
Y1 - 2025
N2 - Sentiment analysis encompasses various fields such as psychology, marketing, and education, with social media serving as a key platform for gauging public opinion. Recently, graph-based methods have proven to be very useful in representing structured data. This study presents an unsupervised, graph knowledge approach to sentiment analysis that vectorizes nodes representing words and their conceptual connections. Using VADER (Valence Aware Dictionary and sentiment Reasoner) alongside conceptual words such as WordNet and ConceptNet, the method builds a graph of words based on sentiment polarity, capturing both co-occurrence and conceptual relationships. Additionally, a novel Polarity-biased Random Walk algorithm creates polarity-sensitive graph walks, which are vectorized using the Skip-Gram technique. The findings indicate that increasing walk length and the number of node walks, with a bias of 0.95 and employing ConceptNet or WordNet, enhances sentiment classification compared to models like Node2Vec, GraphSAGE, Graph Attention, and Graph Convolutional Networks. Lastly, embeddings generated from the IMDB dataset demonstrate superior accuracy in domain-specific tasks when compared to models such as Word2Vec, FastText, GloVe, and BERT.
AB - Sentiment analysis encompasses various fields such as psychology, marketing, and education, with social media serving as a key platform for gauging public opinion. Recently, graph-based methods have proven to be very useful in representing structured data. This study presents an unsupervised, graph knowledge approach to sentiment analysis that vectorizes nodes representing words and their conceptual connections. Using VADER (Valence Aware Dictionary and sentiment Reasoner) alongside conceptual words such as WordNet and ConceptNet, the method builds a graph of words based on sentiment polarity, capturing both co-occurrence and conceptual relationships. Additionally, a novel Polarity-biased Random Walk algorithm creates polarity-sensitive graph walks, which are vectorized using the Skip-Gram technique. The findings indicate that increasing walk length and the number of node walks, with a bias of 0.95 and employing ConceptNet or WordNet, enhances sentiment classification compared to models like Node2Vec, GraphSAGE, Graph Attention, and Graph Convolutional Networks. Lastly, embeddings generated from the IMDB dataset demonstrate superior accuracy in domain-specific tasks when compared to models such as Word2Vec, FastText, GloVe, and BERT.
KW - knowledge graph
KW - node embedding
KW - polarity classification
KW - sentiment analysis
KW - Word embedding
UR - https://www.scopus.com/pages/publications/105018045210
U2 - 10.1109/OJCS.2025.3616329
DO - 10.1109/OJCS.2025.3616329
M3 - Article
AN - SCOPUS:105018045210
SN - 2644-1268
VL - 6
SP - 1561
EP - 1574
JO - IEEE Open Journal of the Computer Society
JF - IEEE Open Journal of the Computer Society
ER -