Expert-Application Grouping and Matching Algorithm

Abstract

Objects grouping and matching simultaneously is an important means in grouping heterogeneous objects. In order to group and match the experts and applications in project-reviewing, the Expert-Application Algorithm is proposed in this paper, which is based on the co-clustering using Bipartite Spectral Graph Partitioning. In this algorithm, the number of the expert and application are configured at first. And then, the relationship between experts and applications are depicted as a bipartite graph model. The edge-weight is calculated by the relationship weight calculating formula witch is proposed in this paper. After decomposing the matrix witch is formed by the edge-weight, we get eigenvectors. At last, experts and applications are grouped and matched through mapping to the groups of the eigenvectors which are created by k-means grouping algorithm.