Institutional cooperation relationship map generation method, device, electronic device and storage medium

Abstract

The present application discloses a method, device, electronic device and storage medium for generating an institutional cooperation relationship map, and relates to the field of knowledge map technology. The method includes: extracting the character string of the affiliated institution corresponding to each document title from the document information; detecting whether there are predefined keywords in the character string of each affiliated institution; if so, locating the two separators closest to the keywords in each character string, and determining the substring between the two separators as the institution name of the corresponding affiliated institution; determining the number of institutional publications corresponding to each institution name as a node table based on the document information; determining the institutional cooperation relationship matrix based on the institutional publication volume, and determining the one-to-one cooperation relationship table between institutions as an edge table based on the institutional cooperation relationship matrix; generating an institutional cooperation relationship map based on the node table and the edge table. The present application can accurately generate a logically clear institutional cooperation relationship map based on the institutional publication volume and the one-to-one cooperation relationship table between institutions.

Description

Technical Field

[0001] The present application relates to the field of knowledge graph technology, and in particular to a method, device, electronic device and storage medium for generating an institutional collaboration relationship graph. Background Art

[0002] When analyzing literature trends, it is necessary to obtain literature information for statistics. The more common publications an author or institution has, the closer their cooperation is. However, when searching for relevant literature in a literature analysis database, the exported literature information is rather confusing. For example, multiple affiliated institutions of the same literature are listed in the same cell, making it difficult to analyze the cooperation between the institutions. Summary of the invention

[0003] The main purpose of the embodiments of the present application is to propose a method, device, electronic device and storage medium for generating an institutional cooperation relationship map, so as to obtain accurate and clear cooperation relationships between various institutions.

[0004] To achieve the above purpose, one aspect of an embodiment of the present application proposes a method for generating an institutional cooperation relationship map, the method comprising the following steps:

[0005] Extract the character string of the affiliated institution corresponding to each document title from the document information;

[0006] Detecting whether there is a predefined keyword in the character string of each of the affiliated institutions;

[0007] If so, locate the two separators in each of the character strings that are closest to the keyword, and determine the substring between the two separators as the organization name corresponding to the affiliated organization;

[0008] Determine the number of papers issued by each institution name according to the document information as a node table;

[0009] Determine an inter-institutional cooperation relationship matrix according to the number of papers issued by the institutions, and determine an inter-institutional one-to-one cooperation relationship table as a side table according to the inter-institutional cooperation relationship matrix;

[0010] An institutional cooperation relationship graph is generated according to the node table and the edge table.

[0011] In some embodiments, the step of extracting the character string of the institution of affiliation corresponding to each document title from the document information includes the following steps:

[0012] Using each of the document titles as the header of each column, dividing the character strings of each of the affiliated institutions in the same document title into rows of corresponding columns, and generating a document-affiliated institution table;

[0013] The character strings of the respective affiliated institutions corresponding to the respective document titles are obtained from the document-affiliated institution table in sequence.

[0014] In some embodiments, the detecting whether there is a predefined keyword in the character string of each of the affiliated institutions comprises the following steps:

[0015] For each of the character strings, the character string is detected in order from high to low according to the priorities of the predefined keywords to see whether the corresponding keyword exists.

[0016] In some embodiments, if present, locating the two separators closest to the keyword in each of the character strings, and determining the substring between the two separators as the organization name corresponding to the affiliated organization, comprises the following steps:

[0017] The keyword detected for the first time in each of the character strings is used as the first keyword, the first position of the first keyword in the corresponding character string is located, and the two first separators closest to the first position are determined in the corresponding character string;

[0018] Determine the first substring between two of the first separators in each of the character strings as a tentative organization name;

[0019] Determine whether the tentative institution name is a duplicate institution;

[0020] If the tentative institution name is a duplicate institution, the cities to which the tentative institution name belongs are determined, and it is detected whether the corresponding city exists in the corresponding character string; if the corresponding city exists in the corresponding character string, the tentative institution name is changed to the formal institution name according to the corresponding city, and then it is determined whether the formal institution name has subordinate institutions; if the corresponding city does not exist in the corresponding character string, the tentative institution name is determined as the formal institution name, and then the determination of whether the formal institution name has subordinate institutions is performed;

[0021] If the tentative institution name is not a duplicate institution name, the tentative institution name is determined as the official institution name, and then the determination of whether the official institution name has a subordinate institution is performed;

[0022] If the formal organization name has subordinate organizations, then each of the character strings is checked for a second keyword; wherein the priority of the second keyword is lower than the priority of the first keyword;

[0023] If the second keyword exists in each of the character strings, locate the second position of the second keyword in the corresponding character string, and determine the two second separators closest to the second position in the corresponding character string; determine the second substring between the two second separators in each of the character strings as the name of the subordinate organization; merge the formal organization name and the subordinate organization name with the preset separator as the organization name of the corresponding affiliated organization;

