Partitioning networks into clusters and residuals with average association (Q5250462): Difference between revisions

@@ Property / Wikidata QID @@
+Q85119955
@@ Property / Wikidata QID: Q85119955 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1063/1.3460360
@@ Property / full work available at URL: https://doi.org/10.1063/1.3460360 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2058257001
@@ Property / OpenAlex ID: W2058257001 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Partitioning of Graphs
@@ Property / cites work: Lower Bounds for the Partitioning of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Sparse Matrices with Eigenvectors of Graphs
+Normal rank
@@ Property / cites work @@
+EIGENVALUE DECOMPOSITION AS A GENERALIZED SYNCHRONIZATION CLUSTER ANALYSIS
+Normal rank
@@ Property / cites work @@
+Identification of network modules by optimization of ratio association
+Normal rank
@@ Property / cites work @@
+The varimax criterion for analytic rotation in factor analysis
+Normal rank
@@ Property / cites work @@
+A direct solution for pairwise rotations in Kaiser's varimax method
+Normal rank
@@ Property / cites work @@
+An algorithm for information structuring and retrieval
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5250462