• IPSep-CoLa

  • Referenced in 9 articles [sw09789]
  • labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force...
  • MODEVO

  • Referenced in 2 articles [sw14415]
  • recent affinity propagation (AP) algorithm for graph clustering and can be applied to decompose networks...
  • PEGASUS

  • Referenced in 8 articles [sw17479]
  • version of MapReduce. Many graph mining operations (PageRank, spectral clustering, diameter estimation, connected components ... report our findings on several real graphs, including one of the largest publicly available...
  • VNDS

  • Referenced in 6 articles [sw07586]
  • neighborhood search Finding communities or clusters, in networks, or graphs, has been the subject ... consists in maximizing the sum for all clusters of the number of inner edges minus...
  • LPAm+

  • Referenced in 6 articles [sw07587]
  • neighborhood search Finding communities or clusters, in networks, or graphs, has been the subject ... consists in maximizing the sum for all clusters of the number of inner edges minus...
  • ECgene

  • Referenced in 4 articles [sw17328]
  • grouped together to define an EST cluster in a manner similar to that ... UniGene algorithm. Transcript assembly is achieved using graph theory that represents ... exon connectivity in each cluster as a directed acyclic graph (DAG). Distinct paths along exons ... alternative splicing events. EST sequences in each cluster are subclustered further according to the compatibility...
  • subgraph2vec

  • Referenced in 3 articles [sw36496]
  • statistical models for tasks such as graph classification, clustering, link prediction and community detection. subgraph2vec ... such as CNNs, SVMs and relational data clustering algorithms to achieve significantly superior accuracies. Also ... deep learning variant of Weisfeiler-Lehman graph kernel. Our experiments on several benchmark and large...
  • gSkeletonClu

  • Referenced in 3 articles [sw30861]
  • network clustering algorithm, called gSkeletonClu (graph-skeleton based clustering). By projecting a network...
  • SELP

  • Referenced in 3 articles [sw22586]
  • supervised evidential label propagation algorithm for graph data clustering. With the increasing size of social ... this paper, a new Semi-supervised clustering approach based on an Evidential Label Propagation strategy ... about the labels of nodes in the graph, including the labeled nodes and the unlabeled...
  • NeAT

  • Referenced in 1 article [sw21914]
  • toolbox for the analysis of biological networks, clusters, classes and pathways. he network analysis tools ... tools for the analysis of networks (graphs) and clusters (e.g. microarray clusters, functional classes ... makes the connection between networks and clusters (graph-based clustering, cliques discovery and mapping...
  • MSRD

  • Referenced in 1 article [sw19162]
  • clustering algorithm based on the most similar relation diagram. The MSRD (most similar relation diagram ... dataset is a weighted undirected graph constructed from an initial dataset. In the MSRD, each ... data between the two sub-graph. The clustering algorithm based on the MSRD involves ... cutting the diagram into sub-graphs (clusters). In this paper, we developed a package...
  • SCLaP

  • Referenced in 1 article [sw20060]
  • clustered) complex networks via size-constrained graph clustering. The most commonly used method to tackle ... multilevel graph partitioning. We mainly target networks with highly irregular and hierarchically clustered structure ... fastest configuration partitions the largest real-world graph in our study (it has 3.3 billion...
  • kml3d

  • Referenced in 3 articles [sw21147]
  • best’ number of clusters. In addition, the 3D graph representing the mean joint-trajectories ... each cluster can be exported through LaTeX in a 3D dynamic rotating PDF graph...
  • quivermutation

  • Referenced in 37 articles [sw13691]
  • These java applets implement quiver mutation (and cluster mutation) as invented in joint work ... this article. A quiver is an oriented graph: it has vertices (nodes) and arrows between...
  • SOMbrero

  • Referenced in 1 article [sw14935]
  • Using SOMbrero for clustering and visualizing graphs. Graphs have attracted a burst of attention ... enlighten the structure of the graph, performing clustering of the graph together with visualization...
  • solverALL

  • Referenced in 1 article [sw33799]
  • Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. Editing a graph into ... standard optimization task in graph-based data clustering. Here, complementing classic work where the clusters...
  • SocNetV

  • Referenced in 1 article [sw05578]
  • network centralities (i.e. closeness, betweenness, graph), clustering coefficient...
  • TSMining

  • Referenced in 1 article [sw29030]
  • method), multivariate motif discovery (based on graph clustering), and several functions used for the ease...
  • Rambo

  • Referenced in 5 articles [sw14702]
  • homogeneous connection profiles. The clustering is performed for directed graphs with typed edges (edges...
  • AS 140

  • Referenced in 3 articles [sw14175]
  • Algorithm AS 140: Clustering the Nodes of a Directed Graph...