[0024] If the second keyword does not exist in each of the character strings, then obtaining the substring between the official institution name and the previous separator in the corresponding character string as the subordinate institution name; merging the official institution name and the subordinate institution name with a preset separator as the institution name corresponding to the affiliated institution;

[0025] Convert the same institution name but in different forms to the same institution name;

[0026] If the formal institution name has no subordinate institution, the formal institution name is determined to be the institution name corresponding to the affiliated institution, and the conversion of the institution name of the same affiliated institution but in different forms into the institution name of the same form is performed.

[0027] In some embodiments, determining the number of institutional publications corresponding to each of the institutional names as a node table according to the document information includes the following steps:

[0028] Create a first blank matrix as the node table, the number of rows of the node table is at least the product of the number of rows and columns of the document-affiliation institution table, and the number of columns of the node table is at least 4;

[0029] Set the headers of the first four columns of the first row of the node table to the institution name, country, number of publications, and label respectively;

[0030] Fill each of the institution names in the document-affiliated institution table into each row of the first column of the node table in sequence, and fill each of the countries to which each of the institution names belongs into each row of the second column of the node table according to the document-affiliated institution table;

[0031] According to the document-affiliation table, the number of publications corresponding to each of the institution names is counted, and the number of publications is filled into the corresponding rows in the third column of the node table;

[0032] The first two columns of each row of the node table are combined, and the combined content is then filled into the fourth column of the corresponding row; the node table is used to determine the number of papers issued by the institution.

[0033] In some embodiments, determining the inter-institutional cooperation relationship matrix according to the number of papers issued by the institution, and determining the inter-institutional one-to-one cooperation relationship table as a side table according to the inter-institutional cooperation relationship matrix includes the following steps:

[0034] creating a second blank matrix as the inter-institutional partnership matrix;

[0035] The headers of each row and column of the inter-institutional cooperation relationship matrix are respectively set to the names of the respective institutions;

[0036] According to the number of papers published by the institutions, the common number of papers published by any two of the institution names is counted, and the common number of papers published is filled into the cells corresponding to the two institution names in the inter-institutional cooperation relationship matrix;

[0037] Create a third blank matrix, and set the headers of the first three columns of the third blank matrix to source, target, and co-issued quantity in sequence;

[0038] According to the inter-institutional cooperation relationship matrix, the two institution names whose common publication volume values ​​are greater than 0 are filled in the first two columns of the third blank matrix respectively, and the corresponding common publication volume values ​​are filled in the third column of the third blank matrix respectively, to obtain the one-to-one cooperation relationship between institutions as the edge table.

[0039] In some embodiments, generating an organization cooperation relationship graph according to the node table and the edge table comprises the following steps:

[0040] The node table and the edge table are input into Gephi software, and the corresponding institutional cooperation relationship map is generated using the Gephi software.

[0041] To achieve the above-mentioned purpose, another aspect of the embodiment of the present application provides a device for generating an institutional cooperation relationship map, the device comprising:

[0042] A character string extraction unit, used to extract the character string of the affiliated institution corresponding to each document title from the document information;

[0043] A keyword detection unit, used to detect whether there is a predefined keyword in the character string of each of the affiliated institutions;

[0044] an institution name determination unit, configured to locate two separators in each of the character strings that are closest to the keyword, if any, and determine a substring between the two separators as the institution name corresponding to the affiliated institution;

[0045] A publication volume determination unit, used to determine the publication volume of each institution name corresponding to the document information as a node table;

[0046] A cooperation relationship determination unit, used to determine an inter-institution cooperation relationship matrix according to the number of documents issued by the institution, and determine a one-to-one cooperation relationship table between institutions as a side table according to the inter-institution cooperation relationship matrix;

[0047] A relationship map generation unit is used to generate an institutional cooperation relationship map based on the node table and the edge table.

[0048] To achieve the above objective, another aspect of an embodiment of the present application provides an electronic device, the electronic device comprising a memory and a processor, the memory storing a computer program, and the processor implementing the above method when executing the computer program.

[0049] To achieve the above objective, another aspect of an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0050] The embodiments of the present application include at least the following beneficial effects:

[0051] This application can extract the character string of the affiliated institution corresponding to each document title from the document information; detect whether there are predefined keywords in the character string of each affiliated institution; if so, locate the two separators closest to the keywords in each character string, and determine the substring between the two separators as the institution name of the corresponding affiliated institution; determine the number of institutional publications corresponding to each institutional name as a node table based on the document information; determine the inter-institutional cooperation relationship matrix based on the institutional publication volume, and determine the inter-institutional one-to-one cooperation relationship table as an edge table based on the inter-institutional cooperation relationship matrix; generate an institutional cooperation relationship map based on the node table and the edge table. This application accurately extracts the institution names between the separators through keywords, and then accurately counts the number of institutional publications of each affiliated institution based on the institution names, and then determines a clear inter-institutional cooperation relationship matrix and an inter-institutional one-to-one cooperation relationship table based on the institutional publication volume, and finally accurately generates a logically clear institutional cooperation relationship map based on the institutional publication volume and the inter-institutional one-to-one cooperation relationship table. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0053] Figure 1 A schematic diagram of a flow chart of a method for generating an institutional cooperation relationship map provided in an embodiment of the present application;

