Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4080120160 · Jun 202019922001200920172026
48 results for Cluster Discovery

Cluster-DAGs improve causal discovery with prior knowledge.

problem Finding cause-effect relationships from high-dimensional data.
method Cluster-DAGs as prior knowledge framework, modified constraint-based algorithms Cluster-PC and Cluster-FCI.
result Cluster-PC and Cluster-FCI outperform baselines without prior knowledge.

Forest Fire Clustering discovers cell types from single-cell data.

problem Discovering cell types from large-scale single-cell sequencing data.
method Iterative label propagation and parallelized Monte Carlo simulation.
result Forest Fire Clustering outperforms state-of-the-art methods on diverse benchmarks.

CSTS benchmarks time series clustering by evaluating correlation structures.

problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.

New framework learns complex AI attitudes from heterogeneous data.

problem Heterogeneous ordinal structure in AI attitudes, poorly captured by existing methods.
method Monotone Gaussian score embedding, BNP complexity discovery, confirmatory fixed-K estimation.
result Reduced holdout MSE by 25.8% over single-graph baseline.

STICC clusters geographic objects considering both spatial contiguity and attributes.

problem Discovering repeated geographic patterns with spatial contiguity.
method Spatial Toeplitz Inverse Covariance-Based Clustering (STICC) method.
result STICC significantly outperforms baseline methods in adjusted rand index and macro-F1 score.

Proposes a novel method to cluster individuals based on treatment effects.

problem Identifying subpopulations with different treatment responses.
method Clusters individuals using a learned kernel derived from causal forests, revealing latent subgroup structures.
result Captures meaningful treatment effect heterogeneity through kernelized clustering.

VICatMix clusters categorical biomedical data efficiently and selects relevant variables.

problem Efficient clustering of high-dimensional categorical biomedical data.
method Variational Bayesian finite mixture model with variational inference.
result Improves clustering accuracy and variable selection on noisy, high-dimensional data.

Cluster analysis is one of the essential tasks in data mining and knowledge discovery. Each type of data poses unique challenges in achieving relatively efficient partitioning of the data into homogeneous groups. While the algorithms for numeric data are relatively well studied in the literature, there are still challe…

2018-12-09abs ↗pdf ↗

The discovery of time series motifs has emerged as one of the most useful primitives in time series data mining. Researchers have shown its utility for exploratory data mining, summarization, visualization, segmentation, classification, clustering, and rule discovery. Although there has been more than a decade of exten…

2018-02-15abs ↗pdf ↗

Unified framework for clustering and learning causal graphs across subjects.

problem Bias and obscured subpopulation-specific dependencies in multivariate systems.
method Directed Acyclic Graph-based Dependency Clustering via Alternating Direction Method of Multipliers (DAG-DC-ADMM) integrated with Structural Equation Modeling (SEM).
result Unified framework recovers cluster-specific causal dependency structures with high true positive rate and low false discovery rate.

This paper applies secure multi-party computation to K-means clustering to protect private data.

problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.

With the recent popularity of graphical clustering methods, there has been an increased focus on the information between samples. We show how learning cluster structure using edge features naturally and simultaneously determines the most likely number of clusters and addresses data scale issues. These results are parti…

2016-05-05abs ↗pdf ↗

UCSL combines clustering with supervised learning to discover interpretable subtypes.

problem Discovering interpretable subtypes in datasets relevant to supervised tasks.
method UCSL (Unsupervised Clustering driven by Supervised Learning) framework integrating clustering and supervised learning.
result UCSL achieves +1.9 points in balanced accuracy for psychiatric diseases clustering.

A novel multi-resolution cluster detection (MCD) method is proposed to identify irregularly shaped clusters in space. Multi-scale test statistic on a single cell is derived based on likelihood ratio statistic for Bernoulli sequence, Poisson sequence and Normal sequence. A neighborhood variability measure is defined to …

2012-05-09abs ↗pdf ↗

