A Basis Approach to Surface Clustering

02/02/2021
by   Adriano Zanin Zambom, et al.
0

This paper presents a novel method for clustering surfaces. The proposal involves first using basis functions in a tensor product to smooth the data and thus reduce the dimension to a finite number of coefficients, and then using these estimated coefficients to cluster the surfaces via the k-means algorithm. An extension of the algorithm to clustering tensors is also discussed. We show that the proposed algorithm exhibits the property of strong consistency, with or without measurement errors, in correctly clustering the data as the sample size increases. Simulation studies suggest that the proposed method outperforms the benchmark k-means algorithm which uses the original vectorized data. In addition, an EGG real data example is considered to illustrate the practical application of the proposal.

READ FULL TEXT
research
07/28/2020

Collective Spectral Density Estimation and Clustering for Spatially-Correlated Data

In this paper, we develop a method for estimating and clustering two-dim...
research
12/12/2013

Clustering for high-dimension, low-sample size data using distance vectors

In high-dimension, low-sample size (HDLSS) data, it is not always true t...
research
03/14/2023

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Several methods for triclustering three-dimensional data require the clu...
research
12/18/2020

A Doubly-Enhanced EM Algorithm for Model-Based Tensor Clustering

Modern scientific studies often collect data sets in the forms of tensor...
research
06/19/2015

Representation Learning for Clustering: A Statistical Framework

We address the problem of communicating domain knowledge from a user to ...
research
01/10/2020

Entropy Regularized Power k-Means Clustering

Despite its well-known shortcomings, k-means remains one of the most wid...

Please sign up or login with your details

Forgot password? Click here to reset