[0054] Figure 2 An example diagram of a document information table provided in an embodiment of the present application;

[0055] Figure 3 An example diagram of a document-affiliation table provided in an embodiment of the present application;

[0056] Figure 4 A flowchart of the steps for reading a character string of an organization name provided in an embodiment of the present application;

[0057] Figure 5 An example diagram of a document-institution name-country list provided for an embodiment of the present application;

[0058] Figure 6 A flowchart of the steps of the institution name resolution program provided in the embodiment of the present application;

[0059] Figure 7 A flowchart of the steps for reading the organization name and country in a character string provided in an embodiment of the present application;

[0060] Figure 8 An example diagram of the table of the number of documents issued by an institution provided in the embodiment of the present application;

[0061] Fig. 9 A flowchart of the number of documents issued by an institution and the number of documents affiliating to the institution provided in the embodiment of the present application;

[0062] Fig.10 A flowchart of the steps for generating an inter-institutional cooperation relationship matrix provided in an embodiment of the present application;

[0063] Fig.11 An example diagram of the inter-institutional cooperation relationship matrix provided in the embodiment of the present application;

[0064] Fig.12 A flowchart of the steps for generating a one-to-one cooperation relationship table between institutions provided in an embodiment of the present application;

[0065] Fig.13 An example diagram of a one-to-one cooperation relationship table between institutions provided in an embodiment of the present application;

[0066] Fig.14 A flowchart of the steps of using Gephi software to generate an institutional partnership relationship map provided in an embodiment of the present application;

[0067] Fig.15 An example diagram of the institutional cooperation relationship map provided in the embodiment of the present application;

[0068] Fig.16 A schematic diagram of the structure of a device for generating a diagram of institutional cooperation relationships provided in an embodiment of the present application;

[0069] Fig.17 A schematic diagram of the hardware structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0070] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the embodiments of the present application. They are only examples of devices and methods consistent with some aspects of the embodiments of the present application as detailed in the attached claims.

[0071] It is understood that the terms "first", "second", etc. used in this application can be used to describe various concepts in this article, but unless otherwise specified, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another concept. For example, without departing from the scope of the embodiment of the present application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the words "if" and "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determination".

[0072] The terms "at least one", "multiple", "each", "any", etc. used in this application, at least one includes one, two or more, multiple includes two or more, each refers to each of the corresponding multiple, and any refers to any one of the multiple.

[0073] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art to which this application belongs. The terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0074] The embodiment of the present application provides a method for generating an institutional cooperative relationship map, which relates to the field of knowledge map technology. The method for generating an institutional cooperative relationship map provided in the embodiment of the present application can be applied to a terminal, can be applied to a server, or can be software running in a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, and a car terminal, etc., but is not limited to this; the server side can be configured as an independent physical server, or a server cluster or distributed system composed of multiple physical servers, and can also be configured to provide cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and cloud servers for basic cloud computing services such as big data and artificial intelligence platforms. The server can also be a node server in a blockchain network; the software can be an application that implements the method for generating an institutional cooperative relationship map, etc., but is not limited to the above forms.

[0075] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, etc. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments, in which tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0076] Reference Figure 1 The present application embodiment provides a method for generating an institutional cooperation relationship map, which may include but is not limited to S100 to S150, as follows:

[0077] S100: Extracting the character string of the affiliation institution corresponding to each document title from the document information.

[0078] Exemplarily, the document information of this embodiment may include information such as the document title, author, affiliated organization or keywords, wherein the affiliated organization may include address information such as the affiliated country, city, street or zip code.

[0079] In this embodiment, document information in formats such as csv, xls, or xlsx can be exported from the document analysis database, and the data format of the document information content can be in the form of a character string.

[0080] Furthermore, S100 may include:

[0081] Using each of the document titles as the header of each column, dividing the character strings of each of the affiliated institutions in the same document title into rows of corresponding columns, and generating a document-affiliated institution table;

[0082] The character strings of the respective affiliated institutions corresponding to the respective document titles are obtained from the document-affiliated institution table in sequence.

[0083] For example, Figure 2 The document information in csv format is exported from the document analysis database provided in this embodiment. (It should be noted that the information in the various table examples provided in the embodiment of this application is actually an English string. For the sake of simplicity, the embodiment of this application is described in abbreviated form such as "Institution A" and "Document A").

[0084] Specifically, the document information in csv, xls, or xlsx format is exported from the document analysis database, and the "document title" and "affiliated institution" columns are copied and pasted into a blank Excel table. Then, the "affiliated institution" column is divided into several columns separated by semicolons using the data sorting function provided by Excel. The "affiliated institution" column consists of several institution names and their specific addresses, where the specific address includes several elements, such as country, postal code, province, city, department, etc. According to the English writing habit, each address element is separated by a comma in ascending order. Among them, different document authors may write the address of the same institution differently, that is, different address elements may describe the same institution, which can be converted uniformly later. For example, the address element combination containing institution A may be "institution A, city A, province A, country A", or it may be "department Aa, institution A, street A, city A, province A, postal code A, country A" or "department Ab, institution A, street A, city A, province A, postal code A, country A", etc.

