The new college entrance examination requires applicants to apply according to their major,and accurate applicants should accurately predict the possible admission score of the major in the current year based on the historical data of the major.Aiming at the difficulty of automatic historical data tracking caused by the change of major names in the process of predicting the scores of massive majors in the new college entrance examination,an algorithm based on bipartite graph optimal matching was designed.The similarity measure of major name is constructed based on editing distance,and the problem of many-to-one matching caused by maximum similarity matching is solved by using bipartite graph optimal matching.The matching rule of forcing the first two Chinese characters of major name to be the same can avoid matching errors caused by string inclusion.
关键词
新高考/二部图/数据追踪/志愿填报
Key words
new college entrance examination/bipartite graph/data tracking/voluntary filling
维普
万方数据