2020
DOI: 10.1007/s13042-020-01221-4
|View full text |Cite
|
Sign up to set email alerts
|

Knowledge-driven graph similarity for text classification

Abstract: Automatic text classification using machine learning is significantly affected by the text representation model. The structural information in text is necessary for natural language understanding, which is usually ignored in vector-based representations. In this paper, we present a graph kernel-based text classification framework which utilises the structural information in text effectively through the weighting and enrichment of a graph-based representation. We introduce weighted co-occurrence graphs to repre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 29 publications
1
7
0
Order By: Relevance
“…On the other hand, phrases such as the right, the room, this picture, and this mini lab, which refer to a particular situation, belong to the Context sensitive class label. This observation is in line with the importance of semantic similarity in knowledge-driven graphs for text classification applications beyond domain-agnostic class labels such as sentiment analysis that is based on sentence polarity [184]. Nevertheless, it is worth noting that all four graphs are required for good classification performance due to the advantages of each dimension.…”
Section: Ablation Testsupporting
confidence: 66%
“…On the other hand, phrases such as the right, the room, this picture, and this mini lab, which refer to a particular situation, belong to the Context sensitive class label. This observation is in line with the importance of semantic similarity in knowledge-driven graphs for text classification applications beyond domain-agnostic class labels such as sentiment analysis that is based on sentence polarity [184]. Nevertheless, it is worth noting that all four graphs are required for good classification performance due to the advantages of each dimension.…”
Section: Ablation Testsupporting
confidence: 66%
“…According to the literature, a lot of work is done on semantic analysis in biomedical text, which offers great potential for identifying semantic relationships between biomedical entities, terms, and terminologies [52,53]. Semantic analysis in the biomedical domain employs multiple NLP tasks, including WSD [54], clustering [55], ontology learning [56], information retrieval [33], text classification [57], question answering [39,41,42], text Summarization [58], topic detection [58], and many others. Extracting semantic similarity implies determining and quantifying the contextual relationship between concepts based on shared features.…”
Section: Semantic Enrichment Approachesmentioning
confidence: 99%
“…The first one aims to find a motif between possibly two different-sized graphs (in terms of nodes and edges) to deduct a result, e.g., a deduction that both graphs have similar network dynamics. Here, a recent work in this area is worth mentioning 12 . It employed graph theory techniques for text classification.…”
Section: Machine Learning and Network Graphsmentioning
confidence: 99%
“…It employed graph theory techniques for text classification. In 12 , NLP researchers first convert sentences into adjacency matrices based on the co-occurrence of words, and then to graphs. The process then efficiently predicts word similarities by employing graph similarity techniques.…”
Section: Machine Learning and Network Graphsmentioning
confidence: 99%