[0085] Select All Figure 2 The contents of the table are then transposed and pasted into an Excel table with institution name parsing, institution publication statistics, and partnership building procedures. Figure 3 As shown, Figure 3 The table shown is the "Document-Affiliated Institution Table".

[0086] Furthermore, the character string of the affiliated institution is extracted from each row under each document in the document-affiliated institution table.

[0087] S110: Detect whether there is a predefined keyword in the character string of each of the affiliated institutions.

[0088] Exemplarily, this embodiment may predefine various keywords according to the naming rules of various affiliated organizations, and detect whether the extracted character string contains the above keywords.

[0089] Furthermore, S110 may include:

[0090] For each of the character strings, the character string is detected in order from high to low according to the priorities of the predefined keywords to see whether the corresponding keyword exists.

[0091] Specifically, for each character string, it is detected in order from high to low priority whether the corresponding keyword exists in the character string.

[0092] S120: If so, locate the two separators in each of the character strings that are closest to the keyword, and determine the substring between the two separators as the organization name corresponding to the affiliated organization.

[0093] Exemplarily, the separator in this embodiment may be a comma, a semicolon, or a space character.

[0094] It can be understood that the character string exists in the form of being arranged from left to right, and each character in the character string has a sequence and position. Therefore, this embodiment can determine the two separators closest to the keyword, and then extract the substring between the two separators as the organization name of the corresponding organization.

[0095] Considering that different institutions may have the same name, that is, there may be institutions with the same name, or some institutions may have subordinate institutions, but the documents published by different subordinate institutions are uniformly classified as documents published by the same parent institution, which leads to inaccurate statistics of cooperative relationships. To solve the above problem, S120 may further include:

[0096] The keyword detected for the first time in each of the character strings is used as the first keyword, the first position of the first keyword in the corresponding character string is located, and the two first separators closest to the first position are determined in the corresponding character string;

[0097] Determine the first substring between two of the first separators in each of the character strings as a tentative organization name;

[0098] Determine whether the tentative institution name is a duplicate institution;

[0099] If the tentative institution name is a duplicate institution, the cities to which the tentative institution name belongs are determined, and it is detected whether the corresponding city exists in the corresponding character string; if the corresponding city exists in the corresponding character string, the tentative institution name is changed to the formal institution name according to the corresponding city, and then it is determined whether the formal institution name has subordinate institutions; if the corresponding city does not exist in the corresponding character string, the tentative institution name is determined as the formal institution name, and then the determination of whether the formal institution name has subordinate institutions is performed;

[0100] If the tentative institution name is not a duplicate institution name, the tentative institution name is determined as the official institution name, and then the determination of whether the official institution name has a subordinate institution is performed;

[0101] If the formal organization name has subordinate organizations, then each of the character strings is checked for a second keyword; wherein the priority of the second keyword is lower than the priority of the first keyword;

[0102] If the second keyword exists in each of the character strings, locate the second position of the second keyword in the corresponding character string, and determine the two second separators closest to the second position in the corresponding character string; determine the second substring between the two second separators in each of the character strings as the name of the subordinate organization; merge the formal organization name and the subordinate organization name with the preset separator as the organization name of the corresponding affiliated organization;

[0103] If the second keyword does not exist in each of the character strings, then obtaining the substring between the official institution name and the previous separator in the corresponding character string as the subordinate institution name; merging the official institution name and the subordinate institution name with a preset separator as the institution name corresponding to the affiliated institution;

[0104] Convert the same institution name but in different forms to the same institution name;

[0105] If the formal institution name has no subordinate institution, the formal institution name is determined to be the institution name corresponding to the affiliated institution, and the conversion of the institution name of the same affiliated institution but in different forms into the institution name of the same form is performed.

[0106] In order to more clearly illustrate the solution of the embodiment of the present application, S110 and S120 are described as a whole in conjunction with specific examples.

