Clustering Three-Way Data with Outliers
Katharine M. Clark, Paul D. McNicholas

TL;DR
This paper introduces an extension of the OCLUST algorithm for clustering matrix-variate normal data, effectively detecting and trimming outliers in complex structured data like images and time series.
Contribution
It presents a novel iterative method for outlier detection in matrix-variate normal models, addressing a gap in handling outliers in matrix-structured data.
Findings
Effective outlier detection in matrix-variate data
Extension of OCLUST algorithm to matrix data
Improved clustering robustness with outliers
Abstract
Matrix-variate distributions are a recent addition to the model-based clustering field, thereby making it possible to analyze data in matrix form with complex structure such as images and time series. Due to its recent appearance, there is limited literature on matrix-variate data, with even less on dealing with outliers in these models. An approach for clustering matrix-variate normal data with outliers is discussed. The approach, which uses the distribution of subset log-likelihoods, extends the OCLUST algorithm to matrix-variate normal data and uses an iterative approach to detect and trim outliers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Complex Network Analysis Techniques · Data Visualization and Analytics
