Finding similarity between unstructured data objects on the basis of the method of singular decomposition of the spectrum of a graph

Abstract

Finding similarity between unstructured data objects on the basis of the method of singular decomposition of the spectrum of a graph

Miziukov G.S.

Incoming article date: 26.12.2017

The article considers the question of finding similarity between objects containing unstructured information based on the spectra of two objects. To find the spectrum, we use the adjacency matrix of the graph. The similarity between objects of comparison is determined using the approach based on the singular expansion of the graph contiguity matrices. Also in the article the existing solutions are considered and examples are given of the areas of possible application of the described approach

Keywords: spectrum of the graph, singular decomposition, adjacency matrix, unstructured information, analysis of large arrays of information