Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
KNN Graphs & Interconnectivity
- k-nearest graphs from an original data in 2D:

- EC{Ci ,Cj } :The absolute inter-connectivity between Ci and Cj: the sum of the weight of the edges that connect vertices in Ci to vertices in Cj
- Internal inter-connectivity of a cluster Ci : the size of its min-cut bisector ECCi (i.e., the weighted sum of edges that partition the graph into two roughly equal parts)
- Relative Inter-connectivity (RI):
\[RI(C_{i},C_{j})=\frac{|EC_{C_{i},C_{j}}|}{\frac{|EC_{C_{i}}|+|EC_{C_{j}}|}{2}}\]
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.