[0107] Specifically, this embodiment can adopt Figure 4 The step flow shown reads Figure 3The cells in the document-affiliation table are shown, and the institution name is parsed to form a parsed "document-institution name-country" list (such as Figure 5 As shown in Figure 1.1, the same institution may have different subordinate institutions cooperating to publish papers. Figure 5 There may be repeated institution names in the same column of documents. The above problem can be solved in subsequent steps in the embodiment of the present application.

[0108] use Figure 4 The steps shown are as follows, from the document-affiliation table ( Figure 3 ) extract the strings of affiliated institutions one by one. Each letter, number or punctuation mark in the string represents 1 character, which is combined into a string. Each character in the string corresponds to a position, and the position value increases from left to right. The corresponding position of each segment composed of several adjacent characters is based on the position of the first character in the segment. For example, the position corresponding to the character "l" in the string "apple" is 4, and the position corresponding to the field "World" in the string "Hello, World" is 8. Therefore, in Figure 4 In the steps marked with *, the parsing logic for the string in the cell corresponding to each institution name is as follows Figure 6 shown.

[0109] Specifically, Figure 6 The instructions are as follows:

[0110] For each extracted institution text (hereinafter referred to as "string"), use VBA (Visual Basic for Applications), Excelize in Go language, Openpyxl in Python language, etc. to call worksheet functions to find all commas ("," or ","). Exemplarily, this embodiment uses VBA as an example to illustrate, and records the positions of commas in the string into a set of series, namely, "comma index series, i.e., comma_indicies".

[0111] Use words with institutional name identification features such as University, Academy of Science, Institute, Company, School, Bureau, Ministry, etc. as parsing keywords, and use VBA's Instr function to find the field position where the keywords appear in the string of the affiliated institution.

[0112] Compare the character position of the keyword with the value in the "Comma Index Array" to find the two commas closest to the keyword, and then extract the field between the two commas as the organization name; if the entire string has only one comma, or the position of the keyword is smaller than the position of the first comma, the field to the left of the first comma is the organization name; if there are more than one comma in the entire string, but the keyword is after the last comma, extract the field to the right of the last comma as the organization name; if the entire string has no commas, the string itself is the organization name.

[0113] For institutions with duplicate names, other place name elements in the string are parsed, such as the city where the institution is located.

[0114] If there are subordinate institutions, parse other elements in the string with institution name identification keywords. For example, if the institution name is "XXX Academy of Sciences", find the field with the name "Institute" in the string, and the name of the institute is the name of the subordinate institution; if there is no field with the name "Institute" in the string, according to English writing habits, the field before the comma before the institution name field is usually the name of its subordinate institution.

[0115] For some institutions that need to be studied and counted, their names can be standardized using VBA's Select Case conditional statement, with the Instr function being the judgment condition of the conditional statement.

[0116] By obtaining the "comma index sequence", read the position of the last comma in the string. All fields to the right of the comma are the country of the institution. Figure 5 The “Document-Institution-Country” list shown.

[0117] S130: Determine the number of publications of each institution corresponding to the institution name according to the document information as a node table.

[0118] It is understandable that this embodiment can count the number of publications corresponding to each institution based on the document information, and generate a corresponding institution publication table as a node table.

[0119] Further, S130 may include:

[0120] Create a first blank matrix as the node table, the number of rows of the node table is at least the product of the number of rows and columns of the document-affiliation institution table, and the number of columns of the node table is at least 4;

[0121] Set the headers of the first four columns of the first row of the node table to the institution name, country, number of publications, and label respectively;

[0122] Fill each of the institution names in the document-affiliated institution table into each row of the first column of the node table in sequence, and fill each of the countries to which each of the institution names belongs into each row of the second column of the node table according to the document-affiliated institution table;

[0123] According to the document-affiliation table, the number of publications corresponding to each of the institution names is counted, and the number of publications is filled into the corresponding rows in the third column of the node table;

[0124] The first two columns of each row of the node table are combined, and the combined content is then filled into the fourth column of the corresponding row; the node table is used to determine the number of papers issued by the institution.

[0125] Specifically, this embodiment can adopt Figure 7 The steps shown in the flow chart generate the table of “Institutional Publication Volume” (such as Figure 8 The first and second columns of the table are the name of the institution and the country to which it belongs; Fig. 9 The steps shown in the flow are generated Figure 8 The third and fourth columns, namely the number of papers issued by the institution and the institution name with the country, are used as the node table.

[0126] right Figure 7 and Fig. 9 The steps shown in the flow are explained as follows:

[0127] Use VBA's UsedRange.Rows.Count and UsedRange.Columns.Count properties to read the "Document-Affiliation Table" ( Figure 3 ) and create a blank matrix (brr) with at least the product of the number of rows and columns of the document-affiliation table and 2 columns.

[0128] From the "Document-Institution-Country" list ( Figure 5 ), read the participating institutions and countries corresponding to each document one by one in the order of "first from top to bottom, then from left to right", and enter them into the matrix (brr) established in the previous step. The first column of the blank matrix is ​​the institution name, and the second column is the country.

[0129] Fill the written matrix into a new Excel blank table ( Figure 8 ), use the VBA RemoveDuplicate function to clear Figure 8 The duplicate items in the organization name column in the table shown are deleted, and the blank cells left after clearing the duplicate cells are deleted using the Delete Shift:=xlUp statement.

[0130] Figure 8 The third column in the table shows the number of papers issued by each institution, and the number of papers issued is initialized to 0. Two nested For loops are used to Figure 8 The number of publications corresponding to the institution names in the table is shown in Figure 5 Search column by column in the table shown. If a document (a column) contains the name of the institution, add 1 to the number of papers already counted by the institution.

[0131] Figure 8 The fourth column of the table shown is a combination of the strings in the first and second columns, and the four column headers are Id, Country, Weight, and Label respectively.

[0132] S140: Determine an inter-institutional cooperation relationship matrix according to the number of documents issued by the institutions, and determine an inter-institutional one-to-one cooperation relationship table as a side table according to the inter-institutional cooperation relationship matrix.

[0133] It is understandable that the inter-institutional cooperation matrix can record the specific values ​​of the number of joint publications between each institution, and the inter-institutional one-to-one cooperation table can record the specific values ​​of the number of joint publications between two institutions in a cooperative relationship.

[0134] Furthermore, S140 may include:

[0135] creating a second blank matrix as the inter-institutional partnership matrix;

[0136] The headers of each row and column of the inter-institutional cooperation relationship matrix are respectively set to the names of the respective institutions;

[0137] According to the number of papers published by the institutions, the common number of papers published by any two of the institution names is counted, and the common number of papers published is filled into the cells corresponding to the two institution names in the inter-institutional cooperation relationship matrix;

[0138] Create a third blank matrix, and set the headers of the first three columns of the third blank matrix to source, target, and co-issued quantity in sequence;

[0139] According to the inter-institutional cooperation relationship matrix, the two institution names whose common publication volume values ​​are greater than 0 are filled in the first two columns of the third blank matrix respectively, and the corresponding common publication volume values ​​are filled in the third column of the third blank matrix respectively, to obtain the one-to-one cooperation relationship between the institutions as the edge table.

[0140] Specifically, this embodiment can adopt Fig.10 The steps shown in the flow chart generate a matrix of inter-agency partnerships (such as Fig.11 shown); using Fig.12 The steps shown in the flow chart generate a one-to-one cooperation relationship table between institutions (such as Fig.13 As shown), the one-to-one cooperation table between institutions can be used as the edge table required for drawing the institutional cooperation map.

[0141] Specifically, Fig.10 and Fig.12 The instructions are as follows:

[0142] Create a new blank matrix to create Fig.11 Copy and paste the first column (name of the institution) from the table "Institutional Publications" into Fig.11 The first column of the table shown is pasted transposed as Fig.11 The first row of the table is shown.

[0143] Extract one by one Fig.11 The two institution names corresponding to the cells in the non-first row or first column of the table shown (assuming the two institutions are named a and b), for example, the two institution names corresponding to the cells in the third row and second column are located in the third row and first column (a) and the first row and second column (b), respectively. The number in the cell represents the number of collaborative publications between the two institutions, and the initial value is set to 0. Search column by column in the "Document-Institution Name-Country" list. Once the names of the two institutions a and b appear in the same column, it is counted as one collaboration between the two institutions, and the number in the cell is increased by 1 based on the original value. At the same time, Fig.11 The values ​​of cells with equal numbers of rows and columns (i.e., diagonals) in the table shown are set to "-" or any symbol that indicates that the value does not exist, because the two institutions corresponding to cells with equal numbers of rows and columns have the same name. In addition, for cells on both sides of the diagonal, only one side of the value needs to be counted. For example, if the cooperation between the two institutions corresponding to the cell in the 3rd row and the 2nd column is counted, there is no need to count the cooperation between the two institutions corresponding to the cell in the 2nd column and the 3rd row. Fig.11 Once the table shown is generated, it becomes the “Inter-agency Partnership Matrix”.

[0144] Create a new blank matrix to create Fig.13 The table shown is for Fig.11 For all cells with values ​​greater than 0 in the table shown, read the names of the two organizations in the first row and first column of the corresponding cells (assuming the two organizations are named a and b), and put a into Fig.13 In the first column of the table shown, put b in Fig.13 In the second column of the table shown, the values ​​of the partnerships between a and b are placed in Fig.13 In columns 3 and 5 of the table shown. Fig.13 The 4th column of the table shown is uniformly set to the "Undirected" field. Fig.13The five column headers of the table shown are named "Source", "Target", "Weight", "Type", and "Label" respectively.

[0145] S150: Generate an institutional cooperation relationship graph according to the node table and the edge table.

[0146] Specifically, this embodiment can use the number of documents issued by an organization as a node table and a one-to-one cooperation relationship table between organizations as an edge table, and then generate a corresponding organization cooperation relationship map based on the node table and the edge table.

[0147] Furthermore, S150 may include:

[0148] The node table and the edge table are input into Gephi software, and the corresponding institutional cooperation relationship map is generated using the Gephi software.

[0149] Specifically, the “Institutional Publications” table ( Figure 8 ) as the node table, "One-to-one cooperation relationship table between institutions" ( Fig.13 ) as the edge table, according to Fig.14 The steps shown in the flow chart are imported into Gephi software, and a diagram of the institutional cooperation relationship is generated using Gephi software. The diagram of the institutional cooperation relationship generated by Gephi software is shown in the figure below. Fig.15 shown.

[0150] Reference Fig.16 The embodiment of the present application also provides a device for generating an institutional cooperation relationship map, which can implement the above-mentioned institutional cooperation relationship map generation method, and the device includes:

[0151] A character string extraction unit, used to extract the character string of the affiliated institution corresponding to each document title from the document information;

[0152] A keyword detection unit, used to detect whether there is a predefined keyword in the character string of each of the affiliated institutions;

[0153] an institution name determination unit, configured to locate two separators in each of the character strings that are closest to the keyword, if any, and determine a substring between the two separators as the institution name corresponding to the affiliated institution;

[0154] A publication volume determination unit, used to determine the publication volume of each institution name corresponding to the document information as a node table;

[0155] A cooperation relationship determination unit, used to determine an inter-institution cooperation relationship matrix according to the number of documents issued by the institution, and determine a one-to-one cooperation relationship table between institutions as a side table according to the inter-institution cooperation relationship matrix;

[0156] A relationship map generation unit is used to generate an institutional cooperation relationship map based on the node table and the edge table.

[0157] It can be understood that the contents of the above method embodiments are all applicable to the present device embodiments, the functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0158] The embodiment of the present application also provides an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above-mentioned method for generating a cooperative relationship map when executing the computer program. The electronic device can be any intelligent terminal including a tablet computer, a car computer, etc.

[0159] It can be understood that the contents of the above method embodiments are all applicable to the present device embodiments, the functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0160] See also Fig.17 , Fig.17 The hardware structure of an electronic device of another embodiment is illustrated, and the electronic device includes:

