An Exact Algorithm for Finding k-Biclique Vertex Partitions of Bipartites
Biclustering has been extensively studied in many fields such as data mining,e-commerce,computational biology,information security,etc.Problems of finding bicliques in bipartite,which are variants of biclustering,have received much attention in recent years due to its importance for bi clustering.The k-biclique vertex partition problem proposed by Bein et al.is one of finding bicliques problems in bipartite.Its aim is to find k bicliques (k≤k) such that each vertex of the bipartite occurs in exactly one member of these bicliques.First,we give a sufficient condition of the k-biclique vertex partition problem.Moreover,we present an exact algorithm for finding k-biclique vertex partitions of a bipartite.Finally,we propose a method to generate simulated datasets used to test the algorithm.Experimental results on simulated datasets show that the algorithm can find k-biclique vertex parti tions of a bipartite with relatively fast speed.
algorithm complexity bipartite biclique k-biclique vertex partition
Peiqiang Liu
School of Computer Science and Technology, Shandong Institute of Business and Technology, Yantai 264005, China ; School of Computer Science and Technology, Shandong University, Jinan 250101, China ; Key Laboratory of Intelligent Information Processing in Universities of Shandong(Shandong In stitute of Business and Technology
国际会议
太原
英文
450-454
2013-03-22(万方平台首次上网日期,不代表论文的发表时间)