Pith. sign in

REVIEW 1 cited by

Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.14914 v2 pith:NUPTW5GM submitted 2020-04-30 cs.CL

classification cs.CL
keywords modelstopicclusteringembeddingswordapproachcombinationdocument
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Topic models are a useful analysis tool to uncover the underlying themes within document collections. The dominant approach is to use probabilistic topic models that posit a generative story, but in this paper we propose an alternative way to obtain topics: clustering pre-trained word embeddings while incorporating document information for weighted clustering and reranking top words. We provide benchmarks for the combination of different word embeddings and clustering algorithms, and analyse their performance under dimensionality reduction with PCA. The best performing combination for our approach performs as well as classical topic models, but with lower runtime and computational complexity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A document clustering pipeline that builds a named-entity similarity graph, then runs graph convolutional clustering on LLM embeddings, outperforms co-occurrence and KNN graph baselines in the paper's experiments.

Pith tools