Simultaneous Clustering and Model Selection for Tensor Affinities
Estimating the number of clusters remains a difficult model selection problem. We consider this problem in the domain where the affinity relations involve groups of more than two nodes. Building on the previous formulation for the pairwise affinity case, we exploit the mathematical structures in the higher order case. We express the original minimal-rank and positive semi-definite (PSD) constraints in a form amenable for numerical implementation, as the original constraints are either intractable or even undefined in general in the higher order case. To scale to large problem sizes, we also propose an alternative formulation, so that it can be efficiently solved via stochastic optimization in an online fashion. We evaluate our algorithm with different applications to demonstrate its superiority, and show it can adapt to varying levels of unbalancedness of clusters.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringmodelModel SelectionStochastic OptimizationSimilar Papers 제목 키워드 기반
Uniform tensor clustering by jointly exploring sample affinities of various orders
Conventional clustering methods based on pairwise affinity usually suffer from the concentration effect while processing huge dimensional features yet low sample sizes data, resulting in inaccuracy to encode the sample p…
ClusteringGeneral Tensor Spectral Co-clustering for Higher-Order Data
Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices derived from a network. We develop a new …
ClusteringSubspace Clustering via Tangent Cones
Given samples lying on any of a number of subspaces, subspace clustering is the task of grouping the samples based on the their corresponding subspaces. Many subspace clustering methods operate by assigning a measure of …
ClusteringGraph ClusteringVariational Co-embedding Learning for Attributed Network Clustering
Recent works for attributed network clustering utilize graph convolution to obtain node embeddings and simultaneously perform clustering assignments on the embedding space. It is effective since graph convolution combine…
AttributeClusteringNode ClusteringRepresentation LearningRobust Data Clustering with Outliers via Transformed Tensor Low-Rank Representation
Recently, tensor low-rank representation (TLRR) has become a popular tool for tensor data recovery and clustering, due to its empirical success and theoretical guarantees. However, existing TLRR methods consider Gaussian…
ClusteringOutlier Detection