Random walk biclustering for microarray data

DOI10.1016/j.ins.2007.11.007zbMath1134.68052OpenAlexW1989504887MaRDI QIDQ2476780

Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti

Publication date: 12 March 2008

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

Full work available at URL: https://doi.org/10.1016/j.ins.2007.11.007

zbMATH Keywords

local searchmicroarray databiclustering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction

Cites Work

• Cluster validation techniques for genome expression data
• Biclustering in data mining
• Feature selection for consistent biclustering via fractional 0-1 programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Random walk biclustering for microarray data