Navigating the Semantic Horizon using Relative Neighborhood Graphs

01/12/2015
by   Amaru Cuba Gyllensten, et al.
0

This paper is concerned with nearest neighbor search in distributional semantic models. A normal nearest neighbor search only returns a ranked list of neighbors, with no information about the structure or topology of the local neighborhood. This is a potentially serious shortcoming of the mode of querying a distributional semantic model, since a ranked list of neighbors may conflate several different senses. We argue that the topology of neighborhoods in semantic space provides important information about the different senses of terms, and that such topological structures can be used for word-sense induction. We also argue that the topology of the neighborhoods in semantic space can be used to determine the semantic horizon of a point, which we define as the set of neighbors that have a direct connection to the point. We introduce relative neighborhood graphs as method to uncover the topological properties of neighborhoods in semantic models. We also provide examples of relative neighborhood graphs for three well-known semantic models; the PMI model, the GloVe model, and the skipgram model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

Learning to Index for Nearest Neighbor Search

In this study, we present a novel ranking model based on learning the ne...
research
08/22/2022

Generalized Relative Neighborhood Graph (GRNG) for Similarity Search

Similarity search is a fundamental building block for information retrie...
research
12/07/2018

Local Distribution in Neighborhood for Classification

The k-nearest-neighbor method performs classification tasks for a query ...
research
10/12/2018

Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks

We consider network graphs G=(V,E) in which adjacent nodes share common ...
research
12/22/2017

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search

One of the approaches for the nearest neighbor search problem is to buil...
research
08/12/2021

Clustering with UMAP: Why and How Connectivity Matters

Topology based dimensionality reduction methods such as t-SNE and UMAP h...
research
12/07/2016

Extend natural neighbor: a novel classification method with self-adaptive neighborhood parameters in different stages

Various kinds of k-nearest neighbor (KNN) based classification methods a...

Please sign up or login with your details

Forgot password? Click here to reset