• Tidak ada hasil yang ditemukan

A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts

N/A
N/A
Info
Unduh - Bebas
Protected

Academic year: 2019

Membagikan "A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts"

Copied!
20
0
0

Memuat.... (Lihat teks lengkap sekarang)

Unduh sekarang ( 20 Halaman )

Teks penuh

Loading

Gambar

Table 1: Examples of popular kernel functions
Table 2: Popular graph partitioning objectives and corresponding weights and kernels given affinity matrixA
Figure 1: Results using three different cluster initialization methods. Left: random initialization; Middle:spectral initialization; Right: random initialization on a kernel with σ = −1
Table 4: Comparison of NMI values achieved by Algorithm 1 before and after σ shift
+6

Referensi

Unduh sekarang ( PDF - 20 Halaman - 277.37 KB )

Garis besar

A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts

Dokumen terkait