Graph clustering

DOI10.1016/J.COSREV.2007.05.001zbMATH Open1302.68237OpenAlexW143174683MaRDI QIDQ458448FDOQ458448

Satu Elisa Schaeffer

Publication date: 7 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2007.05.001

Recommendations

• Clustering algorithm of graphs
• Clustering data that are graph connected
• scientific article; zbMATH DE number 2043367
• Improved Graph Clustering
• Discrete Multi-Graph Clustering
• Graph Clustering in All Parameter Regimes
• scientific article; zbMATH DE number 220723

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• On the Quality of Spectral Separators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Experimental and Efficient Algorithms
• Integer Programming and Combinatorial Optimization
• A decentralized algorithm for spectral analysis
• Spectral bounds for the betweenness of a graph
• On weakly cospectral graphs
• Experiments in projection and clustering by simulated annealing
• Algorithm AS 136: A K-Means Clustering Algorithm
• Probability and random processes.
• Maximal Flow Through a Network
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• Title not available (Why is that?)
• Pattern classification.
• Introduction to algorithms
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Random Graphs
• Fast online graph clustering via Erdős-Rényi mixture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms on Strings, Trees and Sequences
• Clustering Using Objective Functions and Stochastic Search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Which graphs are determined by their spectrum?
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Algebraic Graph Theory
• Title not available (Why is that?)
• Correlation clustering
• A faster algorithm for betweenness centrality*
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hub Location and the p-Hub Median Problem
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Title not available (Why is that?)
• Machine Learning: ECML 2004
• The dense \(k\)-subgraph problem
• Clustering to minimize the maximum intercluster distance
• Some simplified NP-complete graph problems
• Classifying molecular sequences using a linkage graph with their pairwise similarities
• Complexity of finding dense subgraphs
• Title not available (Why is that?)
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• A new approach to the maximum-flow problem
• Title not available (Why is that?)
• How to Allocate Network Centers
• Title not available (Why is that?)
• The Capacitated K-Center Problem
• The Spectra of Random Graphs with Given Expected Degrees
• A Fast Parametric Maximum Flow Algorithm and Applications
• Clustering large graphs via the singular value decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Title not available (Why is that?)
• Exact and approximation algorithms for clustering
• On clusterings
• A heuristic for the p-center problem in graphs
• Algorithms for graph partitioning on the planted partition model
• Multi-Terminal Network Flows
• Graph Clustering and Minimum Cut Trees
• Title not available (Why is that?)
• Signless Laplacians and line graphs
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Expander flows, geometric embeddings and graph partitioning
• Old and new results on algebraic connectivity of graphs
• Easy and hard bottleneck location problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Title not available (Why is that?)
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• Spectral partitioning works: planar graphs and finite element meshes
• Min-cut clustering
• Sales Territory Alignment: A Review and Model
• How the science of complex networks can help developing strategies against terrorism
• Title not available (Why is that?)
• A clustering approach to the planar hub location problem
• Heuristics for the p-hub location problem
• Spectral clustering and its use in bioinformatics
• Cluster graph modification problems
• SOFSEM 2006: Theory and Practice of Computer Science
• 10.1162/1532443041827943
• Detecting network communities: a new systematic and efficient algorithm
• Random walks and local cuts in graphs
• NP-hard problems in hierarchical-tree clustering
• Title not available (Why is that?)
• Sparsest cuts and bottlenecks in graphs
• A clustering algorithm based on graph connectivity
• Accuracy of computed eigenvectors via optimizing a Rayleigh quotient
• Web document clustering using hyperlink structures
• Clustering to minimize the sum of cluster diameters
• A proof of the triangle inequality for the Tanimoto distance
• Exploring networks with traceroute-like probes: Theory and simulations
• Finding optimal solutions to the graph partitioning problem with heuristic search
• A hierarchical clustering algorithm based on fuzzy graph connectedness
• Scalable probabilistic clustering
• A polylogarithmic approximation of the minimum bisection
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fuzzy clustering for the estimation of the parameters of the components of mixtures of normal distributions
• A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY
• A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• The Spacey Random Walk: A Stochastic Process for Higher-Order Data
• A reductive approach to hypergraph clustering: an application to image segmentation
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
• Spectral methods for graph clustering - a survey
• Community detection in node-attributed social networks: a survey
• Random walks on binary strings applied to the somatic hypermutation of B-cells
• Graph clustering with a constraint on cluster sizes
• Weighted clustering of attributed multi-graphs
• Using hierarchical clustering and dendrograms to quantify the clustering of membrane proteins
• Graph-based data clustering with overlaps
• Parameterized algorithms for min-max 2-cluster editing
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Image-based graph visualization: advances and challenges
• Generalized modularity matrices
• Graph Clustering and Minimum Cut Trees
• PageRank beyond the web
• iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
• Formal Concept Analysis from the Standpoint of Possibility Theory
• Dense and sparse graph partition
• Discovering patterns in time-varying graphs: a triclustering approach
• The structural clustering and analysis of metric based on granular space
• Title not available (Why is that?)
• A variational approach to the consistency of spectral clustering
• Topological aspects of the multi-language phases of the naming game on community-based networks
• Structure-oriented prediction in complex networks
• Structural and algorithmic properties of 2-community structures
• Spectral complexity of directed graphs and application to structural decomposition
• Distance geometry and data science
• Column generation approaches for the software clustering problem
• Mixed-integer linear programming formulations for the software clustering problem
• Title not available (Why is that?)
• 11 Reduced-order modeling of large-scale network systems
• A general view on computing communities
• Multistep scheduling algorithm for parallel and distributed processing in heterogeneous systems with communication costs
• Title not available (Why is that?)
• Online sum-radii clustering
• The Small Community Phenomenon in Networks: Models, Algorithms and Applications
• Title not available (Why is that?)
• A Unified Framework for Structured Graph Learning via Spectral Constraints
• Assessing the quality of multilevel graph clustering
• Min-max communities in graphs: complexity and computational properties
• Engineering graph clustering: models and experimental evaluation
• Watersheds on Hypergraphs for Data Clustering
• Edge-matching graph contractions and their interlacing properties
• Fast and accurate determination of modularity and its effect size
• New Insight into 2-Community Structures in Graphs with Applications in Social Networks
• An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification
• Clustering and community detection in directed networks: a survey
• An order-based algorithm for minimum dominating set with application in graph mining
• Overlapping community detection in heterogeneous social networks via the user model
• A multivariate extreme value theory approach to anomaly clustering and visualization
• Multi-way set enumeration in weight tensors
• Community detection based on network communicability
• APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM
• A classification for community discovery methods in complex networks
• Understanding the geometry of transport: Diffusion maps for Lagrangian trajectory data unravel coherent sets
• An enhanced Wu-Huberman algorithm with pole point selection strategy
• Spectral clustering methods for multiplex networks
• On metric clustering to minimize the sum of radii
• The critical node detection problem in networks: a survey
• A review on algorithms for maximum clique problems
• Beyond good partition shapes: an analysis of diffusive graph partitioning
• Linear and quadratic programming approaches for the general graph partitioning problem
• Clustering and outlier detection using isoperimetric number of trees
• Community Detection in Networks via Nonlinear Modularity Eigenvectors
• Graph clustering via generalized colorings
• Clustering as a dual problem to colouring
• MDPCluster: a swarm-based community detection algorithm in large-scale graphs
• Motif-based embedding for graph clustering
• An overview of graph covering and partitioning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• A polynomial algorithm for balanced clustering via graph partitioning
• Network community detection on metric space
• Finding a potential community in networks
• Graph summarization with quality guarantees
• Distributed detection of clusters of arbitrary size
• A community detection algorithm based on graph compression for large-scale social networks
• Memetic Graph Clustering
• Dense community detection in multi-valued attributed networks
• Analyzing the stock market based on the structure of \textit{kNN} network
• Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
• Polyhedral properties of the induced cluster subgraphs
• The expected adjacency and modularity matrices in the degree corrected stochastic block model
• Coherent network partitions
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
• Partitioning of relative sensing networks: a stability margin perspective
• Total Variation Based Community Detection Using a Nonlinear Optimization Approach
• On a semi-superwized graph clustering problem
• Finding and visualizing graph clusters using PageRank optimization
• On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization
• Graph Clustering using Effective Resistance
• Cluster deletion on interval graphs and split related graphs
• Inverse multiobjective optimization: inferring decision criteria from data
• Local community detection based on small cliques
• Multiple graphs clustering by gradient flow method
• Consistency of Dirichlet Partitions

Uses Software

• AS 136
• MCODE

This page was built for publication: Graph clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458448)