[0161] The processor 1701 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0162] The memory 1702 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1702 can store an operating system and other application programs. When the technical solution provided in the embodiment of this specification is implemented by software or firmware, the relevant program code is stored in the memory 1702, and the processor 1701 calls and executes the method for generating a cooperative relationship map of an institution in the embodiment of this application;

[0163] Input / output interface 1703, used to implement information input and output;

[0164] Communication interface 1704, used to realize communication interaction between the device and other devices, which can be realized through wired mode (such as USB, network cable, etc.) or wireless mode (such as mobile network, WIFI, Bluetooth, etc.);

[0165] A bus 1705 that transmits information between the various components of the device (e.g., the processor 1701, the memory 1702, the input / output interface 1703, and the communication interface 1704);

[0166] The processor 1701 , the memory 1702 , the input / output interface 1703 and the communication interface 1704 are connected to each other in communication within the device via the bus 1705 .

[0167] An embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the above-mentioned method for generating an institutional cooperation relationship map.

[0168] It can be understood that the contents of the above method embodiments are all applicable to the present storage medium embodiments, the functions specifically implemented by the present storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0169] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely disposed relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0170] The embodiments described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0171] Those skilled in the art will appreciate that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0172] The device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place or distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0173] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0174] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0175] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0176] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the above units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0177] The units described above as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0178] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0179] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including multiple instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store programs.

