Balanced signed biclique, which is a complete signed bipartite graph without 4-cycles containing odd number of negative edges, has a wide range of applications in social and biological networks. In this paper, we propose a new problem of mining this cohesive balanced structure: Given a signed bipartite graph, can we partition edges into at most k balanced signed bicliques? First, this decision problem is proven to be NP-hard by a reduction from Nonnegative Matrix Factorization. Then the problem is relaxed to a property testing version, which judges whether the given graph has this partition or is far from having it. After that, we verify a \(3^k\) kernel for contracting k-balanced biclique partition. Finally, we provide a constant-time algorithm for testing using low-rank decomposition.