Corpus ID: 7123900

Consistency constraints for overlapping data clustering

@article{Culbertson2016ConsistencyCF,
  title={Consistency constraints for overlapping data clustering},
  author={J. Culbertson and Dan P. Guralnik and J. Hansen and Peter F. Stiller},
  journal={ArXiv},
  year={2016},
  volume={abs/1608.04331}
}
We examine overlapping clustering schemes with functorial constraints, in the spirit of Carlsson--Memoli. This avoids issues arising from the chaining required by partition-based methods. Our principal result shows that any clustering functor is naturally constrained to refine single-linkage clusters and be refined by maximal-linkage clusters. We work in the context of metric spaces with non-expansive maps, which is appropriate for modeling data processing which does not increase information… Expand
Functorial hierarchical clustering with overlaps
TLDR
This work draws inspiration from three important sources of research on dissimilarity-based clustering and intertwines those three threads into a consistent principled functorial theory of clustering, and proves an equivalence between these general overlapping clustering functors and projections of weight spaces to what the authors term clustering domains. Expand
Flattening Multiparameter Hierarchical Clustering Functors
TLDR
This work brings together topological data analysis, applied category theory, and machine learning to study multiparameter hierarchical clustering and introduces a Bayesian update algorithm for learning clustering parameters from data. Expand
Functorial Clustering via Simplicial Complexes
We adapt previous research on topological unsupervised learning to characterize a class of hierarchical overlapping clustering algorithms as functors that factor through a category of simplicialExpand
Functorial Manifold Learning and Overlapping Clustering
TLDR
A unified functorial perspective on manifold learning and clustering is developed and several state of the art manifold learning algorithms are expressed as functors at different levels of this hierarchy, including Laplacian Eigenmaps, Metric Multidimensional Scaling, and UMAP. Expand
Category Theory in Machine Learning
TLDR
This work aims to document the motivations, goals and common themes across these applications of category theory in machine learning, touching on gradient-based learning, probability, and equivariant learning. Expand
Chase: Control of Heterogeneous Autonomous Sensors for Situational Awareness
TLDR
The overarching goal throughout the six years of the project's existence remained the discovery and analysis of new foundational methodology for information collection and fusion that exercises rigorous feedback control over information collection assets, simultaneously managing information and physical aspects of their states. Expand
Functorial Manifold Learning
TLDR
This work first characterize manifold learning algorithms as functors that map pseudometric spaces to optimization objectives and that factor through hierarchical clustering functors, then uses this characterization to prove refinement bounds on manifold learning loss functions and construct a hierarchy of manifoldlearning algorithms based on their equivariants. Expand

References

SHOWING 1-10 OF 33 REFERENCES
An Impossibility Theorem for Clustering
TLDR
A formal perspective on the difficulty in finding a unified framework for reasoning about clustering at a technical level is suggested, in the form of an impossibility theorem: for a set of three simple properties, it is shown that there is no clustering function satisfying all three. Expand
Characterization, Stability and Convergence of Hierarchical Clustering Methods
TLDR
It is shown that within this framework, one can prove a theorem analogous to one of Kleinberg (2002), in which one obtains an existence and uniqueness theorem instead of a non-existence result. Expand
An order theoretic framework for overlapping clustering
TLDR
A dissimilarity function φ is regarded as an arbitrary isotone mapping from a finite partially ordered set I into a (partially) ordered set R, and the correspondence between the two subsets C(φ) and D( φ) of I is studied, formed by the elements whose images are inaccessible from above and from below, respectively. Expand
Enhanced Topology-Sensitive Clustering by Reeb Graph Shattering
TLDR
Preliminary experimental results are provided to demonstrate that the improved topology-sensitive clustering algorithm yields a more accurate and reliable description of the topology of the underlying scalar function. Expand
One-to-One Correspondence Between Indexed Cluster Structures and Weakly Indexed Closed Cluster Structures
We place ourselves in a setting where singletons are not all required to be clusters, and we show that the resulting cluster structures and their corresponding closure under finite nonemptyExpand
Classifying Clustering Schemes
TLDR
A framework is constructed for studying what happens when one imposes various structural conditions on the clustering schemes, under the general heading of functoriality, and it is shown that, within this framework, one can prove a theorem analogous to one of Kleinberg (Becker et al). Expand
Persistence-Based Clustering in Riemannian Manifolds
TLDR
A clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map, and whose output clusters have the property that their spatial locations are bound to the ones of the basins of attraction of the peaks of the density. Expand
Combinatorial optimisation and hierarchical classifications
TLDR
Within the galaxy of optimization, some selected topics relating Combinatorial Optimization and Hierarchical Classification are discussed, including NP-completeness results and search for polynomial instances, and some standard algorithmic approaches are discussed. Expand
The Construction of Hierarchic and Non-Hierarchic Classifications
TLDR
A theoretical framework within which the properties of cluster methods, which operate on data in the form of a dissimilarity coefficient on a set of objects, may be discussed is outlined. Expand
Weak Hierarchies: A Central Clustering Structure
The k-weak hierarchies, for k ≥ 2, are the cluster collections such that the intersection of any (k + 1) members equals the intersection of some k of them. Any cluster collection turns out to be aExpand
...
1
2
3
4
...