We introduce Grinch, a new algorithm for large-scale, non-greedy hierarchical clustering with general linkage functions that compute arbitrary similarity between two point sets. The key components of Grinch are its rotate and graft subroutines that efficiently reconfigure the hierarchy as new points arrive, supporting …

2019-12-31abs ↗pdf ↗

DBULL learns new clusters without forgetting past knowledge in streaming unlabelled data.

problem Challenges in Unsupervised Lifelong Learning with evolving data distributions and class labels.
method Bayesian framework for incremental learning, Deep Bayesian Unsupervised Lifelong Learning (DBULL) algorithm, knowledge preservation mechanism, automatic cluster discovery.
result DBULL can progressively discover new clusters without forgetting past knowledge in unlabelled data.

Paper presents a workflow for reliable unsupervised learning in science.

problem Lack of standardization in unsupervised learning workflows for reproducible scientific discoveries.
method Structured workflow including data preparation, modeling, validation, and communication.
result Illustrates the importance of validation in unsupervised 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.

Sparse GEMINI selects relevant features for clustering without assumptions.

problem Feature selection in clustering with relevant clusters and variables.
method Discriminative clustering model maximizing GEMINI with l1 penalty.
result Sparse GEMINI selects relevant subsets of variables without prior hypotheses.

Cluster analysis is a fundamental tool for pattern discovery of complex heterogeneous data. Prevalent clustering methods mainly focus on vector or matrix-variate data and are not applicable to general-order tensors, which arise frequently in modern scientific and business applications. Moreover, there is a gap between …

2018-03-17abs ↗pdf ↗

New method discovers time series motifs under DTW, significantly reducing computations.

problem Discovering time series motifs under DTW is computationally challenging.
method Exact scalable method using novel lower bounds hierarchy.
result Prunes up to 99.99% of DTW computations under realistic settings.

Unsupervised method selects genes for tumor subtype discovery.

problem High-dimensional tumor gene expression data with noisy variables and heterogeneity.
method Autoencoders for latent space learning, Multiple Kernel Learning for feature selection, clustering.
result Lower redundancy and better clustering performance compared to benchmarks.

Randomization helps verify if data mining results are due to inherent patterns.

problem Verify if data mining results are due to inherent patterns or coincidental findings.
method Metropolis sampling based on local swaps to randomize data while preserving discovered patterns.
result Randomized data often reveals that clustering results imply frequent pattern discovery.

Neural node embeddings have recently emerged as a powerful representation for supervised learning tasks involving graph-structured data. We leverage this recent advance to develop a novel algorithm for unsupervised community discovery in graphs. Through extensive experimental studies on simulated and real-world data, w…

2016-11-09abs ↗pdf ↗

We develop a model to cluster time-series data with interval censoring, improving disease phenotyping.

problem Noise and interval censoring hinder clustering in disease phenotyping.
method Deep generative, continuous-time model that clusters time-series data while correcting for censorship.
result Our model corrects for interval censoring and recovers known clinical subtypes.

The paper proposes a method to predict the performance of data-driven algorithms using surrogate models.

problem Improving the performance prediction of data-driven knowledge discovery algorithms.
method Surrogate-assisted performance prediction using evolutionary modeling of clinical pathways.
result The proposed approach provides interpretable prediction of algorithm performance and quality.

A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering extreme points of empirical cross-document word-frequencies that correspond to novel …

2013-01-05abs ↗pdf ↗

CARVE validates clustering results using resampling and stability analysis.

problem Inconsistent and unreliable clustering results due to algorithm, preprocessing, and kk sensitivity.
method CARVE uses resampling-based validation and stability analysis to evaluate multiple clustering algorithms and hyperparameters.
result CARVE consistently recovers near-optimal clusterings and finer biological structure.

SI-CLAD improves clustering-based anomaly detection by controlling false positives.

problem Lack of reliability in clustering-based anomaly detection.
method SI-CLAD (Statistical Inference for CLustering-based Anomaly Detection) using Selective Inference framework.
result SI-CLAD rigorously controls false detection probability below a specified significance level.