[0180] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but the scope of the rights of the present invention is not limited thereto. Any modification, equivalent substitution and improvement made by a person skilled in the art without departing from the scope and essence of the present invention should be within the scope of the rights of the present invention.

Claims

1. A method for generating an institutional cooperation relationship map, characterized in that: The method comprises the following steps: Extract the character string of the affiliated institution corresponding to each document title from the document information; Detecting whether there is a predefined keyword in the character string of each of the affiliated institutions; If so, locate the two separators in each of the character strings that are closest to the keyword, and determine the substring between the two separators as the organization name corresponding to the affiliated organization; Determine the number of papers issued by each institution name according to the document information as a node table; Determine an inter-institutional cooperation relationship matrix according to the number of papers issued by the institutions, and determine an inter-institutional one-to-one cooperation relationship table as a side table according to the inter-institutional cooperation relationship matrix; Generate an institutional cooperation relationship graph according to the node table and the edge table; The detecting whether there is a predefined keyword in the character string of each of the affiliated institutions comprises the following steps: For each of the character strings, detecting whether the character string has the corresponding keyword in order of priority of the predefined keywords from high to low; If so, locating the two separators closest to the keyword in each of the character strings, and determining the substring between the two separators as the organization name corresponding to the affiliated organization, including the following steps: The keyword detected for the first time in each of the character strings is used as the first keyword, the first position of the first keyword in the corresponding character string is located, and the two first separators closest to the first position are determined in the corresponding character string; Determine the first substring between two of the first separators in each of the character strings as a tentative organization name; Determine whether the tentative institution name is a duplicate institution; If the tentative institution name is a duplicate institution, the cities to which the tentative institution name belongs are determined, and it is detected whether the corresponding city exists in the corresponding character string; if the corresponding city exists in the corresponding character string, the tentative institution name is changed to the formal institution name according to the corresponding city, and then it is determined whether the formal institution name has subordinate institutions; if the corresponding city does not exist in the corresponding character string, the tentative institution name is determined as the formal institution name, and then the determination of whether the formal institution name has subordinate institutions is performed; If the tentative institution name is not a duplicate institution name, the tentative institution name is determined as the official institution name, and then the determination of whether the official institution name has a subordinate institution is performed; If the formal organization name has subordinate organizations, then each of the character strings is checked for a second keyword; wherein the priority of the second keyword is lower than the priority of the first keyword; If the second keyword exists in each of the character strings, locate the second position of the second keyword in the corresponding character string, and determine the two second separators closest to the second position in the corresponding character string; determine the second substring between the two second separators in each of the character strings as the name of the subordinate organization; merge the formal organization name and the subordinate organization name with the preset separator as the organization name of the corresponding affiliated organization; If the second keyword does not exist in each of the character strings, then obtaining the substring between the official institution name and the previous separator in the corresponding character string as the subordinate institution name; merging the official institution name and the subordinate institution name with a preset separator as the institution name corresponding to the affiliated institution; Convert the same institution name but in different forms to the same institution name; If the formal institution name has no subordinate institution, the formal institution name is determined to be the institution name corresponding to the affiliated institution, and the conversion of the institution name of the same affiliated institution but in different forms into the institution name of the same form is performed.

