Monochromatic Bi-Clustering.
ICML(2013)
摘要
Given an instance G = (V,E), as well as a cost r, we construct an instance M , with a 2, 2-MCBC cost 2r |M | . The construction is shown in figure 3. We start by defining the “left half” of the matrix M . For every vertex v ∈ V we introduce n = |V | rows r 1 . . . r n and n columns c1 . . . c v n. We set the entries of M corresponding to rows and columns of the same vertex (the “diagonal blocks”), to 1, i.e. ∀v, 1 ≤ i, j ≤ n : M [r i , c v j ] = 1. Let V = {v1 . . . vn} be an ordering of the vertices of G, if vertices vi and vj of G are connected by an edge, we set the entry M [ri j , c vj i ] and M [r vj i , c vi j ] to 0. All other entries of the left half are set to ?.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络