Abstract

Ping-Pong is an algorithm which outputs a certain type of dense submatrices from a sparse binary matrix. In this paper we extend the algorithm and solve its drawbacks. To make extensions, we review the algorithm in two different ways. First, we see it as a graph-search, make its state-space explicit, and introduce another search method than that of the original Ping-Pong. Secondly, we see it as decision of similar rows and columns on a binary matrix, and introduce another similarity measure than that of the original Ping-Pong. By use of a text dataset, we CONFIRM that these extensions resolve original drawbacks

Description

Science Links Japan | Extensions of Ping-Pong Algorithm

Links and resources

Tags