Biclustering in data mining

DOI10.1016/j.cor.2007.01.005zbMath1144.68309OpenAlexW2090257125MaRDI 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

zbMATH Keywords

surveyclassificationclusteringdata miningbiclustering

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Related Items

Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Optimization and data mining in medicine ⋮ Recovering all generalized order-preserving submatrices: new exact formulations and algorithms ⋮ Finding checkerboard patterns via fractional 0-1 programming ⋮ Bi-objective optimization of biclustering with binary data ⋮ RP-LGMC: rating prediction based on local and global information with matrix clustering ⋮ Convex biclustering ⋮ SVD, discrepancy, and regular structure of contingency tables ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Uncovering block structures in large rectangular matrices ⋮ Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs ⋮ The penalized biclustering model and related algorithms ⋮ Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ Co-clustering spatial data using a generalized linear mixed model with application to the integrated pest management ⋮ Solving a class of feature selection problems via fractional 0--1 programming ⋮ Random walk biclustering for microarray data ⋮ Biclustering with heterogeneous variance ⋮ Heuristic search of exact biclusters in binary data ⋮ A novel attribute weighting algorithm for clustering high-dimensional categorical data ⋮ Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition ⋮ Agglomerative joint clustering of metabolic data with spike at zero: A Bayesian perspective ⋮ Complexity of modification problems for reciprocal best match graphs ⋮ Biclustering via Sparse Singular Value Decomposition ⋮ Biclustering scatter plots using data depth measures ⋮ Some aspects of response variable selection and estimation in multivariate linear regression ⋮ Exact and heuristic algorithms for the maximum weighted submatrix coverage problem ⋮ Unnamed Item ⋮ Machine-part cell formation using biclustering

Uses Software

• RCV1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Biclustering in data mining