An improved heuristic for consistent biclustering problems

DOI10.1007/978-3-540-76784-8_5MaRDI QIDQ4607141zbMATH OpenOpenAlexFDO

Authors Artyom Nahapetyan, Stanislav Busygin, Panos M. Pardalos

Publication date 12 March 2018

Published in Applied Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76784-8_5

zbMATH Keywords

``checkerboard patternbiclustering problemsblock clustering supervised biclusteringheatmap builder softwarehuman gene expression index

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) General biostatistics (92B15)

Recommendations

• Feature selection for consistent biclustering via fractional 0-1 programming
• Biclustering in data mining
• An approximation ratio for biclustering
• Approximation Algorithms for Biclustering Problems
• Biclustering via structured regularized matrix decomposition

Cites work

• Feature selection for consistent biclustering via fractional 0-1 programming

Cited in

(5)

• Demand forecasting of perishable farm products using support vector machine
• Feature selection for consistent biclustering via fractional 0-1 programming
• A Biclustering Framework for Consensus Problems
• Effective Heuristic Techniques for Combined Robust Clustering Problem
• A survey of data mining techniques applied to agriculture

Describes a project that uses

Uses Software

• CLIFF

This page was built for publication: An improved heuristic for consistent biclustering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607141)