Parameter-wise co-clustering for high-dimensional data
원문 초록
In recent years, data dimensionality has increasingly become a concern, leading to many parameter and dimension reduction techniques being proposed in the literature. A parameter-wise co-clustering model, for data modelled via continuous random variables, is presented. The proposed model, although allowing more flexibility, still maintains the very high degree of parsimony achieved by traditional co-clustering. A stochastic expectation-maximization (SEM) algorithm along with a Gibbs sampler is used for parameter estimation and an integrated complete log-likelihood criterion is used for model selection. Simulated and real datasets are used for illustration and comparison with traditional co-clustering.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ALPCAHUS: Subspace Clustering for Heteroscedastic Data
LASSO-ODE: A framework for mechanistic model identifiability and selection in disease transmission modeling
On the performance of multi-fidelity and reduced-dimensional neural emulators for inference of physiologic boundary conditions
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.