Username   Password       Forgot your password?  Forgot your username? 


A Bipartite Graph Matching Algorithm in Human-Computer Collaboration

Volume 14, Number 10, October 2018, pp. 2384-2392
DOI: 10.23940/ijpe.18.10.p14.23842392

Junfeng Mana, Longqian Zhaoa, Ming Liua, Cheng Penga, and Qianqian Lib

aSchool of Computer Science, Hunan University of Technology, Zhuzhou, 412007, China
bSchool of Business, Hunan University of Technology, Zhuzhou, 412007, China

(Submitted on July 3, 2018; Revised on August 10, 2018; Accepted on September 15, 2018)


The emergence of human-machine collaboration has adapted to the requirements of big data for high performance computing and complex artificial reasoning, which uses the huge Internet user group and cluster to deal with the increasingly complicated data altogether. In this paper, a bipartite graph matching strategy is proposed to solve the problem of how the crowd and the cluster can collaborate effectively to complete the large data task. The Hopcroft-Karp algorithm of bipartite graph matching not only enhances and extends the Hungarian algorithm, but also considers the field of adaptive segmentation tasks, the degree of association, and the evaluation of the background and ability of the crowd to maximize the matching between the crowd and the segmented task group. The algorithm calculates each influence factor after each match and optimizes the next match, making the best match between the crowd and the task. Through the experiment, the accuracy of the task completion is verified to be the highest.


References: 11

                1. G. L. Li, “Crowd Computing of Human-machine Collaboration,” Communications of the China Computer Federation, Vol. 11, No. 7, pp. 20-26, 2015
                2. X. H. Zhang, G. L. Li., and J. H. Feng, “Theme-Aware Task Assignment in Crowd Computing on Big Data,” Journal of Computer Research and Development, Vol. 52, No. 2, pp. 309-317, 2015
                3. J. H. Feng. G. L. Li, H. N. Wang, and J. H. Feng, “Incremental Quality Inference in Crowdsourcing,” in Proceedings of International Conference on Database Systems for Advanced Applications, pp. 453-467, 2014
                4. W. Wei, Q. Xu, L. Wang, X. H. Hei, P. Shen, W. Shi, et al., “GI/Geom/1 Queue based on Communication Model for Mesh Networks,” International Journal of Communication Systems, Vol. 27, No. 11, pp. 3013-3029, 2014
                5. W. H. Gao, G. L. Li, and N. Ta, “Survey of Map Matching Algorithms,” Journal of Software, pp. 8-15, 2017
                6. S. Mishra, S. Rangineni, and C. S. R. Murthy, “Exploiting An Optimal User Association Strategy for Interference Management in HetNets,” Communications Letters IEEE, Vol. 18, No. 10, pp. 1799-1802, 2014
                7. J. X. Ren and F. J. He, “Task Assignment Model in Cloud Computing based on Hungary Algorithm of Faster Reduced Order,” Journal of Jiangxi University of Science & Technology, pp. 4-5, 2014
                8. F. J. He, “Research on Task Allocation Under Cloud Environment,” Jiangxi University of Science and Technology, 2015
                9. G. C. Sun, B. Chen, X. H. Lin, H. Wang, and L. M. Li, “User Association in Heterogeneous Cellular Networks Via the Hungarian Method,” Journal of University of Electronic Science & Technology of China, Vol. 46, No. 2, pp. 2-5, 2017
                10. Z. C. Bi, “The Research of Improved Matching Algorithm of String Pattern,” pp. 3-5, 2013
                11. P. Li and R. L. Zhao, “The Research and Implementation of Pattern Matching Algorithm,” Computer Knowledge & Technology, pp. 1-2, 2017


                              Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

                              Download this file (IJPE-2018-10-14.pdf)IJPE-2018-10-14.pdf[A Bipartite Graph Matching Algorithm in Human-Computer Collaboration]424 Kb
                              This site uses encryption for transmitting your passwords.