CN112540990B - Sorting method, device and storage medium based on reference network time information - Google Patents
Sorting method, device and storage medium based on reference network time information Download PDFInfo
- Publication number
- CN112540990B CN112540990B CN202011442490.2A CN202011442490A CN112540990B CN 112540990 B CN112540990 B CN 112540990B CN 202011442490 A CN202011442490 A CN 202011442490A CN 112540990 B CN112540990 B CN 112540990B
- Authority
- CN
- China
- Prior art keywords
- papers
- academic
- paper
- network
- thesis
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2272—Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2358—Change logging, detection, and notification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Entrepreneurship & Innovation (AREA)
- Databases & Information Systems (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Software Systems (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a sorting method based on cited network time information, wherein the sorting method based on cited network time information comprises the following steps: acquiring a reference relation of papers in a paper database, wherein the papers are stored in the paper database and need academic value sequencing; constructing a reference network according to the reference relationship, wherein network nodes exist in the reference network; constructing a corresponding relation between a network node and a thesis, and obtaining a reference vector according to the reference relation and the corresponding relation; calculating an academic value of the paper according to the reference vector; and sorting the papers according to the academic values of the papers. By the method and the device, the problem that the academic value ordering cost of the thesis is high and the efficiency is low in the related technology is solved, and ordering based on quoted network time information is realized.
Description
Technical Field
The present application relates to the field of scientific significance of citation networks and evaluation papers, and in particular, to a method, an apparatus, an electronic apparatus, and a storage medium for ranking based on citation network time information.
Background
With the multiplied increase in the number of scientific documents, researchers have difficulty evaluating the scientific significance of the scientific documents. Academic evaluation is always one of the important directions of scientific metrology, and has attracted extensive attention. An effective evaluation method can help researchers spend less time acquiring relevant and high-quality papers from millions of papers, and can provide a reference for judging project value for an organization.
The evaluation of scientific and technological papers is mainly focused on the innovation level and scientific value of the papers, both of which are subjective and abstract concepts, in the prior art, experts in the academic world or comments of the same lines are consulted mainly through a manual method, but the method has the characteristics of high cost, low efficiency, subjectivity and randomness, and is difficult to accurately evaluate all known papers. Meanwhile, the number of times of citation of the paper as an important evaluation index is influenced by the time information of the network published by the paper.
At present, no effective solution is provided for the problem of high cost and low efficiency of academic value sequencing of papers in the related technology.
Disclosure of Invention
The embodiment of the application provides a sorting method, a sorting device, an electronic device and a storage medium based on quoted network time information, and aims to at least solve the problems of high cost and low efficiency of the academic value sorting of papers in the related technology.
In a first aspect, an embodiment of the present application provides a sorting method based on cited network time information, including:
acquiring a reference relation of papers in a paper database, wherein the papers are stored in the paper database and need academic value ordering;
constructing a reference network according to the reference relation, wherein network nodes exist in the reference network;
constructing a corresponding relation between a network node and a paper, and obtaining a reference vector according to the reference relation and the corresponding relation;
calculating an academic value of the paper according to the reference vector;
and sorting the papers according to the academic values of the papers.
In some embodiments, constructing a correspondence between a network node and a thesis, and obtaining a reference vector according to the reference relationship and the correspondence includes:
uniquely corresponding the papers to the network nodes, wherein the unique correspondence means that each paper uniquely corresponds to one node;
and assigning the value of the reference vector as the number of times of reference between the papers, and assigning the direction of the reference vector as the reference and referred relation between the papers.
In some of these embodiments, prior to computing the academic value of the paper from the reference vector, the method further comprises:
calculating an academic value of a reference corpus, wherein the reference corpus refers to a set of paper constituents which are identified as having value;
and determining algorithm parameters through the academic values of the benchmark discourse sets.
In some of these embodiments, calculating the academic value of the paper from the reference vector comprises:
calculating a temporal weight of the reference vector, wherein the temporal weight is inversely related to a publication time of the paper;
calculating the out degree of the node;
and calculating the academic value of the paper according to the reference vector, the time weight and the out-degree of the node.
In some of these embodiments, the degree of decorrelation of the temporal weight with respect to the publication time of the paper may be adjusted by an input parameter.
In some of these embodiments, calculating the academic value of the paper from the reference vector, the temporal weight, and the degree of emergence of the node comprises:
initially assigning an academic value of the paper to 1;
calculating academic values of the papers according to the reference vectors, the time weights and the out-degrees of the nodes;
setting a precision parameter;
and performing precision check on the academic value of the thesis obtained by calculation according to the precision parameter, updating the academic value of the thesis in a scene that the academic value precision of the thesis meets the requirement of the precision parameter, and calculating the academic value of the thesis again according to the reference vector, the time weight and the node degree in a scene that the academic value precision of the thesis does not meet the requirement of the precision parameter.
In some of these embodiments, ordering the papers according to their academic value includes:
acquiring the academic value of the thesis obtained through calculation;
sorting the papers in descending order according to the academic value of the papers;
and outputting the ranking result of the paper.
In a second aspect, an embodiment of the present application provides a sorting apparatus based on referral network time information, including:
the acquisition module is used for acquiring the reference relation of the papers in the papers database;
the corresponding relation construction module is used for constructing the corresponding relation between the network node and the thesis and obtaining a reference vector according to the reference relation and the corresponding relation;
the benchmark parameter setting module is used for calculating benchmark parameters of academic values of the thesis;
an academic value calculation module used for calculating the academic value of the thesis according to the reference vector;
and the ordering module is used for ordering the thesis according to the academic value of the thesis.
In a third aspect, an embodiment of the present application provides an electronic apparatus, which includes a memory and a processor, and is characterized in that the memory stores a computer program, and the processor implements the sorting method based on the cited network time information according to the first aspect when executing the computer program.
In a fourth aspect, the present application provides a storage medium, in which a computer program is stored, where the computer program is configured to execute the sorting method based on the cited network time information as described in the first aspect when running.
Compared with the related technology, the sorting method based on the quoted network time information solves the problems of high cost and low efficiency of academic value sorting of papers in the related technology through quantitative calculation, and realizes low-cost and high-efficiency academic value sorting of papers.
The details of one or more embodiments of the application are set forth in the accompanying drawings and the description below to provide a more thorough understanding of the application.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow diagram of a reference-based network time information ordering according to an embodiment of the present application;
FIG. 2 is a flowchart illustrating a process for reference-based network time information ordering in accordance with a preferred embodiment of the present application;
FIG. 3 is a flowchart illustrating a process for sorting based on reference network time information according to a second preferred embodiment of the present application;
FIG. 4 is a flowchart illustrating the sorting based on reference network time information according to a third preferred embodiment of the present application;
FIG. 5 is a block diagram of a sorting apparatus based on referral network time information according to an embodiment of the application;
fig. 6 is a schematic hardware structure diagram of a sorting device based on cited network time information according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application.
It is obvious that the drawings in the following description are only examples or embodiments of the present application, and that it is also possible for a person skilled in the art to apply the present application to other similar contexts on the basis of these drawings without inventive effort. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.
Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.
Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. Reference to "a," "an," "the," and similar words throughout this application are not to be construed as limiting in number, and may refer to the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. Reference to "connected," "coupled," and the like in this application is not intended to be limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The term "plurality" as used herein means two or more. "and/or" describes an association relationship of associated objects, meaning that three relationships may exist, for example, "A and/or B" may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. Reference herein to the terms "first," "second," "third," and the like, are merely to distinguish similar objects and do not denote a particular ordering for the objects.
The embodiment provides a sorting method based on reference network time information. Fig. 1 is a flowchart of a sorting method based on cited network time information according to an embodiment of the present application, and as shown in fig. 1, the flowchart includes the following steps:
step S101, obtaining the reference relation of the paper in the paper database, wherein, the papers are papers stored in a papers database that need academic value ranking.
And S102, constructing a reference network according to the reference relation, wherein network nodes exist in the reference network.
In this embodiment, the specific steps according to the reference relationship of the papers in the papers database are to construct a reference network and use the adjacency matrix a to represent the papers, the nodes in the network represent the papers, and the total number of nodes in the network is represented by N. If paper i refers to paper j, there is a directed edge from i to j in the referring network, corresponding to a [ i ] [ j ] =1. If the paper does not refer to paper j, then A [ i ] [ j ] =0. The set of all papers is denoted by P.
And S103, constructing a corresponding relation between the network node and the thesis, and acquiring a reference vector according to the reference relation and the corresponding relation.
And step S104, calculating the academic value of the paper according to the reference vector.
Step S105, ranking the papers according to the academic value of the papers.
Through the steps, the corresponding relation between the network node and the thesis is constructed, so that the academic value of the thesis is calculated after the reference vector is obtained, and the thesis is sequenced according to the academic value.
In some of these embodiments, ordering articles according to their academic value includes: acquiring academic values of the papers obtained through calculation; sorting the papers in descending order according to the academic value of the papers; and outputting the ranking result of the paper. Through the embodiment, the papers can be sorted according to the academic value of the papers acquired previously, and the sorting result is output to the user, so that the sorting work of the papers is completed.
The embodiment also provides a sorting method based on the reference network time information. Fig. 2 is a flowchart of the sorting based on the cited network time information according to the preferred embodiment of the present application, and as shown in fig. 2, the flowchart includes the following steps:
step S201, obtaining the reference relation of the papers in the papers database, wherein the papers are the papers stored in the papers database and need to be subject to academic value sequencing.
And S202, constructing a reference network according to the reference relation, wherein network nodes exist in the reference network.
Step S203, the paper is uniquely corresponding to the network node, wherein the unique correspondence means that each paper uniquely corresponds to one node.
Step S204, assigning the value of the reference vector as the number of times of reference between the papers, and assigning the direction of the reference vector as the relation between the reference and the referred between the papers.
Step S205, calculating academic values of the papers according to the reference vectors.
Step S206, sorting the papers according to the academic prices of the papers.
Through the steps, compared with the prior art, the method for associating the thesis with the nodes can effectively reduce labor cost and provide a data basis for calculating the reference relation vector between different nodes in the subsequent steps and calculating.
The embodiment also provides a sorting method based on the reference network time information. Fig. 3 is a flowchart of the sorting based on the cited network time information according to the second preferred embodiment of the present application, and as shown in fig. 3, the flowchart includes the following steps:
step S301, obtaining a reference relation of papers in a paper database, wherein the papers are stored in the paper database and need to be subject to academic value sorting.
And step S302, constructing a reference network according to the reference relation, wherein network nodes exist in the reference network.
Step S303, constructing a corresponding relation between the network node and the thesis, and obtaining a reference vector according to the reference relation and the corresponding relation.
Step S304, determining algorithm parameters through the academic values of a reference discourse set, wherein the reference discourse set refers to a set of papers which are determined to have values.
Step S305, the academic value of the paper is calculated according to the reference vector.
Step S306, sorting the papers according to the academic value of the papers.
Through the steps, parameters required by the algorithm are set, and the specific steps comprise: selecting some papers with high value as reference papers; and iteratively calculating required parameters by taking the academic value of the reference discourse set as a reference. The method comprises the following concrete steps: (1) And setting some papers with high value as benchmark papers, wherein a benchmark paper set is represented by B. (2) The initialization parameters a = epsilon, r = N, epsilon can be freely set according to the required precision. And (3) calculating the out degree of each node in the reference network. For node i, its out-degree is calculated using the following formula:
(4) Weights are calculated for each directed edge in the reference network. By p i And p j Respectively representing the publication dates of a paper node i and a paper node j in the network, if the paper j refers to the paper i, the weight of the directed edge corresponding to the network is:
w ji ＝(p j -p i ) -α
(5) And (5) iteratively calculating the academic value of each paper node. By s i The academic value of the thesis node i is represented, and the academic value calculation of each thesis node comprises the following specific steps of: A. the academic value of initializing all paper nodes is 1, namely, for any i e P, setting s i =1. B. The academic value of the paper is updated using the following formula:
wherein when a = b, δ a,b =1, otherwise δ a,b And =0.c is a damping factor and can be set between 0 and 1. C. Calculated by the following formula:
if e>Δ, then set s i ＝s′ i And returning to the step B. If e is less than or equal to delta, s' i I.e. the academic value of the calculated paper i. Δ can be freely set according to the required accuracy. (6) And (5) sorting the academic values of the papers obtained by calculation in the step (5) from big to small, and calculating the average ranking r' of the papers in the reference paper set B. (7) And (3) comparing r with r ', if r ' is less than or equal to r, setting r = r ', a = a + epsilon, and returning to the step (5). If r'>r, then a-epsilon is the obtained parameter a. Through the embodiment, the setting of parameters required by the algorithm can be completed, wherein the high-value paper can be selected autonomously through manual review, and the autonomy of the system is improved. The function of setting the benchmark discourse set is to determine algorithm parameters, and under the scene of determining the algorithm parameters, the parameters are selected as the algorithm parameters to calculate the values of all papers and sort the papers.
The embodiments of the present application are described and illustrated below by means of preferred embodiments.
The embodiment also provides a sorting method based on the reference network time information. Fig. 4 is a flowchart of the sorting based on the cited network time information according to the third preferred embodiment of the present application, and as shown in fig. 4, the flowchart includes the following steps:
step S401, obtaining a reference relation of papers in a paper database, wherein the papers are stored in the paper database and need to be subject to academic value sorting.
And S402, constructing a reference network according to the reference relationship, wherein network nodes exist in the reference network.
Step S403, constructing a corresponding relation between the network node and the thesis, and obtaining a reference vector according to the reference relation and the corresponding relation.
Step S404, calculating the out degree of the node.
Step S405, calculating academic values of the papers according to the reference vectors, the time weights and the node degrees.
In this embodiment, according to the referenceThe specific steps of calculating the academic value of the paper by using the vector, the time weight and the node degree comprise: and (1) calculating the weight of each directed edge in the reference network. By p i And p j Respectively representing the publication dates of a paper node i and a paper node j in the network, if the paper j refers to the paper i, the weight of the directed edge corresponding to the network is:
w ji ＝(p j -p i ) -α
wherein a can be freely set according to actual needs.
(2) And calculating the out degree of each node in the reference network. For node i, its out-degree is calculated using the following formula:
(3) And (5) iteratively calculating the academic value of each paper node. By s i The academic value of the paper node i is represented, and the academic value calculation of each paper node comprises the following specific steps: A. the academic value of initializing all paper nodes is 1, namely, for any i e P, setting s i And =1. B. The academic value of the paper is updated using the following formula:
wherein, when a = b, δ a,b =1 otherwise δ a,b And =0.c is a damping factor, typically set to 0.85 in the reference network. C. Computing
If e>Δ, then set s i ＝s′ i And returning to the step B. If e is less than or equal to delta, s' i I.e. the academic value of the calculated paper i. Δ can be freely set according to the required accuracy, and can be set to Δ =10 in general -1 。
Step S406, sorting the articles according to academic values of the articles.
Through the steps, the weight of the network directed edge can be set autonomously, namely the influence degree of the reference time on the reference is set autonomously, and the autonomous adjustment capability of a user on the weight of the system input parameters is improved.
In one embodiment, the degree of decorrelation of temporal weights to publication times of a paper may be adjusted by an input parameter. In this embodiment, the weight proportion of the paper release time can be autonomously adjusted by the user, the user can increase or decrease the influence weight of the paper release time on the paper academic value calculation according to needs, and the papers can be more flexibly sorted in different ways.
In one embodiment, calculating the academic value of the paper based on the reference vectors, the time weights and the node recency comprises: assigning the academic value of the paper to 1 initially; calculating academic values of the thesis according to the reference vectors, the time weights and the degrees of the nodes; setting a precision parameter; and performing precision verification on the academic value of the paper obtained by calculation according to the precision parameter, updating the academic value of the paper in a scene that the precision of the academic value of the paper meets the requirement of the precision parameter, and calculating the academic value of the paper again according to the reference vector, the time weight and the node degree in a scene that the precision of the academic value of the paper does not meet the requirement of the precision parameter. In this embodiment, the initial academic value of each node is assigned to 1 for initialization, so as to provide a uniform initial value for the academic value calculation in the subsequent steps; the precision verification of the academic value of the thesis obtained by calculation according to the precision parameters in the steps has the advantages that after the calculation result of the academic value is obtained, a user sets the precision requirement independently and conducts precision verification on the numerical value, and the problem that the output of the sequencing result is inaccurate due to overlarge errors can be effectively solved.
The present embodiment further provides a sorting apparatus based on network reference time information, where the apparatus is used to implement the foregoing embodiments and preferred embodiments, and details are not repeated after the description is given. As used below, the terms "module," "unit," "sub-unit," and the like may implement a combination of software and/or hardware of predetermined functions. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 5 is a block diagram of a sorting apparatus based on cited network time information according to an embodiment of the present application, and as shown in fig. 5, the apparatus includes: an obtaining module 51, configured to obtain a reference relationship of a paper in a paper database; a corresponding relationship construction module 52, configured to construct a corresponding relationship between the network node and the thesis, and obtain a reference vector according to the reference relationship and the corresponding relationship; a reference parameter setting module 53, configured to calculate a reference parameter of academic value of the thesis; an academic value calculation module 54, configured to calculate an academic value of the thesis according to the reference vector; and the sorting module 55 is used for sorting the papers according to the academic value of the papers.
The above modules may be functional modules or program modules, and may be implemented by software or hardware. For a module implemented by hardware, the above modules may be located in the same processor; or the modules can be respectively positioned in different processors in any combination.
In addition, the sorting method based on the cited network time information in the embodiment of the present application described in conjunction with fig. 1 may be implemented by a sorting device based on the cited network time information. Fig. 6 is a schematic hardware structure diagram of a sorting device based on cited network time information according to an embodiment of the present application.
The sorting device based on referring to network time information may comprise a processor 61 and a memory 62 storing computer program instructions.
Specifically, the processor 61 may include a Central Processing Unit (CPU), or A Specific Integrated Circuit (ASIC), or may be configured to implement one or more Integrated circuits of the embodiments of the present Application.
Memory 65 may include, among other things, mass storage for data or instructions. By way of example, and not limitation, memory 65 may include a Hard Disk Drive (Hard Disk Drive, abbreviated to HDD), a floppy Disk Drive, a Solid State Drive (SSD), flash memory, an optical Disk, a magneto-optical Disk, tape, or a Universal Serial Bus (USB) Drive or a combination of two or more of these. Memory 65 may include removable or non-removable (or fixed) media, where appropriate. The memory 65 may be internal or external to the data processing apparatus, where appropriate. In a particular embodiment, the memory 65 is a Non-Volatile (Non-Volatile) memory. In particular embodiments, memory 65 includes Read-Only Memory (ROM) and Random Access Memory (RAM). The ROM may be mask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically Erasable PROM (EEPROM), electrically rewritable ROM (EAROM), or FLASH Memory (FLASH), or a combination of two or more of these, where appropriate. The RAM may be a Static Random-Access Memory (SRAM) or a Dynamic Random-Access Memory (DRAM), where the DRAM may be a Fast Page Mode Dynamic Random-Access Memory (FPMDRAM), an Extended data output Dynamic Random-Access Memory (EDODRAM), a Synchronous Dynamic Random-Access Memory (SDRAM), and the like.
Memory 65 may be used to store or cache various data files for processing and/or communication use, as well as possibly computer program instructions for execution by processor 62.
The processor 61 reads and executes the computer program instructions stored in the memory 62 to implement any one of the sorting methods based on the reference network time information in the above embodiments.
In some of these embodiments, the sorting device based on reference network time information may further include a communication interface 63 and a bus 60. As shown in fig. 6, the processor 61, the memory 62, and the communication interface 63 are connected via a bus 60 to complete mutual communication.
The communication interface 63 is used for implementing communication between modules, devices, units and/or apparatuses in the embodiments of the present application. The communication interface 63 may also enable communication with other components such as: the data communication is carried out among external equipment, image/data acquisition equipment, a database, external storage, an image/data processing workstation and the like.
The bus 60 comprises hardware, software, or both that couple the components of the sequencing device to each other based on the referenced network time information. Bus 60 includes, but is not limited to, at least one of the following: data Bus (Data Bus), address Bus (Address Bus), control Bus (Control Bus), expansion Bus (Expansion Bus), and Local Bus (Local Bus). By way of example and not limitation, bus 60 may include an Accelerated Graphics Port (AGP) or other Graphics Bus, an Enhanced Industry Standard Architecture (EISA) Bus, a Front-Side Bus (FSB), a Hyper Transport (HT) Interconnect, an ISA (ISA) Bus, an InfiniBand (InfiniBand) Interconnect, a Low Pin Count (LPC) Bus, a memory Bus, a microchannel Architecture (MCA) Bus, a PCI (Peripheral Component Interconnect) Bus, a PCI-Express (PCI-X) Bus, a Serial Advanced Technology Attachment (SATA) Bus, a vlslave Bus, a Video Bus, or a combination of two or more of these suitable electronic buses. Bus 60 may include one or more buses, where appropriate. Although specific buses are described and shown in the embodiments of the application, any suitable buses or interconnects are contemplated by the application.
The sorting device based on the cited network time information can execute the sorting method based on the cited network time information in the embodiment of the application based on the obtained sorting based on the cited network time information, thereby realizing the sorting method based on the cited network time information described in conjunction with fig. 1.
In addition, in combination with the sorting method based on the cited network time information in the foregoing embodiments, the embodiments of the present application may be implemented by providing a computer-readable storage medium. The computer readable storage medium having stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement any of the above-described embodiments of a method for reference network time information based ordering.
Compared with the prior art, the method has the following advantages:
1. according to the academic evaluation ranking method, the time information quoted by the thesis is utilized, and the citation network is constructed, so that the method can effectively utilize the time information, reduce the cumulative effect of the thesis citation along with time, and provide an accurate and objective method for evaluating scientific and technological documents.
2. The algorithm parameters are determined by the reference set in a mode of setting the reference set, and the reference set is used as reference when the academic values of other papers are calculated, so that the method has high reliability and autonomy.
3. The method and the system are user-oriented in a packaging system mode, have the characteristics of simplicity and easiness in operation, and are low in learning cost.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above examples only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (9)
1. A sorting method based on reference network time information is characterized by comprising the following steps:
acquiring a reference relation of papers in a paper database, wherein the papers are stored in the paper database and need academic value ordering;
constructing a reference network according to the reference relation, wherein network nodes exist in the reference network;
constructing a corresponding relation between a network node and a paper, and obtaining a reference vector according to the reference relation and the corresponding relation;
calculating a temporal weight of the reference vector, wherein the temporal weight is inversely related to a publication time of the paper;
calculating the out degree of the node;
calculating academic values of the papers according to the reference vectors, the time weights and the out-degrees of the nodes;
and ordering the papers according to the academic values of the papers.
2. The method of claim 1, wherein the constructing correspondence between network nodes and papers, and the obtaining reference vectors according to the reference relationships and the correspondence comprises:
uniquely corresponding the papers to the network nodes, wherein the unique correspondence means that each paper uniquely corresponds to one node;
and assigning the value of the reference vector as the number of times of reference between the papers, and assigning the direction of the reference vector as the reference and referred relation between the papers.
3. The method of claim 1, wherein before calculating the academic merit of the paper based on the reference vector, the method further comprises:
calculating an academic value of a reference corpus, wherein the reference corpus refers to a set of paper constituents which are identified as having value;
and determining algorithm parameters through the academic values of the benchmark discourse sets.
4. The method of claim 1, wherein the degree of the decorrelation of the temporal weight with respect to the publication time of the paper is adjustable by an input parameter.
5. The method of claim 1, wherein calculating the academic value of the paper according to the reference vector, the time weight and the node out-degree comprises:
initially assigning an academic value of the paper to 1;
calculating academic values of the papers according to the reference vectors, the time weights and the out-degrees of the nodes;
setting a precision parameter;
and performing precision check on the academic value of the thesis obtained by calculation according to the precision parameter, updating the academic value of the thesis in a scene that the academic value precision of the thesis meets the requirement of the precision parameter, and calculating the academic value of the thesis again according to the reference vector, the time weight and the node degree in a scene that the academic value precision of the thesis does not meet the requirement of the precision parameter.
6. The method of claim 1, wherein ranking the papers according to their academic value comprises:
acquiring the academic value of the thesis obtained through calculation;
sorting the papers in descending order according to the academic value of the papers;
and outputting the ranking result of the paper.
7. An apparatus for sorting based on cited network time information, comprising:
the acquisition module is used for acquiring the reference relation of the papers in the papers database;
the corresponding relation construction module is used for constructing the corresponding relation between the network node and the thesis and obtaining a reference vector according to the reference relation and the corresponding relation;
the benchmark parameter setting module is used for calculating benchmark parameters of academic values of the thesis;
an academic value calculation module used for calculating the academic value of the thesis according to the reference vector;
and the ordering module is used for ordering the thesis according to the academic value of the thesis.
8. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the computer program to perform the method of sorting based on reference network time information according to any one of claims 1 to 6.
9. A storage medium, in which a computer program is stored, wherein the computer program is configured to execute the method for sorting based on referral network time information according to any one of claims 1-6 when running.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011442490.2A CN112540990B (en) | 2020-12-08 | 2020-12-08 | Sorting method, device and storage medium based on reference network time information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011442490.2A CN112540990B (en) | 2020-12-08 | 2020-12-08 | Sorting method, device and storage medium based on reference network time information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112540990A CN112540990A (en) | 2021-03-23 |
| CN112540990B true CN112540990B (en) | 2023-04-07 |
Family
ID=75018224
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011442490.2A Active CN112540990B (en) | 2020-12-08 | 2020-12-08 | Sorting method, device and storage medium based on reference network time information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112540990B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116811A (en) * | 2013-01-30 | 2013-05-22 | 武汉大学 | Patent value evaluation method based on value delivery |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3391073A4 (en) * | 2015-12-15 | 2019-11-27 | Nokia Solutions and Networks Oy | Positioning of mobile device |
| CN106778011A (en) * | 2016-12-29 | 2017-05-31 | 大连理工大学 | A kind of scholar's influence power appraisal procedure based on academic heterogeneous network |
| CN107391659B (en) * | 2017-07-18 | 2020-05-22 | 北京工业大学 | Citation network academic influence evaluation ranking method based on credibility |
| CN110889643A (en) * | 2019-12-04 | 2020-03-17 | 深圳大学 | Paper quality evaluation method and system |
-
2020
- 2020-12-08 CN CN202011442490.2A patent/CN112540990B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103116811A (en) * | 2013-01-30 | 2013-05-22 | 武汉大学 | Patent value evaluation method based on value delivery |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112540990A (en) | 2021-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110851529B (en) | Calculation power scheduling method and related equipment | |
| US10679145B2 (en) | System and method for balancing computation with communication in parallel learning | |
| US10585726B2 (en) | Parameter-sharing apparatus and method | |
| WO2018176385A1 (en) | System and method for network slicing for service-oriented networks | |
| CN106301868B (en) | The method and apparatus for determining the importance of network node | |
| CN112506643A (en) | Load balancing method and device of distributed system and electronic equipment | |
| CN108090503B (en) | Online adjustment method and device for multiple classifiers, storage medium and electronic equipment | |
| US20170102971A1 (en) | Method and Apparatus for Workload Placement on Heterogeneous Systems | |
| CN110188862B (en) | Searching method, device and system for model hyper-parameters for data processing | |
| CN109213774B (en) | Data storage method and device, storage medium and terminal | |
| CN112001491A (en) | Search method and device for determining neural network architecture for processor | |
| US9262221B2 (en) | Calculating the rank of multiple virtual machines based on a negative correlation between the rank and each of the computational capacity and monetary investment | |
| CN112540990B (en) | Sorting method, device and storage medium based on reference network time information | |
| CN109041236B (en) | Wireless resource allocation method and device for services with different weights | |
| CN108920601B (en) | Data matching method and device | |
| CN111008873B (en) | User determination method, device, electronic equipment and storage medium | |
| US20210304025A1 (en) | Dynamic quality of service management for deep learning training communication | |
| CN114338386B (en) | Network configuration method and device, electronic equipment and storage medium | |
| CN113592590A (en) | User portrait generation method and device | |
| CN109344119B (en) | File merging processing method and device, computing equipment and computer storage medium | |
| CN110889643A (en) | Paper quality evaluation method and system | |
| CN110377533A (en) | It is a kind of for cloud computing and the caching replacement method and device of edge calculations | |
| WO2015135182A1 (en) | Method and apparatus for evaluating performance of real-time system | |
| CN115237610B (en) | Elastic expansion method and device based on Kubernetes container cloud platform and application | |
| CN112669893B (en) | Method, system, device and equipment for determining read voltage to be used |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |