Research Of Papers Distribution Algorithm Based On Bipartite Graph Matching And Clustering

Distribution problem widely exists in real life. This problem can be abstracted as bigraph matching model in graph theory. Distributing the papers of academic conference to several reviewers for review is a typical distribution problem. This article studies the papers distribution, and on this basis, develops an academic conference website generates systems. Typically, each academic conference has their own official website. The system can automatically generate a personalized academic conference site, thereby reducing the required expenses for conferences. It has great practical significance.Firstly, this article propose a balanced distribution algorithm, it is based on the Hungarian algorithm and KM algorithm of bigraph matching theory, and can be applied directly to the academic conference papers distribute process. This algorithm makes the sum of distribution weight max, on the basis of that one paper reviewed by several reviewers and the amount of review is the same for each reviewer. Experiments show that balanced distribution algorithm can meet all the conditions in the distribution of the paper, which effectively solve the problem of paper distribution.Secondly, a nominal clustering algorithm named VPRSMMR algorithm is proposed. It is obtained on the basis of improved MMR cluster algorithm. This algorithm can handle nominal data; only the maximum number of clusters is needed to be set. Experiments show that the algorithm has good clustering accuracy, and is not sensitive to the input order of data objects. The VPRSMMR algorithm as a paper assignment pretreatment can effectively solve performance bottlenecks problem when the amount paper is too large.Finally, an academic conference site generation system is designed and implemented. After the research and analysis of the structure of website of five top computer science academic conferences, a way to solve personalize of academic conference site problem is found. This system uses B/S structure, and implemented by Struts2framework.