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)
Recommendations
Cites work
- scientific article; zbMATH DE number 4131663 (Why is no real title available?)
- scientific article; zbMATH DE number 2088903 (Why is no real title available?)
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 177560 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1097578 (Why is no real title available?)
- scientific article; zbMATH DE number 2011857 (Why is no real title available?)
- scientific article; zbMATH DE number 2043367 (Why is no real title available?)
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- scientific article; zbMATH DE number 2079405 (Why is no real title available?)
- scientific article; zbMATH DE number 1559578 (Why is no real title available?)
- scientific article; zbMATH DE number 1385870 (Why is no real title available?)
- scientific article; zbMATH DE number 2088074 (Why is no real title available?)
- scientific article; zbMATH DE number 2090201 (Why is no real title available?)
- scientific article; zbMATH DE number 2101187 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- scientific article; zbMATH DE number 1426485 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- 10.1162/1532443041827943
- A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods
- A Fast Parametric Maximum Flow Algorithm and Applications
- A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY
- A clustering algorithm based on graph connectivity
- A clustering approach to the planar hub location problem
- A decentralized algorithm for spectral analysis
- A faster algorithm for betweenness centrality*
- A heuristic for the p-center problem in graphs
- A hierarchical clustering algorithm based on fuzzy graph connectedness
- A new approach to the maximum-flow problem
- A polylogarithmic approximation of the minimum bisection
- A proof of the triangle inequality for the Tanimoto distance
- Accuracy of computed eigenvectors via optimizing a Rayleigh quotient
- Algebraic Graph Theory
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithms for graph partitioning on the planted partition model
- Algorithms on Strings, Trees and Sequences
- An Efficient Heuristic Procedure for Partitioning Graphs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Cluster graph modification problems
- Clustering Using Objective Functions and Stochastic Search
- Clustering large graphs via the singular value decomposition
- Clustering to minimize the maximum intercluster distance
- Clustering to minimize the sum of cluster diameters
- Community structure in social and biological networks
- Complexity of finding dense subgraphs
- Correlation clustering
- Detecting network communities: a new systematic and efficient algorithm
- Easy and hard bottleneck location problems
- Emergence of Scaling in Random Networks
- Exact and approximation algorithms for clustering
- Expander flows, geometric embeddings and graph partitioning
- Experimental and Efficient Algorithms
- Experiments in projection and clustering by simulated annealing
- Exploring networks with traceroute-like probes: Theory and simulations
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Fast online graph clustering via Erdős-Rényi mixture
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Fuzzy clustering for the estimation of the parameters of the components of mixtures of normal distributions
- Graph Clustering and Minimum Cut Trees
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Heuristics for the p-hub location problem
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- How the science of complex networks can help developing strategies against terrorism
- How to Allocate Network Centers
- Hub Location and the p-Hub Median Problem
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Integer Programming and Combinatorial Optimization
- Intersections of random walks.
- Introduction to algorithms
- Machine Learning: ECML 2004
- Maximal Flow Through a Network
- Min-cut clustering
- Mixing patterns and community structure in networks
- Multi-Terminal Network Flows
- NP-hard problems in hierarchical-tree clustering
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Old and new results on algebraic connectivity of graphs
- On clusterings: good, bad and spectral
- On the Quality of Spectral Separators
- On weakly cospectral graphs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Pattern classification.
- Probability and random processes.
- Random Graphs
- Random walks and local cuts in graphs
- SOFSEM 2006: Theory and Practice of Computer Science
- Sales Territory Alignment: A Review and Model
- Scalable probabilistic clustering
- Signless Laplacians and line graphs
- Some simplified NP-complete graph problems
- Sparsest cuts and bottlenecks in graphs
- Spectral bounds for the betweenness of a graph
- Spectral clustering and its use in bioinformatics
- Spectral partitioning works: planar graphs and finite element meshes
- The Capacitated K-Center Problem
- The Spectra of Random Graphs with Given Expected Degrees
- The Structure and Function of Complex Networks
- The dense \(k\)-subgraph problem
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Web document clustering using hyperlink structures
- Which graphs are determined by their spectrum?
Cited in
(only showing first 100 items - show all)- A note on the satisfactory partition problem: constant size requirement
- Clustering-based model order reduction for nonlinear network systems
- Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
- A community detection algorithm based on graph compression for large-scale social networks
- Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
- Motif-based embedding for graph clustering
- Local community detection based on small cliques
- Multiple graphs clustering by gradient flow method
- Graph Clustering using Effective Resistance
- On a semi-supervised graph clustering problem
- Total variation based community detection using a nonlinear optimization approach
- Dynamics of cluster structure in financial correlation matrix
- \textit{Pin-Align}: a new dynamic programming approach to align protein-protein interaction networks
- Distributed detection of clusters of arbitrary size
- An overview of graph covering and partitioning
- Cluster deletion on interval graphs and split related graphs
- Sparsity measure of a network graph: Gini index
- Inverse multiobjective optimization: inferring decision criteria from data
- A review and proposal of (fuzzy) clustering for nonlinearly separable data
- A polynomial algorithm for balanced clustering via graph partitioning
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Community detection with the label propagation algorithm: a survey
- Cluster deletion on interval graphs and split related graphs
- Finding influential communities in networks with multiple influence types
- Coherent network partitions
- Dynamic clustering to minimize the sum of radii
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Polyhedral properties of the induced cluster subgraphs
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
- scientific article; zbMATH DE number 3970751 (Why is no real title available?)
- Dynamic clustering to minimize the sum of radii
- scientific article; zbMATH DE number 1409218 (Why is no real title available?)
- A Statistical Performance Analysis of Graph Clustering Algorithms
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- A three-stage algorithm for local community detection based on the high node importance ranking in social networks
- New insight into 2-community structures in graphs with applications in social networks
- Dense community detection in multi-valued attributed networks
- Partitioning of relative sensing networks: a stability margin perspective
- Finding and visualizing graph clusters using PageRank optimization
- A practical propagation path identification scheme for quality-related faults based on nonlinear dynamic latent variable model and partitioned Bayesian network
- Effective Resistance Preserving Directed Graph Symmetrization
- A survey of neighborhood construction algorithms for clustering and classifying data points
- Consistency of Dirichlet partitions
- Network community detection on metric space
- Finding a potential community in networks
- Graph summarization with quality guarantees
- Spanning tree packing number and eigenvalues of graphs with given girth
- Hybrid self-adaptive algorithm for community detection in complex networks
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- Memetic graph clustering
- On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization
- Analyzing the stock market based on the structure of \textit{kNN} network
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- Structural and algorithmic properties of 2-community structures
- Spectral clustering methods for multiplex networks
- Online sum-radii clustering
- A classification for community discovery methods in complex networks
- A unified framework for structured graph learning via spectral constraints
- Assessing the quality of multilevel graph clustering
- scientific article; zbMATH DE number 1305418 (Why is no real title available?)
- Community detection based on network communicability
- An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification
- Graph clustering via generalized colorings
- Graph clustering with a constraint on cluster sizes
- Image-based graph visualization: advances and challenges
- The critical node detection problem in networks: a survey
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Clustering as a dual problem to colouring
- Advances on testing C-planarity of embedded flat clustered graphs
- Watersheds on Hypergraphs for Data Clustering
- Weighted clustering of attributed multi-graphs
- Approximate algorithms for graph clustering problem
- Discovering patterns in time-varying graphs: a triclustering approach
- Generalized modularity matrices
- Spectral complexity of directed graphs and application to structural decomposition
- 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
- Community detection in networks via nonlinear modularity eigenvectors
- Graph Clustering and Minimum Cut Trees
- Using hierarchical clustering and dendrograms to quantify the clustering of membrane proteins
- MDPCluster: a swarm-based community detection algorithm in large-scale graphs
- A reductive approach to hypergraph clustering: an application to image segmentation
- On metric clustering to minimize the sum of radii
- Fast and accurate determination of modularity and its effect size
- PageRank beyond the web
- Detection of structurally homogeneous subsets in graphs
- iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data
- An enhanced Wu-Huberman algorithm with pole point selection strategy
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Clustering and outlier detection using isoperimetric number of trees
- Graph-based data clustering with overlaps
- Distance geometry and data science
- Min-max communities in graphs: complexity and computational properties
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Column generation approaches for the software clustering problem
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Dense and sparse graph partition
- Spectral methods for graph clustering - a survey
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)
