Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Spectral partitioning with multiple eigenvectors
Discrete Applied Mathematics - Special volume on VLSI
Clustering in large graphs and matrices
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Latent semantic indexing: a probabilistic analysis
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast Monte-Carlo Algorithms for finding low-rank approximations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Segmentation Using Eigenvectors: A Unifying View
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
A divide-and-merge methodology for clustering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A divide-and-merge methodology for clustering
ACM Transactions on Database Systems (TODS)
A dependence maximization view of clustering
Proceedings of the 24th international conference on Machine learning
A tutorial on spectral clustering
Statistics and Computing
Inappropriateness of the criterion of k-way normalized cuts for deciding the number of clusters
Pattern Recognition Letters
Filtering spam with behavioral blacklisting
Proceedings of the 14th ACM conference on Computer and communications security
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
An algorithm for improving graph partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
A discriminative framework for clustering via similarity functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Visual analysis of controversy in user-generated encyclopedias
Information Visualization - Special issue on visual analytics science and technology
Matching large ontologies: A divide-and-conquer approach
Data & Knowledge Engineering
A Graph Clustering Algorithm Based on Minimum and Normalized Cut
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Regularization on Graphs with Function-adapted Diffusion Processes
The Journal of Machine Learning Research
Incremental clustering of dynamic data streams using connectivity based representative points
Data & Knowledge Engineering
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
Allocating power ground vias in 3D ICs for simultaneous power and thermal integrity
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Self-managed topologies in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Clustering with r-regular graphs
Pattern Recognition
Fast approximate spectral clustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Orca Reduction and ContrAction Graph Clustering
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
A spectral-based clustering algorithm for categorical data using data summaries
Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors
Foundations and Trends® in Theoretical Computer Science
Framework for evaluating clustering algorithms in duplicate detection
Proceedings of the VLDB Endowment
Mine the easy, classify the hard: a semi-supervised approach to automatic sentiment classification
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
You are who you know: inferring user profiles in online social networks
Proceedings of the third ACM international conference on Web search and data mining
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Clustering dense graphs: A web site graph paradigm
Information Processing and Management: an International Journal
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
Proceedings of the 19th international conference on World wide web
Social group suggestion from user image collections
Proceedings of the 19th international conference on World wide web
Eigenvector-based clustering using aggregated similarity matrices
Proceedings of the 2010 ACM Symposium on Applied Computing
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
The S-Space package: an open source package for word space models
ACLDemos '10 Proceedings of the ACL 2010 System Demonstrations
Evaluating the quality of clustering algorithms using cluster path lengths
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
The impact of unlinkability on adversarial community detection: effects and countermeasures
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
Multi-group QoS consensus for web services
Journal of Computer and System Sciences
BotGrep: finding P2P bots with structured graph analysis
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Detection of anomalous insiders in collaborative environments via relational analysis of access logs
Proceedings of the first ACM conference on Data and application security and privacy
Which clustering do you want? inducing your ideal clustering with minimal feedback
Journal of Artificial Intelligence Research
Automatically finding clusters in normalized cuts
Pattern Recognition
Multilevel local search algorithms for modularity clustering
Journal of Experimental Algorithmics (JEA)
Benefits of bias: towards better characterization of network sampling
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fully-dynamic hierarchical graph clustering using cut trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Algorithmic extensions of cheeger's inequality to higher eigenvalues and partitions
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Is there a best quality metric for graph clusters?
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Categorization of wikipedia articles with spectral clustering
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
Detection of web communities from community cores
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
Peer effects and stability in matching markets
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Note: Maximizing edge-ratio is NP-complete
Discrete Applied Mathematics
Spectral Sparsification of Graphs
SIAM Journal on Computing
Multi-objective community detection in complex networks
Applied Soft Computing
Usage contexts for object similarity: exploratory investigations
Proceedings of the 1st International Conference on Learning Analytics and Knowledge
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th international conference on Graph Drawing
Segmentation of thalamic nuclei from DTI using spectral clustering
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Spectral clustering with discriminant cuts
Knowledge-Based Systems
Local clustering of large graphs by approximate fiedler vectors
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Induction of the common-sense hierarchies in lexical data
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Vector quantization based approximate spectral clustering of large datasets
Pattern Recognition
Community detection in Social Media
Data Mining and Knowledge Discovery
Many sparse cuts via higher eigenvalues
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Locally-scaled spectral clustering using empty region graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
The small community phenomenon in networks: models, algorithms and applications
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Electronic Commerce Research and Applications
Proceedings of the 2012 ACM Conference on Ubiquitous Computing
A mixed graph model for community detection
International Journal of Intelligent Information and Database Systems
Mining query log graphs towards a query folksonomy
Concurrency and Computation: Practice & Experience
Shaping communities out of triangles
Proceedings of the 21st ACM international conference on Information and knowledge management
KACTL: knowware based automated construction of a treelike library from web documents
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Extracting hierarchies with overlapping structure from network data
Proceedings of the Winter Simulation Conference
Toward finding hidden communities based on user profile
Journal of Intelligent Information Systems
Fuzzy Sets and Systems
On commenting behavior of Facebook users
Proceedings of the 24th ACM Conference on Hypertext and Social Media
Distributed community detection in web-scale networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Local clustering in provenance graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
Advances in Data Analysis and Classification
Dynamic group-finding in public bus networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
Clustering and outlier detection using isoperimetric number of trees
Pattern Recognition
Behaviour generation in humanoids by learning potential-based policies from constrained motion
Applied Bionics and Biomechanics
| Hi-index | 0.00 |
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have poly-logarithmic worst-case guarantees under the new measure. The main result of the article is the analysis of a popular spectral algorithm. One variant of spectral clustering turns out to have effective worst-case guarantees; another finds a "good" clustering, if one exists.