Different Similarity Graphs (or Connectivity Graphs)
To construct a similarity graph we transform a given set x1,...,x n of data points with pairwise similarities s ij or distances d ij into a graph. There are several popular methods to construct similarity graphs [154]. The goal of constructing similarity graphs is to model the local neighborhood relationships between data points. In this section we review two popular methods to construct a similarity graph, and then we introduce a new algorithm that solves some problems that can not be solved by the others.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Barbakh, W.A., Wu, Y., Fyfe, C. (2009). Connectivity Graphs and Clustering with Similarity Functions. In: Non-Standard Parameter Adaptation for Exploratory Data Analysis. Studies in Computational Intelligence, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04005-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-04005-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04004-7
Online ISBN: 978-3-642-04005-4
eBook Packages: EngineeringEngineering (R0)