Difference between revisions of "Orange: Louvain Clustering"
Onnowpurbo (talk | contribs) |
Onnowpurbo (talk | contribs) (→Contoh) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
Sumber: https://docs.biolab.si//3/visual-programming/widgets/unsupervised/louvainclustering.html | Sumber: https://docs.biolab.si//3/visual-programming/widgets/unsupervised/louvainclustering.html | ||
| − | + | Widget Louvain Clustering mengelompokan item menggunakan algoritma Louvain clustering. | |
==Input== | ==Input== | ||
| Line 12: | Line 12: | ||
Graph (with the Network addon): the weighted k-nearest neighbor graph | Graph (with the Network addon): the weighted k-nearest neighbor graph | ||
| − | + | Widget Louvain Clustering mengubah data input menjadi k-nearest neighbor graph. Untuk mempertahankan gagasan distance, Jaccard index untuk jumlah shared tetangga digunakan untuk menentukan batas (edge). Akhirnya, algoritma pendeteksian optimisasi komunitas modularitas diterapkan pada graph untuk memperoleh cluster dari node yang highly interconnected. Widget mengeluarkan set data baru di mana cluster index digunakan sebagai atribut meta. | |
| − | [[File:Louvain-stamped.png|center| | + | [[File:Louvain-stamped.png|center|600px|thumb]] |
* PCA processing is typically applied to the original data to remove noise. | * PCA processing is typically applied to the original data to remove noise. | ||
| Line 24: | Line 24: | ||
==Contoh== | ==Contoh== | ||
| − | Louvain Clustering | + | Widget Louvain Clustering mengkonversi dataset menjadi graph, dimana widget Louvain Clustering akan menemukan highly interconnected node. Kita bisa memvisualisasi graph yang dihasilkan menggunakan Widget Network Explorer dari Network addon. |
| − | [[File:Louvain-Example.png|center| | + | [[File:Louvain-Example.png|center|600px|thumb]] |
==Referensi== | ==Referensi== | ||
Latest revision as of 10:21, 14 April 2020
Sumber: https://docs.biolab.si//3/visual-programming/widgets/unsupervised/louvainclustering.html
Widget Louvain Clustering mengelompokan item menggunakan algoritma Louvain clustering.
Input
Data: input dataset
Output
Data: dataset with cluster index as a class attribute Graph (with the Network addon): the weighted k-nearest neighbor graph
Widget Louvain Clustering mengubah data input menjadi k-nearest neighbor graph. Untuk mempertahankan gagasan distance, Jaccard index untuk jumlah shared tetangga digunakan untuk menentukan batas (edge). Akhirnya, algoritma pendeteksian optimisasi komunitas modularitas diterapkan pada graph untuk memperoleh cluster dari node yang highly interconnected. Widget mengeluarkan set data baru di mana cluster index digunakan sebagai atribut meta.
- PCA processing is typically applied to the original data to remove noise.
- The distance metric is used for finding specified number of nearest neighbors.
- The number of nearest neighbors to use to form the KNN graph.
- Resolution is a parameter for the Louvain community detection algorithm that affects the size of the recovered clusters. Smaller resolutions recover smaller, and therefore a larger number of clusters, and conversely, larger values recover clusters containing more data points.
- When Apply Automatically is ticked, the widget will automatically communicate all changes. Alternatively, click Apply.
Contoh
Widget Louvain Clustering mengkonversi dataset menjadi graph, dimana widget Louvain Clustering akan menemukan highly interconnected node. Kita bisa memvisualisasi graph yang dihasilkan menggunakan Widget Network Explorer dari Network addon.
Referensi
Blondel, Vincent D., et al. “Fast unfolding of communities in large networks.” Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.
Lambiotte, Renaud, J-C. Delvenne, and Mauricio Barahona. “Laplacian dynamics and multiscale modular structure in networks.” arXiv preprint, arXiv:0812.1770 (2008).