arXiv Analytics

Sign in

arXiv:1110.5847 [stat.ML]AbstractReferencesReviewsResources

Structural Similarity and Distance in Learning

Joseph Wang, Venkatesh Saligrama, David A. Castañón

Published 2011-10-26Version 1

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-rank representation can be kernelized, has a closed-form solution, allows for separation of independent manifolds, and is robust to noise. From this representation, similarity between observations based on non-linear structure is computed and can be incorporated into existing feature transformations, dimensionality reduction techniques, and machine learning methods. Experimental results on both synthetic and real data sets show performance improvements for clustering, and anomaly detection through the use of structural similarity.

Related articles: Most relevant | Search more
arXiv:1403.2877 [stat.ML] (Published 2014-03-12)
A survey of dimensionality reduction techniques
arXiv:2204.13916 [stat.ML] (Published 2022-04-29)
A study of tree-based methods and their combination
arXiv:0812.5087 [stat.ML] (Published 2008-12-30, updated 2010-10-20)
Estimating time-varying networks