{'fraction_non_alphanumeric': 0.015625, 'fraction_numerical': 0.0, 'mean_word_length': 4.961240310077519, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Biclustering of Gene Expression Data Based on Bucketing Technique

With the development of microarray technologies, biclustering is becoming an important method to analyze gene expression data. This method searches a subset of genes and a subset of conditions in a given matrix, such that the genes have the similar behaviors over the conditions. Biclustering is an NP- complete problem, so some researches are devoted into finding a good algorithm to solve the problem. In this paper, we present a new algorithm to biclustering of gene expression data. The algorithm adopts bucketing technique to find a raw submatrix, then refines and extends the raw submatrix into a bicluster. Experiments show that our method has good performance on both simulation and real data.