Concept decompositions for large sparse text data using clustering
From MaRDI portal
Recommendations
Cited in
(88)- DALASS: variable selection in discriminant analysis via the LASSO
- NetWorkSpace: A coordination system for high-productivity environments
- Hierarchical topic modeling with nested hierarchical Dirichlet process
- Mutual information, phi-squared and model-based co-clustering for contingency tables
- Clustering sparse binary data with hierarchical Bayesian Bernoulli mixture model
- Automatic identification of rock fracture sets using finite mixture models
- Social regularized von Mises-Fisher mixture model for item recommendation
- Modeling share dynamics by extracting competition structure
- Class visualization of high-dimensional data with applications.
- A clustering method for data in cylindrical coordinates
- Low-rank approximations for computing observation impact in 4D-Var data assimilation
- The spherical \(k\)-means++ algorithm via local search
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Regularized bi-directional co-clustering
- Three kinds of discrete approximations of statistical multivariate distributions and their applications
- 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
- Parameter estimation and model-based clustering with spherical normal distribution on the unit hypersphere
- \(k\)-means clustering of extremes
- On interestingness measures of formal concepts
- Estimation of finite mixture models of skew-symmetric circular distributions
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- The seeding algorithms for spherical \(k\)-means clustering
- Directional co-clustering
- The importance of being clustered: uncluttering the trends of statistics from 1970 to 2015
- Beyond hybrid generative discriminative learning: spherical data classification
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Self-learning \(K\)-means clustering: a global optimization approach
- A statistical model of cluster stability
- On the smoothing of multinomial estimates using Liouville mixture models and applications
- SVD based initialization: A head start for nonnegative matrix factorization
- A unified view on clustering binary data
- Efficient streaming text clustering
- Building initial partitions through sampling techniques
- High-dimensional count data clustering based on an exponential approximation to the multinomial beta-Liouville distribution
- Recent advances in directional statistics
- Improvement of the fast clustering algorithm improved by K-means in the big data
- Clustering large unstructured document sets
- Summarization and search over geometric spaces
- Clustered matrix approximation
- A note on weighted fuzzy K-means clustering for concept decomposition
- Divisive clustering of high dimensional data streams
- A multiagent coordination approach to robust consensus clustering
- UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION
- Model-based clustering of probability density functions
- Resampling approach for cluster model selection
- A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data
- Poisson Kernel-Based Clustering on the Sphere: Convergence Properties, Identifiability, and a Method of Sampling
- BMS: An improved Dunn index for Document Clustering validation
- An intuitive clustering algorithm for spherical data with application to extrasolar planets
- Spherical k-Means++ Clustering
- On Bezdek-type possibilistic clustering for spherical data, its kernelization, and spectral clustering approach
- Sparse Matrix Computational Techniques in Concept Decomposition Matrix Approximation
- Generalized low rank approximations of matrices
- Generalized low rank approximations of matrices
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- Clustering directional data through depth functions
- A spectral approach to clustering numerical vectors as nodes in a network
- On model-based clustering of directional data with heavy tails
- Variational Bayes estimation of hierarchical Dirichlet-multinomial mixtures for text clustering
- Generalised Watson distribution on the hypersphere with applications to clustering
- Collaborative clustering of XML documents
- Document clustering
- Capturing thin structures in VOF simulations with two-plane reconstruction
- Space-filling designs on Riemannian manifolds
- Weighted fuzzy C-means: unsupervised feature selection to realize a target partition
- Learning over von Mises-Fisher distributions via a Wasserstein-like geometry
- A new approach for text bi-clustering
- Exploring new perspectives on the Ukrainian-Russian conflict using text mining techniques: an updated analysis
- Spherical random projection
- Wasserstein k-centers clustering for distributional data
- Context tree classification and clustering
- On estimation and order selection for multivariate extremes via clustering
- A supervised weeding method to cluster high dimensional predictors with application to job market analysis
- Learning social relationships: a network embedding-based approach for community detection via cosine-similarity
- Directional density-based clustering
- Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization
- Clustering-based low rank approximation method
- Unsupervised sentiment detection with mixtures of Beta-Liouville multinomial distributions
- Spherical double k-means: a co-clustering approach for textual data analysis
- An innovative approach to co-clustering of directional data: a methodological framework with an application on interregional mobility in the Italian national health care system
- Incremental graph construction enables robust spectral clustering of texts
- Semi-supervised model-based document clustering: a comparative study
- Discrete data clustering using finite mixture models
- Enhancing principal direction divisive clustering
This page was built for publication: Concept decompositions for large sparse text data using clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928973)
