Revision history of "Model-based clustering of multiple networks with a hierarchical algorithm" (Q57414)

From MaRDI portal

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

23 November 2024

  • curprev 16:0616:06, 23 November 2024 Tconrad talk contribs 23,943 bytes +369 ‎Changed claim: summary_simple (P1639): This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to...
  • curprev 16:0316:03, 23 November 2024 Tconrad talk contribs 23,574 bytes 0 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal numb...
  • curprev 16:0316:03, 23 November 2024 Tconrad talk contribs 23,574 bytes +4 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal numb...
  • curprev 15:3115:31, 23 November 2024 Tconrad talk contribs 23,570 bytes −371 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number...
  • curprev 15:0815:08, 23 November 2024 Tconrad talk contribs 23,941 bytes +736 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number...

19 November 2024

  • curprev 10:2410:24, 19 November 2024 Tconrad talk contribs 23,205 bytes −15 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number... Tag: Manual revert
  • curprev 10:2310:23, 19 November 2024 Tconrad talk contribs 23,220 bytes +6 ‎Changed claim: summary (P1638): '''This paper introduces''' a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. <br><br> The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the... Tag: Reverted
  • curprev 10:2110:21, 19 November 2024 Tconrad talk contribs 23,214 bytes +9 ‎Changed claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. <br><br> The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optim... Tag: Reverted
  • curprev 10:0710:07, 19 November 2024 Tconrad talk contribs 23,205 bytes −992 ‎Removed claim: Property:P1637: This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to...
  • curprev 10:0610:06, 19 November 2024 Tconrad talk contribs 24,197 bytes −1,140 ‎Removed claim: Property:P1636: This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal numb...
  • curprev 10:0610:06, 19 November 2024 Tconrad talk contribs 25,337 bytes +1,043 ‎Created claim: summary_simple (P1639): This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to m...
  • curprev 10:0510:05, 19 November 2024 Tconrad talk contribs 24,294 bytes +1,191 ‎Created claim: summary (P1638): This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number...
  • curprev 09:3309:33, 19 November 2024 Daniel talk contribs 23,103 bytes +345 ‎Created claim: Wikidata QID (P12): Q131285860
  • curprev 09:3009:30, 19 November 2024 Daniel talk contribs 22,758 bytes +361 ‎Created claim: DBLP publication ID (P1635): journals/sac/Rebafka24

18 November 2024

  • curprev 23:1123:11, 18 November 2024 Tconrad talk contribs 22,397 bytes +992 ‎Created claim: Property:P1637: This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to m...
  • curprev 23:0923:09, 18 November 2024 Tconrad talk contribs 21,405 bytes +1,140 ‎Created claim: Property:P1636: This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number...

26 August 2024

30 July 2024

19 June 2024

30 April 2024

25 April 2024

14 March 2024

17 November 2023

17 March 2023

Retrieved from "https://portal.mardi4nfdi.de/wiki/Item:Q57414"
Powered by MediaWiki