Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
Clustering algorithms based on minimum and maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
LOF: identifying density-based local outliers
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient algorithms for mining outliers from large data sets
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Fast Outlier Detection in High Dimensional Spaces
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Segmentation Using Eigenvectors: A Unifying View
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Multiclass Spectral Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Minimum Spanning Tree Partitioning Algorithm for Microaggregation
IEEE Transactions on Knowledge and Data Engineering
Clustering with a minimum spanning tree of scale-free-like structure
Pattern Recognition Letters
Isoperimetric Graph Partitioning for Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
Neural Computation
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Minimum Spanning Tree Based Clustering Algorithms
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Signal Processing
A survey of kernel and spectral methods for clustering
Pattern Recognition
A tutorial on spectral clustering
Statistics and Computing
A New Local Distance-Based Outlier Detection Approach for Scattered Real-World Data
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Incremental spectral clustering by efficiently updating the eigen-system
Pattern Recognition
Foundations and Trends® in Theoretical Computer Science
Spectral algorithms for learning and clustering
COLT'07 Proceedings of the 20th annual conference on Learning theory
On the isoperimetric spectrum of graphs and its approximations
Journal of Combinatorial Theory Series B
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
On the complexity of isoperimetric problems on trees
Discrete Applied Mathematics
Fast, quality, segmentation of large volumes – isoperimetric distance trees
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Computer Science Review
| Hi-index | 0.01 |
We propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in O(nlogn) and with post-processing in almost O(nlogn) (average case) and O(n^2) (worst case) time where n is the size of the data-set. It is also shown that our generalized graph model, which also allows the use of potentials at vertices, can be used to extract an extra piece of information related to anomalous data patterns and outliers. In this regard, we propose an algorithm that extracts outliers in parallel to data clustering. We also provide a comparative performance analysis of our algorithms with other related ones and we show that they behave quite effectively on hard synthetic data-sets as well as real-world benchmarks.