Paper studies clustering with transfer learning in high dimensions.
problem Improving clustering accuracy in high-dimensional settings with related datasets.
method Developed a minimax-optimal transfer-assisted clustering procedure.
result Characterized phase transitions for consistent target clustering.
New approach improves domain adaptation by enforcing cluster assumption in target domain.
problem Lack of robustness in target classifier due to violation of cluster assumption.
method Enforces cluster assumption in target domain (Target Consistency) paired with Class-Level InVariance.
result Significant improvement in image classification and segmentation benchmarks.
This paper analyzes l1-regularized PageRank for local graph clustering, proving its effectiveness and efficiency.
problem Local graph clustering in large graphs, focusing on recovering a single target cluster given a seed node.
method Statistical analysis of l1-regularized PageRank method for recovery of a target cluster.
result l1-regularized PageRank recovers the full target cluster with bounded false positives and exactly the target cluster if the seed is connected solely to it.
A method for clustering using transfer learning from similar labeled data.
problem Clustering with datasets having different features and labeled data.
method Constructing meta-features to describe structural characteristics of data and transferring them between source and target domains.
result The method is efficient and works under arbitrary feature descriptions of source and target domains with smaller complexity.
Elastic co-clustering improves clustering of single-cell genomic data.
problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.
The learning of mixture models can be viewed as a clustering problem. Indeed, given data samples independently generated from a mixture of distributions, we often would like to find the {\it correct target clustering} of the samples according to which component distribution they were generated from. For a clustering pr…
A new method uncovers intrinsic data structures for unsupervised domain adaptation.
problem Learning domain-aligned features can damage intrinsic target discrimination.
method Structurally Regularized Deep Clustering (H-SRDC) integrating structural source regularization.
result H-SRDC outperforms existing methods in image classification and semantic segmentation.
Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target …
Unsupervised models can provide supplementary soft constraints to help classify new target data under the assumption that similar objects in the target set are more likely to share the same class label. Such models can also help detect possible differences between training and target distributions, which is useful in a…
The paper explores fair clustering, a niche area in machine learning.
problem Fairness in clustering remains underexplored despite its importance.
method Assesses existing work and proposes new directions for fair clustering.
result Widening normative principles and knowledge of downstream processes can enhance fair clustering research.
Trans-GLMC tackles source heterogeneity in transfer learning for structured clusters.
problem Source heterogeneity makes it hard to use multiple related auxiliary sources effectively.
method Trans-GLMC constructs clusters of sources, then combines global fusion, within-cluster refinement, and target debiasing.
result Improves facility-specific prediction and identifies interpretable communities of hospitals with mutual transferability.
Cluster-based ZSL for multivariate data predicts unseen classes.
problem Predicting unseen classes in multivariate data without labeled training data.
method Cluster-based approach: classify data based on its distance from training clusters.
result The method outperforms existing ZSL methods for multivariate binary classification.
Improves neural network regression performance using encoder-decoder approach.
problem Suboptimal regression results from classical methods in neural networks.
method Proposes a new method using an encoder-decoder approach for regression.
result Shows improved performance on various real-world datasets.
Graph-Laplacians and their spectral embeddings play an important role in multiple areas of machine learning. This paper is focused on graph-Laplacian dimension reduction for the spectral clustering of data as a primary application. Spectral embedding provides a low-dimensional parametrization of the data manifold which…
Local graph clustering improves with noisy labels, enhancing accuracy and performance.
problem Local graph clustering with noisy labels for node information.
method Constructing a weighted graph with noisy labels and using diffusion-based clustering.
result Diffusion in the weighted graph yields more accurate recovery of target clusters.
SC-InfoNCE improves InfoNCE for feature clustering in contrastive learning.
problem Lack of theoretical understanding of InfoNCE's feature clustering mechanism.
method Introduced a transition probability matrix to model data augmentation dynamics and optimize feature similarity.
result SC-InfoNCE achieves strong performance across diverse domains, aligning feature similarity with downstream data.
INCAD clusters and detects anomalies in streaming data without thresholds.
problem Clustering and anomaly detection for streaming data with unknown clusters and thresholds.
method Probabilistic clustering and anomaly detection in a streaming model.
result More reliable definition of normal vs abnormal behavior in streaming data.
In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. In contrast, the "search" problem of this paper aims to only find the nodes in a "single" such community, the target, out of the many communities that may exist. To do so , we are …
MASC balances dataset representation using affinity clustering and distribution discrepancies.
problem Representation bias in datasets due to group imbalance.
method MASC uses affinity clustering and pairwise distribution discrepancies to balance non-protected and protected groups.
result MASC effectively debiases target datasets, comparable to existing methods.
Selective pseudo-labeling improves unsupervised domain adaptation.
problem Classifying unlabeled target domain samples with labeled source domain samples.
method Structured prediction for selective pseudo-labeling.
result Selective pseudo-labeling outperforms state-of-the-art methods.
The automatic reconstruction of three-dimensional particle tracks from Active Target Time Projection Chambers data can be a challenging task, especially in the presence of noise. In this article, we propose a non-parametric algorithm that is based on the idea of clustering point triplets instead of the original points.…
FedMCC learns from distributed data to cluster and extract features.
problem Learning from distributed data and clustering.
method Federated Momentum Contrastive Clustering (FedMCC) framework.
result FedMCC outperforms existing methods in linear evaluation and semi-supervised learning.
Proposes a new clustering algorithm using random forest.
problem Density-based clustering with optimal level determination.
method Best-scored random forest algorithm.
result Guaranteed consistency and fast convergence rates.
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.
problem Imbalanced influence in fuzzy c-means clustering for large vs. small clusters.
method Hybrid fuzzy-crisp algorithm combining linear and quadratic membership functions, setting exact zero membership for sufficiently distant points.
result The hybrid algorithm outperforms conventional fuzzy and crisp clustering methods on imbalanced datasets.
Proposes a novel MTL approach based on bias-variance analysis.
problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.
This paper automates mining of COVID-19 scholarly articles using machine learning.
problem Time-consuming and impractical manual extraction of relevant COVID-19 research articles.
method Used machine learning approaches, specifically clustering and parallel one-class support vector machines (OCSVMs), on the CORD-19 dataset.
result Parallel OCSVMs outperform other methods for both original and reduced feature space.
In this work, we propose a novel node splitting method for regression trees and incorporate it into the regression forest framework. Unlike traditional binary splitting, where the splitting rule is selected from a predefined set of binary splitting rules via trial-and-error, the proposed node splitting method first fin…
This paper introduces a privacy-aware Bayesian approach that combines ensembles of classifiers and clusterers to perform semi-supervised and transductive learning. We consider scenarios where instances and their classification/clustering results are distributed across different data sites and have sharing restrictions.…
New clustering method adapts to data structure.
problem Natural adaptability of clustering order in EM algorithm.
method Minimizes mixing entropy to define relative entropic order.
result Empirical relative entropic order is consistent.
Domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable. A recent approach for finding a common representation of the two domains is via domain adversarial training (Ganin & Lempitsky, 2015), which attempt…
Spatial machine learning improves poverty targeting in Indonesia.
problem Conventional PMT methods have high exclusion and inclusion errors due to spatial dependencies and regional heterogeneity.
method Integrates spatial contiguity matrices into SML models to identify and compare poverty clusters.
result SML reduces exclusion errors from 28% to 20% compared to standard machine learning models.
A new framework for predictive clustering and optimization.
problem Finding clusters of data that yield low error on a supervised target.
method Generalized optimization framework using MILP and MM for scalability.
result Models can uncover different interpretable discrete cluster structures.
We propose JECL, a method for clustering image-caption pairs by training parallel encoders with regularized clustering and alignment objectives, simultaneously learning both representations and cluster assignments. These image-caption pairs arise frequently in high-value applications where structured training data is e…
Two-stage TMLE reduces bias and improves efficiency in CRTs.
problem Differential outcome measurement and imbalance in baseline predictors in CRTs.
method Two-stage targeted minimum loss-based estimator (TMLE) to adjust for baseline covariates.
result Our approach nearly eliminates bias due to differential outcome measurement.
The paper optimizes portfolios using clustering and Sharpe ratio-based optimization.
problem Optimizing portfolio performance in financial modeling.
method Combines K-Means clustering for asset segmentation and Sharpe ratio-based optimization.
result Optimized portfolios outperform traditional equal-weighted benchmarks.
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.
MC-GMENN improves neural networks for clustered data using Monte Carlo methods.
problem Improving neural network performance on clustered data with correlations.
method MC-GMENN employs Monte Carlo methods to train generalized mixed effects neural networks.
result MC-GMENN outperforms existing models in generalization and quantifying inter-cluster variance.
Proposes a robust FMR model for handling sample heterogeneity.
problem Handling sample heterogeneity with a single regression model.
method Clusters samples and jointly models multiple incomplete mixed-type targets.
result Achieves state-of-the-art performance on synthetic and real-world data.
Proposes methods for local clustering in attributed graphs.
problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.
The independence clustering problem is considered in the following formulation: given a set S of random variables, it is required to find the finest partitioning {U1,…,Uk} of S into clusters such that the clusters U1,…,Uk are mutually independent. Since mutual independence is the target, pairwise …
The paper investigates learning conditional distributions on multi-dimensional spaces using clustering and neural networks.
problem Learning conditional distributions on multi-dimensional spaces with varying dimensions.
method The approach involves clustering data near varying query points in the feature space to create empirical measures in the target space using two clustering schemes: fixed-radius ball and nearest neighbors. The convergence rates of both methods are analyzed, and the nearest neighbors method is incorporated into neural network training.
result The empirical analysis shows that the nearest neighbors method has better performance in practice and can adapt to a suitable level of Lipschitz continuity locally.
We propose a methodology to explore and measure the pairwise correlations that exist between variables in a dataset. The methodology leverages copulas for encoding dependence between two variables, state-of-the-art optimal transport for providing a relevant geometry to the copulas, and clustering for summarizing the ma…
Proposes a weighted conformal approach for cluster label uncertainty.
problem Cluster label uncertainty in unlabeled data.
method Develops a conformal inference algorithm to correct label mismatch.
result Improves confidence set size in nonlinear and high-dimensional clustering.
Data-target pairing is an important step towards multi-target localization for the intelligent operation of unmanned systems. Target localization plays a crucial role in numerous applications, such as search, and rescue missions, traffic management and surveillance. The objective of this paper is to present an innovati…
New framework quantifies uncertainty in flexible density-based clustering.
problem Uncertainty quantification in clustering with non-parametric density estimation.
method Martingale posterior distributions and density-based clustering.
result Efficient GPU-compatible inference on clustering structures with uncertainty.
Motivated by the task of 2-D classification in single particle reconstruction by cryo-electron microscopy (cryo-EM), we consider the problem of heterogeneous multireference alignment of images. In this problem, the goal is to estimate a (typically small) set of target images from a (typically large) collection of obser…
The extraction of clusters from a dataset which includes multiple clusters and a significant background component is a non-trivial task of practical importance. In image analysis this manifests for example in anomaly detection and target detection. The traditional spectral clustering algorithm, which relies on the lead…
Leveraged ETFs can outperform their targets in certain market conditions, contrary to the volatility drag hypothesis.
problem The long-term performance decay of leveraged ETFs due to volatility drag.
method Unified framework incorporating AR(1) and AR-GARCH models, continuous-time regime switching, and flexible rebalancing frequencies.
result Return dynamics, including return autocorrelation, volatility clustering, and regime persistence, determine LETF performance.