Bi-objective optimization of biclustering with binary data

DOI10.1016/j.ins.2020.05.078zbMath1474.62229arXiv2002.04711OpenAlexW3029068183MaRDI QIDQ2666768

Saïd Hanafi, Fred Glover, Gintaras Palubeckis

Publication date: 23 November 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.04711

zbMATH Keywords

bi-objective optimizationbiclique\(\varepsilon\)-constraint methodbi-clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multi-objective and goal programming (90C29)

Related Items (2)

FuBiNFS -- fuzzy biclustering neuro-fuzzy system ⋮ Multi-objective soft subspace clustering in the composite kernel space

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Bipartite dimensions and bipartite degrees of graphs
• Can visibility graphs be represented compactly?
• The maximum edge biclique problem is NP-complete
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Path relinking for unconstrained binary quadratic programming
• Biclustering in data mining
• Mathematical classification and clustering
• Integer Programming of Biclustering Based on Graph Models
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: Bi-objective optimization of biclustering with binary data