Review allocation method of fusing academic expertise and social network
A technology of social network and distribution method, applied in the field of computer application technology, thesis/project review management application, can solve the problem of not considering objectivity, etc., and achieve the effect of balanced review and distribution
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0091] This embodiment elaborates in detail the process of "a review assignment method integrating academic expertise and social network" of the present invention applied to the review assignment process of an academic conference in the management of paper review.
[0092] figure 1 It is the algorithm flowchart of this method and the flowchart of this embodiment; As can be seen from the figure, this method comprises the following steps:
[0093] Step A: Given 4 labels, 10 labeled papers and 7 experts, each paper is jointly completed by 2 authors, and the label set, labeled paper collection and expert collection, and the author collection of the paper collection are established; Get the number of papers and experts, label similarity matrix and paper-expert label similarity;
[0094] Specific to this embodiment, the label set T={a,b,c,d} is established, and the labeled paper collection P={p 0 ,p 1 ,p 2 ,p 3 ,p 4 ,p 5 ,p 6 ,p 7 ,p 8 ,p 9}, the labeled expert set R={r ...
Embodiment 2
[0132] According to the parameters described in Embodiment 1, this embodiment specifically illustrates the calculation process of the paper / project-expert cooperation distance defined in Step 2 of the present invention and the paper-expert cooperation distance in Step B of Embodiment 1.
[0133] The specific process is: social network G=(V,E), node set |V|=200, and expert set Paper Author Collection Edge set |E|=5000; According to the definition, the author-expert cooperation distance array of the paper is calculated
[0134]
[0135] According to the definition, the paper-expert cooperation distance D(p,r) is calculated:
[0136]
[0137] If we do not consider the paper-expert cooperation distance, but only consider maximizing the paper-expert label similarity for review assignment, the experts are likely to affect the objectivity of the paper review due to subjective factors; among them, the paper-expert labels are similar Degree is obtained by S (p, r) of embodime...
Embodiment 3
[0140] According to the parameters described in Embodiment 1, this embodiment specifically elaborates the paper / project-expert matching degree defined in step 5 of the present invention, the optimization goal defined in step 7, and the paper-expert matching in step E of embodiment 1. degree, the optimization goal determined in step G.
[0141] Specifically in this embodiment, step E: the formula for calculating the paper-expert matching degree is:
[0142]
[0143] Step G: The optimization objective for review allocation is:
[0144] max sum Matching
[0145] st.for 0≤i,j<10 and i≠j,0≤s,t<3 and s≠t,that
[0146]
[0147]
[0148]
[0149]
[0150] for R a , that|R a |==2
[0151]The optimization goal established in this embodiment is to maximize the matching degree of the paper-expert under the premise of satisfying the constraint conditions and balanced distribution; to maximize the matching degree of the paper-expert, it is necessary to maximize the label...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com