scientific article
From MaRDI portal
Publication:3174147
zbMath1222.68139MaRDI QIDQ3174147
Arindam Banerjee, Joydeep Ghosh, Dharmendra S. Modha, Inderjit S. Dhillon, Srujana Merugu
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/banerjee07a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (21)
Diagonal latent block model for binary data ⋮ Co-clustering for binary and functional data ⋮ Semi-supervised latent block model with pairwise constraints ⋮ Prediction in Riemannian metrics derived from divergence functions ⋮ Parameter-less co-clustering for star-structured heterogeneous data ⋮ Co-clustering of multivariate functional data for the analysis of air pollution in the south of France ⋮ Co-Clustering Under the Maximum Norm ⋮ Mining order-preserving submatrices from probabilistic matrices ⋮ Deformed statistics Kullback-Leibler divergence minimization within a scaled Bregman framework ⋮ The latent topic block model for the co-clustering of textual interaction data ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Poisson degree corrected dynamic stochastic block model ⋮ Maximum entropy and empirical likelihood in length-biased setting: a comparison study ⋮ Detecting communities in \(K\)-partite \(K\)-uniform (hyper)networks ⋮ Hierarchical co-clustering: off-line and incremental approaches ⋮ Co-clustering under the maximum norm ⋮ Model selection for Gaussian latent block clustering with the integrated classification likelihood ⋮ MIB: using mutual information for biclustering gene expression data ⋮ Estimation and selection for the latent block model on categorical data ⋮ A classification for community discovery methods in complex networks ⋮ Approximation Algorithms for Tensor Clustering
This page was built for publication:
