Similarity search over graphs using localized spectral analysis

Yariv Aizenbud, Amir Averbuch, Gil Shabat, Guy Ziv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper provides a new similarity detection algorithm. Given an input set of multi-dimensional data points1 and an additional reference data point for similarity finding, the algorithm uses kernel method that embeds the data points into a low dimensional manifold. Unlike other kernel methods, which considers the entire data for the embedding, our method selects a specific set of kernel eigenvectors. The eigenvectors are chosen to separate between the data points and the reference data point so that similar data points can be easily identified as being distinct from most of the members in the dataset.

Original languageEnglish
Title of host publication2017 12th International Conference on Sampling Theory and Applications, SampTA 2017
EditorsGholamreza Anbarjafari, Andi Kivinukk, Gert Tamberg
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages635-638
Number of pages4
ISBN (Electronic)9781538615652
DOIs
StatePublished - 1 Sep 2017
Event12th International Conference on Sampling Theory and Applications, SampTA 2017 - Tallinn, Estonia
Duration: 3 Jul 20177 Jul 2017

Publication series

Name2017 12th International Conference on Sampling Theory and Applications, SampTA 2017

Conference

Conference12th International Conference on Sampling Theory and Applications, SampTA 2017
Country/TerritoryEstonia
CityTallinn
Period3/07/177/07/17

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Statistics, Probability and Uncertainty
  • Analysis
  • Statistics and Probability
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Similarity search over graphs using localized spectral analysis'. Together they form a unique fingerprint.

Cite this