Existing high-order co-clustering algorithm just can be suitable for analyzing star-structure high-order heterogeneous data.In order to analyze net-structure high-order heterogeneous data,a high-order co-clustering algorithm based on graph partitioning was proposed.The problem of high-order co-clustering was converted to optimal problem of graph partitioning of minimum normal cut.In order to reduce computational complexity,the optimal problem was converted to semi-definite problem.Experimental studies showed that the qualities of clustering results of GPHCC are superior five pair-wise coclustering algorithms and five high-order co-clustering algorithms.
