A new method clusters complex networks using topological and geometric structure.
problem Clustering complex networks with intricate topology.
method Centroid-based clustering strategy using Wasserstein distance and barycenter for persistence barcodes.
result Demonstrated effectiveness on simulated and real-world networks.
Proposes a constraint for deep clustering to handle both simple and complex topologies.
problem Limited prior knowledge for deep clustering methods to perform well on complex topologies.
method Introduces a constraint using symmetric InfoNCE to enhance deep clustering performance.
result The constraint improves deep clustering methods' performance on both simple and complex topologies.
A hierarchical clustering algorithm for data clouds without structure assumptions.
problem Exploring data clouds without making structure assumptions.
method Hierarchical topological clustering algorithm that infers persistence of outliers and clusters of arbitrary shape from data hierarchy.
result The algorithm can provide meaningful clusters in complex datasets.
A new clustering algorithm GDT improves on HDBSCAN for uneven data.
problem Data clustering with uneven distribution and high noise.
method GDT combines local and global structures, forming local clusters and estimating a global topological graph based on connectivity between clusters.
result GDT achieves SOTA performance on various datasets with low time complexity.
New method reduces clustering time and improves accuracy.
problem High time and space complexity in spectral clustering.
method Approximate spectral clustering using GNG network topology.
result Equal or better clustering performance than traditional SC.
FCM clustering adapts to persistence diagrams for topological data analysis.
problem Integrating topological data into machine learning workflows.
method Adapting Fuzzy c-Means to persistence diagrams.
result FCM clustering captures topological structure without additional processing.
CAGNN learns graph embeddings without labels by clustering and refining graph topology.
problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.
The paper uses TDA to select stocks for a sparse portfolio, improving performance across market scenarios.
problem Sparse portfolio selection in financial markets.
method Topological data analysis (TDA) for clustering stock price movements.
result The TDA-based clustering strategy significantly enhances sparse portfolio performance.
We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attributes in real-world graphs. We propose Non-linear Attributed Graph Clustering by Symmetric Non-negati…
Study evaluates clustering methods for Google Trends data.
problem Clustering high-dimensional, noisy time series data.
method Symbolic Aggregate Approximation (SAX), Enhanced SAX (eSAX), and Topological Data Analysis (TDA).
result TDA provides more balanced and meaningful groupings than SAX and eSAX.
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a distance or similarity metric on the points, then look for highly connected subgra…
New method clusters infant vocalizations using topological data.
problem Clustering infant vocalizations for developmental analysis.
method Topologically augmented signal representation with Dirichlet process mixture model.
result 8 clusters of vocalizations identified in the first 12 months of life.
TDA improves FX clustering quality over traditional methods.
problem Capturing complex currency co-movements in FX markets.
method Topological Data Analysis (TDA) compared to traditional statistical methods on monthly FX returns.
result TDA-based clustering yields more compact and well-separated clusters.
Study resolves conjecture linking two algebraic structures on surfaces.
problem Compatibility of skein and cluster algebra structures on surfaces.
method Established compatibility between skein and cluster algebras of surfaces.
result Cluster algebra of positive genus surfaces is not finitely generated.
This paper presents a new clustering algorithm for space-time data based on the concepts of topological data analysis and in particular, persistent homology. Employing persistent homology - a flexible mathematical tool from algebraic topology used to extract topological information from data - in unsupervised learning …
New method phenotypes sleep apnea patients using time series analysis.
problem Traditional diagnosis of sleep apnea is insufficient for capturing its multi-faceted outcomes.
method Fuzzy clustering in time and frequency domains, and persistent homology for topological analysis.
result Phenotyping patients improves understanding of sleep apnea.
Characterizes pseudo-Anosov mapping classes using cluster algebra techniques.
problem Characterize pseudo-Anosov mapping classes purely in terms of shear coordinates.
method Uses cluster algebraic generalization and tropical cluster transformations.
result Algebraic entropies of cluster transformations match topological entropy.
This paper provides new algorithms for distributed clustering for two popular center-based objectives, k-median and k-means. These algorithms have provable guarantees and improve communication complexity over existing approaches. Following a classic approach in clustering by \cite{har2004coresets}, we reduce the proble…
Paper proves k-means clustering works on persistence diagrams.
problem Complex geometry of persistence diagram space.
method Proves convergence of k-means on persistence diagram space. result Performance of k-means on persistence diagrams and measures is superior. An adaptive clustering algorithm learns from evolving data without manual tuning.
problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.
Study cosmic structures using Topological Data Analysis and Persistence Energy.
problem Investigate cosmic web evolution in ΛCDM cosmologies. method Apply LITE method to embed persistence diagrams into vector spaces and analyze cosmic structures.
result Discover a correlation between Persistence Energy and redshift values.
Study of cluster and skein algebras for surfaces, showing their connection.
problem Understanding algebraic structures of curve algebras on surfaces.
method Generalization and explicit definition of maps between cluster and skein algebras.
result Explicit maps between cluster and skein algebras, showing their close relationship.
This paper presents a novel time series clustering method, the self-organising eigenspace map (SOEM), based on a generalisation of the well-known self-organising feature map (SOFM). The SOEM operates on the eigenspaces of the embedded covariance structures of time series which are related directly to modes in those tim…
The paper connects Legendrian links to cluster algebras via microlocal methods.
problem Understanding the relationship between Legendrian links and cluster algebras.
method Microlocal parallel transport of sheaf quantizations of Lagrangian fillings.
result Existence of quasi-cluster A-structures and cluster Poisson structures. We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space X, and output a clustering of the data based on the selection of a topological model for the connected components of X. Both algorithms work by selectin…
New method integrates topological knowledge into data embeddings.
problem Lack of general tools to incorporate prior topological knowledge into embeddings.
method Introduces new topological losses to topologically regularize data embeddings.
result Natural representation of simple models like clusters and flares.
We introduce a graph-theoretic approach to extract clusters and hierarchies in complex data-sets in an unsupervised and deterministic manner, without the use of any prior information. This is achieved by building topologically embedded networks containing the subset of most significant links and analyzing the network s…
Stable density-based clustering via multiparameter persistence.
problem Density-based clustering stability to data perturbations.
method Degree-Rips construction, correspondence-interleaving distance, multiparameter stability analysis.
result Persistable pipeline yields stable, consistent density-based clustering.
System uses TDA for user segmentation and demand forecasting.
problem User loyalty and demand forecasting challenges.
method TDA-based clustering of time series data with matrix factorization.
result Significantly higher accuracy in clustering and demand forecasting.
A novel topological method analyzes fMRI data over time.
problem Analyzing time-varying fMRI data due to noise and person-to-person variation.
method Encoding each time point as a persistence diagram of topological features.
result Time-varying persistence diagrams can cluster participants and study brain state trajectories.
AuToMATo clusters data without tuning parameters, outperforming others.
problem Clustering data efficiently and without manual tuning.
method Combines ToMATo with bootstrapping for density estimation.
result Performs well across various clustering algorithms and applications.
New metric improves clustering in persistent homology.
problem Improving clustering accuracy in persistent homology.
method Defined a new non-archimedean cophenetic metric.
result Cophenetic metric enhances clustering quality and inter-relations.
A topological approach to stratification learning is developed for point cloud data drawn from a stratified space. Given such data, our objective is to infer which points belong to the same strata. First we define a multi-scale notion of a stratified space, giving a stratification for each radius level. We then use met…
In this paper, we show that Alexander polynomials for any 2-bridge knots are specializations of cluster variables. A key tool is an ancestral triangle which appeared in both quantum topology and hyperbolic geometry in different ways.
We prove that the optimal way to enclose and separate four planar regions with equal area using the less possible perimeter requires all regions to be connected. Moreover, the topology of such optimal clusters is uniquely determined.
The paper analyzes diffusion condensation for data geometry and topology.
problem Understanding the geometry and topology of high-dimensional data.
method Time-inhomogeneous diffusion process with geometric, spectral, and topological analysis.
result The condensation process defines intrinsic condensation homology and ambient persistent homology.
Novel graph network learns hierarchical network structure.
problem Lack of information in hierarchical network topology.
method Hierarchical clustering for multiscale decomposition, graph convolutional layers.
result Competitive performance on citation network benchmark.
The paper tackles noisy combinations of continuous and step functions, providing conditions for their identification.
problem Recovering noisy observations as a combination of continuous and step functions.
method Topological and local properties of the functions are used to determine conditions for identification. A practical estimation algorithm is provided.
result Conditions for the identification of continuous and step functions based on their global and local properties.
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of, graph spectral clustering. The algorithm involves only sparse eigenproblems, and is …
Kleinberg introduced three natural clustering properties, or axioms, and showed they cannot be simultaneously satisfied by any clustering algorithm. We present a new clustering property, Monotonic Consistency, which avoids the well-known problematic behaviour of Kleinberg's Consistency axiom, and the impossibility resu…
Machine learning uncovers hidden patterns in Calabi-Yau hypersurfaces.
problem Identifying and clustering Calabi-Yau hypersurfaces from weighted-P4s.
method Supervised and unsupervised machine learning techniques.
result High accuracy in predicting topological parameters and identifying hypersurfaces.
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…
The study of higher-order homology embeddings for manifold topology.
problem Understanding the structure of higher-order homology embeddings to disclose geometric or topological information.
method Analysis of the null space of the k-th order Laplacian and proposing an algorithm to factorize the homology embedding. result The proposed spectral loop detection algorithm is more efficient and effective on various data types.
This work introduces novel methods to identify and compare cycles across topological objects.
problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.
TDA improves stock portfolio selection by analyzing data structure.
problem Traditional portfolio selection methods fail to handle stock market data complexities.
method Two-stage method involving time series generation and clustering with TDA features.
result TDA-based portfolio outperforms other methods consistently over different time frames.
ClusterGraph visualizes and simplifies multidimensional data clusters for better understanding.
problem Lack of global structure information in clustering results.
method Combining clustering with Topological Data Analysis to provide global structure.
result ClusterGraph provides global layout information about clusters.
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topog…
Study automates feature selection and clustering for HFT stock price forecasting.
problem Manual feature selection and clustering for high-frequency trading (HFT) stock price forecasting.
method Dual competitive feature importance mechanism and clustering via shallow neural network topology.
result Enhanced forecasting ability of the RBFNN regressor through automated feature selection and clustering.