2. The method for generating a diagram of institutional cooperation relationships according to claim 1, characterized in that: The step of extracting the character string of the institution of affiliation corresponding to each document title from the document information comprises the following steps: Using each of the document titles as the header of each column, dividing the character strings of each of the affiliated institutions in the same document title into rows of corresponding columns, and generating a document-affiliated institution table; The character strings of the respective affiliated institutions corresponding to the respective document titles are obtained from the document-affiliated institution table in sequence.

3. The method for generating a diagram of institutional cooperation relationships according to claim 2, characterized in that: Determining the number of institutional publications corresponding to each of the institutional names as a node table according to the document information includes the following steps: Create a first blank matrix as the node table, the number of rows of the node table is at least the product of the number of rows and columns of the document-affiliation institution table, and the number of columns of the node table is at least 4; Set the headers of the first four columns of the first row of the node table to the institution name, country, number of publications, and label respectively; Fill each of the institution names in the document-affiliated institution table into each row of the first column of the node table in sequence, and fill each of the countries to which each of the institution names belongs into each row of the second column of the node table according to the document-affiliated institution table; According to the document-affiliation table, the number of publications corresponding to each of the institution names is counted, and the number of publications is filled into the corresponding rows in the third column of the node table; The first two columns of each row of the node table are combined, and the combined content is then filled into the fourth column of the corresponding row; the node table is used to determine the number of papers issued by the institution.

4. The method for generating a diagram of institutional cooperation relationships according to claim 1, characterized in that: Determining the inter-institutional cooperation relationship matrix according to the number of papers issued by the institution, and determining the inter-institutional one-to-one cooperation relationship table as a side table according to the inter-institutional cooperation relationship matrix, includes the following steps: creating a second blank matrix as the inter-institutional partnership matrix; The headers of each row and column of the inter-institutional cooperation relationship matrix are respectively set to the names of the respective institutions; According to the number of papers published by the institutions, the common number of papers published by any two of the institution names is counted, and the common number of papers published is filled into the cells corresponding to the two institution names in the inter-institutional cooperation relationship matrix; Create a third blank matrix, and set the headers of the first three columns of the third blank matrix to source, target, and co-issued quantity in sequence; According to the inter-institutional cooperation relationship matrix, the two institution names whose common publication volume values ​​are greater than 0 are filled in the first two columns of the third blank matrix respectively, and the corresponding common publication volume values ​​are filled in the third column of the third blank matrix respectively, to obtain the one-to-one cooperation relationship between institutions as the edge table.

5. A method for generating an institutional cooperation relationship map according to any one of claims 1 to 4, characterized in that: The step of generating an institutional cooperation relationship graph according to the node table and the edge table comprises the following steps: The node table and the edge table are input into Gephi software, and the corresponding institutional cooperation relationship map is generated using the Gephi software.

6. A device for generating a diagram of institutional cooperation relationships, characterized in that: The device is used to implement the method for generating an institutional cooperation relationship map according to claim 1, and the device includes: A character string extraction unit, used to extract the character string of the affiliated institution corresponding to each document title from the document information; A keyword detection unit, used to detect whether there is a predefined keyword in the character string of each of the affiliated institutions; an institution name determination unit, configured to locate two separators in each of the character strings that are closest to the keyword, if any, and determine a substring between the two separators as the institution name corresponding to the affiliated institution; A publication volume determination unit, used to determine the publication volume of each institution name corresponding to the document information as a node table; A cooperation relationship determination unit, used to determine an inter-institution cooperation relationship matrix according to the number of documents issued by the institution, and determine an inter-institution one-to-one cooperation relationship table as a side table according to the inter-institution cooperation relationship matrix; A relationship map generation unit is used to generate an institutional cooperation relationship map based on the node table and the edge table.

7. An electronic device, characterized in that: The electronic device comprises a memory and a processor, the memory stores a computer program, and the processor implements the method according to any one of claims 1 to 5 when executing the computer program.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images