Concept decompositions for large sparse text data using clustering
From MaRDI portal
Publication:5928973
DOI10.1023/A:1007612920971zbMath0970.68167WikidataQ56674907 ScholiaQ56674907MaRDI QIDQ5928973
Dharmendra S. Modha, Inderjit S. Dhillon
Publication date: 17 April 2001
Published in: Machine Learning (Search for Journal in Brave)
Related Items
Class visualization of high-dimensional data with applications. ⋮ Parameter estimation and model-based clustering with spherical normal distribution on the unit hypersphere ⋮ Mutual information, phi-squared and model-based co-clustering for contingency tables ⋮ Sparse Matrix Computational Techniques in Concept Decomposition Matrix Approximation ⋮ Semi-supervised model-based document clustering: a comparative study ⋮ Poisson Kernel-Based Clustering on the Sphere: Convergence Properties, Identifiability, and a Method of Sampling ⋮ Building initial partitions through sampling techniques ⋮ Divisive clustering of high dimensional data streams ⋮ Self-learning \(K\)-means clustering: a global optimization approach ⋮ BMS: An improved Dunn index for Document Clustering validation ⋮ Clustering sparse binary data with hierarchical Bayesian Bernoulli mixture model ⋮ Model-based clustering of probability density functions ⋮ High-dimensional count data clustering based on an exponential approximation to the multinomial beta-Liouville distribution ⋮ Recent advances in directional statistics ⋮ \(k\)-means clustering of extremes ⋮ A spectral approach to clustering numerical vectors as nodes in a network ⋮ Effective Heuristic Techniques for Combined Robust Clustering Problem ⋮ Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques ⋮ A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data ⋮ Resampling approach for cluster model selection ⋮ Clustering directional data through depth functions ⋮ On model-based clustering of directional data with heavy tails ⋮ Variational Bayes estimation of hierarchical Dirichlet-multinomial mixtures for text clustering ⋮ A statistical model of cluster stability ⋮ Generalised Watson distribution on the hypersphere with applications to clustering ⋮ On interestingness measures of formal concepts ⋮ Improvement of the fast clustering algorithm improved by \(K\)-means in the big data ⋮ Estimation of finite mixture models of skew-symmetric circular distributions ⋮ On the smoothing of multinomial estimates using Liouville mixture models and applications ⋮ An intuitive clustering algorithm for spherical data with application to extrasolar planets ⋮ Automatic identification of rock fracture sets using finite mixture models ⋮ Approximation algorithms for spherical \(k\)-means problem using local search scheme ⋮ Collaborative clustering of XML documents ⋮ Generalized low rank approximations of matrices ⋮ Social regularized von Mises-Fisher mixture model for item recommendation ⋮ A NOTE ON WEIGHTED FUZZY K-MEANS CLUSTERING FOR CONCEPT DECOMPOSITION ⋮ SVD based initialization: A head start for nonnegative matrix factorization ⋮ A MULTIAGENT COORDINATION APPROACH TO ROBUST CONSENSUS CLUSTERING ⋮ A clustering method for data in cylindrical coordinates ⋮ Discrete data clustering using finite mixture models ⋮ Generalized low rank approximations of matrices ⋮ Modeling share dynamics by extracting competition structure ⋮ A unified view on clustering binary data ⋮ Low-rank approximations for computing observation impact in 4D-Var data assimilation ⋮ UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION ⋮ Enhancing principal direction divisive clustering ⋮ The spherical \(k\)-means++ algorithm via local search ⋮ Local search algorithm for the spherical \(k\)-means problem with outliers ⋮ Summarization and Search Over Geometric Spaces ⋮ DALASS: variable selection in discriminant analysis via the LASSO ⋮ Regularized bi-directional co-clustering ⋮ The seeding algorithms for spherical \(k\)-means clustering ⋮ Three kinds of discrete approximations of statistical multivariate distributions and their applications ⋮ Clustered Matrix Approximation ⋮ Directional co-clustering ⋮ NetWorkSpace: A coordination system for high-productivity environments ⋮ The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015 ⋮ The bi-criteria seeding algorithms for two variants of \(k\)-means problem ⋮ The seeding algorithm for spherical \(k\)-means clustering with penalties ⋮ The spherical \(k\)-means++ algorithm via local search scheme ⋮ An approximation algorithm for the spherical \(k\)-means problem with outliers by local search ⋮ Efficient streaming text clustering ⋮ Hierarchical topic modeling with nested hierarchical Dirichlet process ⋮ Beyond hybrid generative discriminative learning: spherical data classification ⋮ Spherical k-Means++ Clustering ⋮ On Bezdek-Type Possibilistic Clustering for Spherical Data, Its Kernelization, and Spectral Clustering Approach ⋮ SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
This page was built for publication: Concept decompositions for large sparse text data using clustering
