Soft-MSM is a smooth, gradient-enabled version of the context-aware MSM distance for time series alignment that outperforms Soft-DTW alternatives in clustering and nearest-centroid classification.
Breunig, Hans-Peter Kriegel, and Joerg Sander
7 Pith papers cite this work, alongside 1,289 external citations. Polarity classification is still indexing.
7
Pith papers citing it
1,289
external citations · external index
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 7roles
background 2polarities
background 2representative citing papers
GSHAC performs exact HAC on large geographic point sets by building a sparse geodesic graph and proving that connected-component subproblems yield identical results to the dense algorithm for all standard linkages at cut heights below the sparsity threshold.
VarWISE catalog identifies 457,080 high-confidence infrared variables (49.81% new) and an extended set of 1.9 million from NEOWISE photometry via spatial clustering, VARnet detection, and XGBoost classification.
Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.
SmartIterator supplies method-specific workflows and coordinated visualizations to systematically supervise and interpret parameter sweeps of unsupervised data grouping techniques.
Extends unsupervised eye contact detection for mobile scenarios, reporting significant performance gains on two datasets and new attention metrics.
The effectiveness of dimensionality reduction before clustering depends on matching the specific technique and target dimension count to the data geometry and the clustering algorithm used.
citing papers explorer
-
Soft-MSM: Differentiable Context-Aware Elastic Alignment for Time Series
Soft-MSM is a smooth, gradient-enabled version of the context-aware MSM distance for time series alignment that outperforms Soft-DTW alternatives in clustering and nearest-centroid classification.
-
Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
GSHAC performs exact HAC on large geographic point sets by building a sparse geodesic graph and proving that connected-component subproblems yield identical results to the dense algorithm for all standard linkages at cut heights below the sparsity threshold.
-
VarWISE: Infrared Variability via NEOWISE Single Exposure Photometry
VarWISE catalog identifies 457,080 high-confidence infrared variables (49.81% new) and an extended set of 1.9 million from NEOWISE photometry via spatial clustering, VARnet detection, and XGBoost classification.
-
Lumbermark: Resistant Clustering by Chopping Up Mutual Reachability Minimum Spanning Trees
Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.
-
SmartIterator: Visual Analytics Workflows for Supervising Unsupervised Data Grouping
SmartIterator supplies method-specific workflows and coordinated visualizations to systematically supervise and interpret parameter sweeps of unsupervised data grouping techniques.
-
Accurate and Robust Eye Contact Detection During Everyday Mobile Device Interactions
Extends unsupervised eye contact detection for mobile scenarios, reporting significant performance gains on two datasets and new attention metrics.
-
Assessing the impact of dimensionality reduction on clustering performance -- a systematic study
The effectiveness of dimensionality reduction before clustering depends on matching the specific technique and target dimension count to the data geometry and the clustering algorithm used.