The Cheng and Church Approach: Node Deletion Biclustering Algorithm
{"Image DocumentName": "The Cheng and Church Approach: Node Deletion Biclustering Algorithm", "Image ImageDescription": "In order to find all possible biclusters in an Expression Matrix all sub-matrices must be tested using the H score. Node Deletion. In a node deletion algorithm all columns and rows are tested for deletion. If removing a row or column decreases the H score of the Matrix than it is removed. This continues until it is not possible to decrease the H score further. This low H score coherent sub-matrix (bicluster) is then returned. The process then masks this located bicluster by inserting random numbers in place of it. And reiterates the process. R. Node Deletion.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}