search

xgfs / verse

Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
http://tsitsul.in/publications/verse/
MIT License
128 stars 22 forks source link

question on embeddings #3

Closed jwijffels closed 6 years ago

jwijffels commented 6 years ago

I'm trying to find out what I can do with the embeddings. Would it make sense to build a graph where sentences are nodes and edges between these nodes exist if some words are overlapping and next use verse to obtain sentence embeddings? Or is this a stupid idea?

xgfs commented 6 years ago

Probably there are better methods for sentence classification that utilize more information about words, but graphs can be used effectively for unsupervised exploration. We outline an opportunity to use embeddings for clustering with simple k-means in the paper.

jwijffels commented 6 years ago

Ok. Thanks for the input.