Parameter Free Hierarchical Graph-Based Clustering for Analyzing Continuous Word Embeddings
Word embeddings are high-dimensional vector representations of words and are thus difficult to interpret. In order to deal with this, we introduce an unsupervised parameter free method for creating a hierarchical graphical clustering of the full ensemble of word vectors and show that this structure is a geometrically meaningful representation of the original relations between the words. This newly obtained representation can be used for better understanding and thus improving the embedding algorithm and exhibits semantic meaning, so it can also be utilized in a variety of language processing tasks like categorization or measuring similarity.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDimensionality ReductionWord EmbeddingsSimilar Papers 제목 키워드 기반
Graphons, mergeons, and so on!
In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large n…
ClusteringGraph ClusteringMatrix Completion with Hierarchical Graph Side Information
We consider a matrix completion problem that exploits social or item similarity graphs as side information. We develop a universal, parameter-free, and computationally efficient algorithm that starts with hierarchical gr…
ClusteringGraph ClusteringMatrix CompletionStochastic Block ModelParameter Free Clustering with Cluster Catch Digraphs (Technical Report)
We propose clustering algorithms based on a recently developed geometric digraph family called cluster catch digraphs (CCDs). These digraphs are used to devise clustering methods that are hybrids of density-based and gra…
ClusteringHierarchical clustering with maximum density paths and mixture models
Hierarchical clustering is an effective, interpretable method for analyzing structure in data. It reveals insights at multiple scales without requiring a predefined number of clusters and captures nested patterns and sub…
ClusteringDensity EstimationFrom data to concepts via wiring diagrams
A wiring diagram is a labeled directed graph that represents an abstract concept such as a temporal process. In this article, we introduce the notion of a quasi-skeleton wiring diagram graph, and prove that quasi-skeleto…
Reinforcement Learning