Biclustering in data mining
From MaRDI portal
Publication:2475854
DOI10.1016/j.cor.2007.01.005zbMath1144.68309MaRDI QIDQ2475854
Stanislav Busygin, Panos M. Pardalos, Oleg A. Prokopyev
Publication date: 11 March 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.01.005
Related Items
Biclustering scatter plots using data depth measures, Unnamed Item, The penalized biclustering model and related algorithms, Biclustering with heterogeneous variance, Convex biclustering, Uncovering block structures in large rectangular matrices, SVD, discrepancy, and regular structure of contingency tables, Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs, Guaranteed clustering and biclustering via semidefinite programming, Co-clustering spatial data using a generalized linear mixed model with application to the integrated pest management, Finding checkerboard patterns via fractional 0-1 programming, Optimization and data mining in medicine, Recovering all generalized order-preserving submatrices: new exact formulations and algorithms, Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult, Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition, Heuristic search of exact biclusters in binary data, Some aspects of response variable selection and estimation in multivariate linear regression, Exact and heuristic algorithms for the maximum weighted submatrix coverage problem, Tensor clustering with planted structures: statistical optimality and computational limits, Generalized co-clustering analysis via regularized alternating least squares, Solving a class of feature selection problems via fractional 0--1 programming, A novel attribute weighting algorithm for clustering high-dimensional categorical data, Complexity of modification problems for reciprocal best match graphs, Machine-part cell formation using biclustering, Random walk biclustering for microarray data, Bi-objective optimization of biclustering with binary data, RP-LGMC: rating prediction based on local and global information with matrix clustering, Agglomerative joint clustering of metabolic data with spike at zero: A Bayesian perspective, Biclustering via Sparse Singular Value Decomposition
Uses Software
Cites Work
- Optimal partitions having disjoint convex and conic hulls
- The Pareto set of the partition bargaining problem
- Logical analysis of numerical data
- Linear-shaped partition problems
- Hierarchical clustering schemes
- Feature selection for consistent biclustering via fractional 0-1 programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
