0.25
0.5
0.75
1.25
1.5
1.75
2
A Spectral Clustering Approach to Optimally Combining Numerical Vectors with a Modular Network
Published on Sep 14, 20073597 Views
We address the issue of clustering numerical vectors with a network. The problem setting is basically equivalent to constrained clustering by Wagstaff and Cardie [20] and semisupervised clustering by
Chapter list
A Spectral Clustering Approach to Optimally Combining Numerical Vectors with a Modular Network00:03
Table of Contents00:18
Heterogeneous Data Clustering00:47
Related work02:10
Table of Contents03:29
Spectral Clustering03:37
Cost combining numerical vectors with a network05:31
Complex Networks06:19
Network Modularity07:02
Cost Combining Numerical Vectors with a Network08:19
Our Proposed Spectral Clustering08:54
Table of Contents09:50
Synthetic Data09:57
Results for Synthetic Data (1)11:45
Results for Synthetic Data (2)13:10
Synthetic Data (Numerical Vector) + Real Data (Gene Network)13:16
Summary14:50
Thank you for your attention!15:35