Graph-Convolutional Networks: Named Entity Recognition and Large Language Model Embedding in Document Clustering

Imed Keraghel, Mohamed Nadif
12/19/2024
cs.CL

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Recent advances in machine learning, particularly Large Language Models (LLMs) such as BERT and GPT, provide rich contextual embeddings that improve text representation. However, current document clustering approaches often ignore the deeper relationships between named entities (NEs) and the potential of LLM embeddings. This paper proposes a novel approach that integrates Named Entity Recognition (NER) and LLM embeddings within a graph-based framework for document clustering. The method builds a graph with nodes representing documents and edges weighted by named entity similarity, optimized using a graph-convolutional network (GCN). This ensures a more effective grouping of semantically related documents. Experimental results indicate that our approach outperforms conventional co-occurrence-based methods in clustering, notably for documents rich in named entities.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{keraghel2024graphconvolutional,
  title  = {Graph-Convolutional Networks: Named Entity Recognition and Large Language Model Embedding in Document Clustering},
  author = {Imed Keraghel and Mohamed Nadif},
  year   = {2024},
  eprint = {2412.14867},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.14867v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.14867.svg)](https://codeofpaper.com/paper/2412.14867)

Discussion