Name
Abstract | ||
|---|---|---|
Graph clustering methods such as spectral clustering are defined for general weighted graphs. In machine learning, however, data often is not given in form of a graph, but in terms of similarity (or distance) values between points. In this case, first a neighborhood graph is constructed using the similarities between the points and then a graph clustering algorithm is applied to this graph. In this pa- per we investigate the influence of the construction of the similarity graph on the clustering results. We first study the convergence of graph clustering crite- ria such as the normalized cut (Ncut) as the sample size tends to infinity. We find that the limit expressions are different for different types of graph, for exam- ple the r-neighborhood graph or the k-nearest neighbor graph. In plain words: Ncut on a kNN graph does something systematically different than Ncut on an r-neighborhood graph! This finding shows that graph clustering criteria cannot be studied independently of the kind of graph they are applied to. We also provide examples which show that these differences can be observed for toy and real data already for rather small sample sizes. |
Year | Venue | Keywords |
|---|---|---|
2008 | NIPS | machine learning,graph clustering,k nearest neighbor,sample size,spectral clustering |
Field | DocType | Citations |
Strength of a graph,Combinatorics,Line graph,Graph property,Computer science,Cubic graph,Null graph,Artificial intelligence,Butterfly graph,Machine learning,Voltage graph,Complement graph | Conference | 23 |
PageRank | References | Authors |
1.49 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Maier | 1 | 91 | 7.26 |
| von luxburg | 2 | 3246 | 170.11 |
| Matthias Hein | 3 | 663 | 62.80 |