CN114579675B - Data processing system for determining common finger event - Google Patents

Data processing system for determining common finger event Download PDF

Info

Publication number
CN114579675B
CN114579675B CN202210480177.0A CN202210480177A CN114579675B CN 114579675 B CN114579675 B CN 114579675B CN 202210480177 A CN202210480177 A CN 202210480177A CN 114579675 B CN114579675 B CN 114579675B
Authority
CN
China
Prior art keywords
entity
event
list
determining
cluster
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
Application number
CN202210480177.0A
Other languages
Chinese (zh)
Other versions
CN114579675A (en
Inventor
唐亚萍
常鸿宇
傅晓航
林方
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhongke Yuchen Technology Co Ltd
Original Assignee
Zhongke Yuchen Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhongke Yuchen Technology Co Ltd filed Critical Zhongke Yuchen Technology Co Ltd
Priority to CN202210480177.0A priority Critical patent/CN114579675B/en
Publication of CN114579675A publication Critical patent/CN114579675A/en
Application granted granted Critical
Publication of CN114579675B publication Critical patent/CN114579675B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • G06F16/288—Entity relationship models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/22—Matching criteria, e.g. proximity measures

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to a data processing system for determining coreference events. The system comprises: a database, a processor and a memory storing a computer program which, when executed by the processor, performs the steps of: acquiring a first entity list corresponding to a first event and a second entity list corresponding to a second event, clustering the first entity list to obtain a first entity cluster list, clustering the second entity list to obtain a second entity cluster list, acquiring the same number of entity clusters and event similarity between the first event and the second event according to the first entity cluster list and the second entity cluster list, and determining whether the first event and the second event are the same event according to the event similarity; the method and the device can accurately determine that the two events represent the same event, avoid repeated query of the user and improve the experience of the user on the one hand, and avoid the repeated text describing the same event on the other hand, thereby reducing the text amount of the event.

Description

Data processing system for determining common-finger events
Technical Field
The invention relates to the technical field of event processing, in particular to a data processing system for determining a common finger event.
Background
Currently, each event is independent, but in practice, there is often an association relationship between two events, or two events are to be referred to as representing the same event, and are divided into two events when events are classified only due to different ways of describing the events.
Therefore, some problems arise: for example, on one hand, two events are used for representing the same event, which causes the user to repeatedly query the same event, which affects the experience of the user, and on the other hand, because the two events represent the same event, the text corresponding to each event has repeated text, which causes a large amount of text.
Disclosure of Invention
In view of the above technical problems, the technical solution adopted by the present invention is a data processing system for determining a common denominator event, the system comprising: database, departmentA processor and a memory storing a computer program, wherein the database comprises: text set of events H = { H = { H =1，……，Hr，……，Hs}，HrReferring to a text list corresponding to the r-th event, r =1 … … s, s being the number of events, when said computer program is executed by a processor, the following steps are implemented:
s100, traversing H and according to HrAcquiring a first entity list a = { a } corresponding to the first event1，……，Ai，……，AM}，AiThe method is characterized by comprising the following steps of (1) referring to an ith first entity corresponding to a first event, wherein i =1 … … M, and M is the number of the first entities;
s200, according to HrAcquiring a second entity list B = { B ] corresponding to the second event1，……，Bj，……，BN}，BjJ =1 … … N, where N is the number of second entities;
s300, for all AiClustering to obtain a first entity cluster list C = { C = { (C) }1，……，Cx，……，Cp}，CxThe method refers to the x-th first entity cluster, wherein x =1 … … p, and p is the first entity cluster;
s400, for all BjClustering to obtain a second entity cluster list D = { D = { (D) }1，……，Dy，……，Dq}，DyThe method is characterized in that the method refers to the y-th second entity cluster, wherein y =1 … … q, and q is the second entity cluster;
s500, when CxAnd DyWhen they are consistent, determine CxThe corresponding first entity cluster is a target entity cluster;
s600, acquiring the number k of the target entity clusters and acquiring event similarity F between a first event and a second event based on k;
s700, when F is more than or equal to F0Determining that the first event and the second event refer to the same event, wherein F0The method comprises the steps of (1) referring to a preset event similarity threshold value;
s800, when F is less than F0Determining that the first event and the second event are not co-designatedThe same event.
Compared with the prior art, the invention has obvious advantages and beneficial effects. By means of the technical scheme, the data processing system for determining the common reference event provided by the invention can achieve considerable technical progress and practicability, has wide industrial utilization value and at least has the following advantages:
a data processing system for determining a co-referent event according to the present invention comprises: a database, a processor, and a memory storing a computer program, wherein the database comprises: a text set of events, which when executed by a processor, performs the steps of: acquiring a first entity list corresponding to a first event and a second entity list corresponding to a second event according to a text list of any event in a text set of the event, clustering all first entities in the first entity list to obtain a first entity cluster list, clustering all second entities in the second entity list to obtain a second entity cluster list, acquiring the same number of entity clusters in the first entity cluster list and the second entity cluster list according to the first entity cluster list and the second entity cluster list so as to acquire the event similarity between the first event and the second event according to the same number of entity clusters, and determining whether the first event and the second event are the same event according to the event similarity; the method has the advantages that the same event represented by the two events can be accurately determined, repeated query of a user is avoided, experience of the user is improved, the same event is prevented from being described by texts of repeated texts, and the text quantity of the events is reduced.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical means of the present invention more clearly understood, the present invention may be implemented in accordance with the content of the description, and in order to make the above and other objects, features, and advantages of the present invention more clearly understood, the following preferred embodiments are described in detail with reference to the accompanying drawings.
Drawings
FIG. 1 is a flow chart of a computer program executed by a data processing system for determining co-designated events according to an embodiment of the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention adopted to achieve the predetermined objects, the following detailed description will be given for the specific implementation and effects of a data processing system for acquiring a target position according to the present invention with reference to the accompanying drawings and preferred embodiments.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in other sequences than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Examples
The present embodiment provides a data processing system for determining a co-referred event, the system comprising: a database, a processor, and a memory storing a computer program, wherein the database comprises: text set of events H = { H = { H =1，……，Hr，……，Hs}，HrRefers to the text list corresponding to the r-th event, r =1 … … s, s is the number of events, and when the computer program is executed by a processor, the following steps are implemented, as shown in fig. 1:
s100, traversing H and according to HrAcquiring a first entity list A = { A) corresponding to the first event1，……，Ai，……，AM}，AiThe method refers to the ith first entity corresponding to the first event, i =1 … … M, and M is the number of the first entities.
Specifically, a is also acquired in the S100 step by:
s101, determining any H from HrTaking the corresponding event as a first event;
s103, obtaining
Figure 593395DEST_PATH_IMAGE002
，HraRefers to the a text of the r event, where a =1 … … er，erThe number of texts referring to the r-th event;
s105, for HraPerforming entity extraction to obtain HraA corresponding first initial entity list and obtaining a first intermediate entity list based on all the first initial entity lists, wherein a person skilled in the art can adopt any entity extraction method in the prior art, and details are not repeated herein;
s107, performing deduplication processing on the first intermediate entity list to obtain a, which may be any entity deduplication method by a person skilled in the art and is not described herein again.
S200, according to HrObtaining a second entity list B = { B ] corresponding to the second event1，……，Bj，……，BN}，BjThe number of the j second entities corresponding to the second event is referred to, j =1 … … N, and N is the number of the second entities.
Specifically, B is also acquired in the S200 step by:
s201, deleting H from HrCorresponding text list, obtaining the intermediate text set H ' = { H ' of the event '1，……，H't，……，H's-1}，H'tThe method comprises the steps that a text list corresponding to the t-th event in a middle text set of the event is defined, and t =1 … … s-1;
s203, determining any H 'from H'tTaking the corresponding event as a second event;
s205, obtaining
Figure 743753DEST_PATH_IMAGE003
，H'tbRefers to the b-th text of the t-th event, where b =1 … … ft，ftThe number of texts of the t-th event is referred to;
s207, p H'tbExtracting entity to obtain H'tbA corresponding second initial entity list and a second intermediate entity list are obtained based on all the second initial entity lists, wherein a person skilled in the art can adopt any entity extraction method in the prior art, and details are not repeated herein;
s209, performing deduplication processing on the second intermediate entity list to obtain B, and those skilled in the art may adopt any entity deduplication method, which is not described herein again.
S300, for all AiClustering to obtain a first entity cluster list C = { C = { (C) }1，……，Cx……，Cp}，CxRefers to the x-th first entity cluster, x =1 … … p, p is the first entity cluster.
Specifically, the step S300 further includes the steps of:
s301, obtaining a first ontology list A '= { A'1，……，A'α，……，A'm}，A'αRefers to the α -th first body corresponding to a, α =1 … … m, and m is the number of first bodies corresponding to a.
Specifically, a' is also acquired in the following steps before the step S301:
s3011, obtaining AiCorresponding body and based on all AiThe corresponding ontology is constructed into a first initial ontology list corresponding to the A, and a person skilled in the art can obtain the ontology by adopting any method in the prior art, which is not described herein again; the first initial ontology list comprises a plurality of ontology types, e.g. places, people, etc.
S3013, performing deduplication processing on the first initial ontology list corresponding to a to obtain a', where a person skilled in the art may obtain the first ontology list by using any deduplication method in the prior art, and details are not described here.
S303, obtaining A'αCorresponding entity list
Figure 322371DEST_PATH_IMAGE004
，UαgMeans the entity list corresponding to the alpha first ontologyG =1 … … of the g-th first entity
Figure 583588DEST_PATH_IMAGE006
，
Figure 799937DEST_PATH_IMAGE008
Is of A'αThe number of the first entity in the corresponding entity list.
S305 according to UαgObtaining UαgCorresponding first Key entity List U'αg={U1 αg，……，Uβ αg，……，Uz αg}，Uβ αgIs beta to the UαgThe corresponding first key entity, β =1 … … z, meets the following condition:
Figure 793301DEST_PATH_IMAGE010
。
specifically, UαgThe corresponding first key entity is denoted at A'αDivide U in corresponding entity listαgAny first entity other than.
S307, according to UαgAnd U'αgObtaining UαgCorresponding first entity similarity list Tαg={T1 αg，……，Tβ αg，……，TZ αg}，Tβ αgRefers to UαgAnd Uβ αgThe entity similarity between them.
In particular, Tβ αgThe following conditions are met:
Figure 344368DEST_PATH_IMAGE012
wherein, in the process,
Figure 192631DEST_PATH_IMAGE014
refers to UαgThe corresponding gamma bit value, NK, in the vectorβ γIs referred to as Uβ αgThe γ -th bit bi in the corresponding vectort value, γ =1 … …
Figure 778334DEST_PATH_IMAGE016
，
Figure 755648DEST_PATH_IMAGE018
Is referred to as UαgVector dimension in corresponding vector and Uβ αgCorresponding vector and UαgThe vector dimensions of the corresponding vectors are consistent.
Preferably, UαgCorresponding vector sum Uβ αgThe corresponding vectors are obtained through a pre-training language model, such as a Bert model, a sense-transformer model, and the like.
Further, UαgCorresponding vector sum Uβ αgThe corresponding vector is a 768-dimensional vector, i.e.
Figure 794011DEST_PATH_IMAGE020
=768。
S309 according to TαgAnd acquiring a first entity cluster.
Specifically, the step S309 further includes the steps of:
s3091, go through TαgWhen each T isβ αg＜F'0Determining UαgIs a first solid cluster of which F'0Refers to a predetermined entity similarity.
Preferably, F'0Is 0.6.
S3092, when any Tβ αg≥F'0From TαgThe first key entity corresponding to the maximum similarity is obtained as the first target entity and is based on the first target entity and the UαgBuilding UαgCorresponding first intermediate entity clusters.
S3093, according to the vector corresponding to the first target entity
Figure 69135DEST_PATH_IMAGE021
Figure 758611DEST_PATH_IMAGE023
And UαgCorresponding vector
Figure 952832DEST_PATH_IMAGE024
Figure DEST_PATH_IMAGE025
Obtaining UαgVectors of corresponding intermediate solid clusters
Figure DEST_PATH_IMAGE027
Figure DEST_PATH_IMAGE029
Wherein, in the step (A),
Figure DEST_PATH_IMAGE031
refers to the gamma bit value in the vector corresponding to the first target entity,
Figure 933951DEST_PATH_IMAGE032
means that
Figure 560235DEST_PATH_IMAGE033
The corresponding average value, wherein,
Figure 120530DEST_PATH_IMAGE035
the following conditions are met:
Figure 938182DEST_PATH_IMAGE037
。
s3094 according to UαgCorresponding intermediate solid clusters and UαgCorresponding first appointed entity list, obtaining UαgCorresponding first intermediate similarity list, wherein UαgAny one of the corresponding first intermediate similarity lists
Figure 888820DEST_PATH_IMAGE038
Corresponding intermediate degree of similarity means
Figure 833642DEST_PATH_IMAGE040
And any UαgSimilarity between vectors of corresponding first designated entities.
In particular, UαgThe corresponding first designated entity is 'U'αgAny first key entity other than the first target entity.
In particular, the amount of the solvent to be used,
Figure 999176DEST_PATH_IMAGE041
corresponding intermediate similarity obtaining method and Tβ αgThe obtaining methods are consistent and are not described herein again.
S3095, mixing UαgInserting the first designated entity corresponding to the maximum similarity obtained from the corresponding first intermediate similarity list into UαgIn the corresponding intermediate entity cluster, new U is generatedαgCorresponding intermediate solid clusters.
S3096, repeating the steps S3093-S305 until UαgEach similarity in the corresponding similarity list is less than F'0While determining UαgTaking an intermediate entity cluster corresponding to the corresponding final similarity list as a first entity cluster; it can be understood that: different entities are clustered into an entity cluster, so that whether different events refer to the same event or not is determined according to the same number of the entity clusters among different events, and the experience of users is improved.
S400, for all BjClustering to obtain a second entity cluster list D = { D =1，……，Dy，……，Dq}，DyThe method refers to the y-th second entity cluster, wherein y =1 … … q, and q is the second entity cluster.
Specifically, the acquisition method of the second entity cluster is consistent with the acquisition method of the first entity cluster, and is not described herein again.
S500, when CxAnd DyWhen they are consistent, determine CxThe corresponding first entity cluster is a target entity cluster;
specifically, the method further comprises the following steps of target entity clusters in the step S500:
s501, obtaining Cx={Cx1，……，Cxη，……，Cxn}，CxηThe method is characterized in that the method refers to an eta first entity in an x first entity cluster, eta =1 … … n, and n is the number of the first entities in the x first entity cluster;
s503, obtaining Dy={Dy1，……，Dyδ，……，DywThe Dy delta refers to a delta second entity in a y second entity cluster, delta =1 … … w, and w is the number of the second entities in the y second entity cluster;
s505, when Cxη=DyδWhen, C is determinedxAnd the corresponding first entity cluster is a target entity cluster.
S600, acquiring the number k of the target entity clusters and acquiring the event similarity F between the first event and the second event based on k.
Specifically, F satisfies the following condition:
F=2k/（p+q）。
in a specific embodiment, F further satisfies the following condition:
F=k（p+q）/2pq。
s700, when F is more than or equal to F0When the first event and the second event refer to the same event, namely the first event and the second event are determined as the common events, wherein F0Refers to a preset event similarity threshold.
Specifically, the method further includes the following steps before the step S700:
when F =2 k/(p + q), F is determined0=F01Wherein, F01Is a preset first similarity threshold;
when F = k (p + q)/2 pq, F is determined0=F02Wherein F is02Is a preset second similarity threshold.
In the above, different similarity thresholds are determined according to different acquisition modes of the similarity, so that the method can be accurate.
Further, F01≠F02Preferably, F01Has a value of 0.8, F02Is 0.85.
S800, when F is less than F0When it is determined that the first event and the second event do not refer to the same event in common。
The embodiment provides a data processing system for determining a common finger event, which comprises: a database, a processor, and a memory storing a computer program, wherein the database comprises: a text set of events, which when executed by a processor, performs the steps of: acquiring a first entity list corresponding to a first event and a second entity list corresponding to a second event according to a text list of any event in a text set of the event, clustering all first entities in the first entity list to obtain a first entity cluster list, clustering all second entities in the second entity list to obtain a second entity cluster list, acquiring the same number of entity clusters in the first entity cluster list and the second entity cluster list according to the first entity cluster list and the second entity cluster list so as to acquire the event similarity between the first event and the second event according to the same number of entity clusters, and determining whether the first event and the second event refer to the same event or not according to the event similarity; on one hand, the method can accurately determine that two events represent the same event, avoid repeated inquiry of a user and improve the experience of the user, and on the other hand, avoid the texts of repeated texts to describe the same event and reduce the text amount of the events.
Although the present invention has been described with reference to a preferred embodiment, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (8)

1. A data processing system for determining coreference events, the system comprising: a database, a processor and a memory storing a computer program, wherein the database comprises: text set of events H = { H = { (H)1，……，Hr，……，Hs}，HrRefers to a text list corresponding to the r-th event, r =1 … … s, s is the number of events, and when the computer program is executed by a processor, the following steps are implemented:
s100, traversing H and according to HrAcquiring a first entity list A = { A) corresponding to the first event1，……，Ai，……，AM}，AiThe method refers to the ith first entity corresponding to the first event, i =1 … … M, and M is the number of the first entities;
wherein, in the step S100, a is further acquired by:
s101, determining any H from HrTaking the corresponding event as a first event;
s103, acquiring Hr={Hr1，……，Hra，……，
Figure DEST_PATH_IMAGE001
}，HraRefers to the a-th text of the r-th event, where a =1 … … er，erThe number of texts referring to the r-th event;
s105, for HraPerforming entity extraction to obtain HraAcquiring a first intermediate entity list based on all the first initial entity lists corresponding to the first initial entity lists;
s107, carrying out duplicate removal processing on the first intermediate entity list to obtain A;
s200, according to HrObtaining a second entity list B = { B ] corresponding to the second event1，……，Bj，……，BN}，BjJ =1 … … N, where N is the number of second entities;
wherein, in the step S200, B is further acquired by:
s201, deleting H from HrAcquiring a corresponding text list to obtain a middle text set H ' = { H ' of the event '1，……，H't，……，H's-1}，H'tMean intermediate text set of eventsA text list corresponding to the t-th event, t =1 … … s-1;
s203, determining any H 'from H'tTaking the corresponding event as a second event;
s205, obtaining H't={H't1，……，H'tb，……，
Figure 337032DEST_PATH_IMAGE002
}，H'tbRefers to the b-th text of the t-th event, where b =1 … … ft，ftThe number of texts referring to the t event;
s207, to H'tbExtracting entity to obtain H'tbA corresponding second initial entity list is obtained, and a second intermediate entity list is obtained based on all the second initial entity lists;
s209, carrying out duplicate removal processing on the second intermediate entity list to obtain B
S300, for all AiClustering to obtain a first entity cluster list C = { C = { (C) }1，……，Cx，……，Cp}，CxRefers to the x-th first entity cluster, x =1 … … p, p is the first entity cluster;
s400, for all BjClustering to obtain a second entity cluster list D = { D = { (D) }1，……，Dy，……，Dq}，DyRefers to the y second entity cluster, y =1 … … q, q is the second entity cluster;
s500, when CxAnd DyWhen they are consistent, determining CxThe corresponding first entity cluster is a target entity cluster;
s600, acquiring the number k of the target entity clusters and acquiring event similarity F between a first event and a second event based on k;
s700, when F is more than or equal to F0Determining that the first event and the second event refer to the same event, wherein F0The method comprises the steps of (1) referring to a preset event similarity threshold value;
s800, when F is less than F0Determining that the first event and the second event do not refer to the same event.
2. The data processing system for determining co-reference events according to claim 1, further comprising the following steps in step S300:
s301, obtaining a first ontology list A '= { A'1，……，A'α，……，A'm}，A'αThe number of the alpha first ontologies corresponding to A is defined, alpha =1 … … m, and m is the number of the first ontologies corresponding to A;
s303, obtaining A'αCorresponding entity list Uα={Uα1，……，Uαg，……，
Figure DEST_PATH_IMAGE003
}，UαgThe method refers to the g-th first entity in the entity list corresponding to the alpha-th first ontology, and g =1 … …
Figure 536064DEST_PATH_IMAGE004
，
Figure 863271DEST_PATH_IMAGE004
Is of A'αThe number of first entities in the corresponding entity list;
s305 according to UαgObtaining UαgCorresponding first Key entity List U'αg={U1 αg，……，Uβ αg，……，Uz αg}，Uβ αgIs beta to the UαgThe corresponding first key entity, β =1 … … z, meets the following condition: z =
Figure 320797DEST_PATH_IMAGE004
-1；
S307, according to UαgAnd U'αgObtaining UαgCorresponding first entity similarity list Tαg={T1 αg，……，Tβ αg，……，TZ αg}，Tβ αgRefers to UαgAnd Uβ αgEntity similarity between, wherein Tβ αgThe following conditions are met:
Figure DEST_PATH_IMAGE005
wherein, in the process,
MKαg γrefers to UαgThe corresponding gamma bit value, NK, in the vectorβ γIs referred to as Uβ αgThe gamma bit value in the corresponding vector, gamma =1 … … phi, phi means UαgVector dimension in corresponding vector and Uβ αgCorresponding vector and UαgThe vector dimensions of the corresponding vectors are consistent;
s309 according to TαgAnd acquiring the first entity cluster.
3. The data processing system for determining a co-reference event as claimed in claim 1, wherein in step S400, the acquiring method of the second entity cluster is identical to the acquiring method of the first entity cluster.
4. The data processing system for determining co-referent events according to claim 1, wherein F satisfies the following condition:
F=2k/（p+q）。
5. the data processing system for determining co-referent events according to claim 1, wherein F satisfies the following condition:
F=k（p+q）/2pq。
6. the data processing system for determining co-reference events according to claim 4 or 5, further comprising the following steps before the step of S700:
when F =2 k/(p + q), F0=F01Wherein F is01Is a preset first similarity threshold;
when F = k (p + q)/2 pq, F0=F02Wherein F is02Is a preset second similarity threshold.
7. The data processing system for determining co-designated events of claim 6, wherein the first similarity threshold value is 0.8.
8. The data processing system for determining co-designated events of claim 6, wherein the second similarity threshold value is 0.85.
CN202210480177.0A 2022-05-05 2022-05-05 Data processing system for determining common finger event Active CN114579675B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210480177.0A CN114579675B (en) 2022-05-05 2022-05-05 Data processing system for determining common finger event

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210480177.0A CN114579675B (en) 2022-05-05 2022-05-05 Data processing system for determining common finger event

Publications (2)

Publication Number Publication Date
CN114579675A CN114579675A (en) 2022-06-03
CN114579675B true CN114579675B (en) 2022-07-15

Family

ID=81784098

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210480177.0A Active CN114579675B (en) 2022-05-05 2022-05-05 Data processing system for determining common finger event

Country Status (1)

Country Link
CN (1) CN114579675B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114792085B (en) * 2022-06-22 2022-09-16 中科雨辰科技有限公司 Data processing system for error correction of label text
CN114925692B (en) * 2022-07-21 2022-10-11 中科雨辰科技有限公司 Data processing system for acquiring target event
CN115169319B (en) * 2022-07-21 2023-02-07 中科雨辰科技有限公司 Data processing system of identification symbol
CN115017269B (en) * 2022-08-05 2022-10-25 中科雨辰科技有限公司 Data processing system for determining similar texts
CN117435697B (en) * 2023-12-21 2024-03-22 中科雨辰科技有限公司 Data processing system for acquiring core event

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110633330A (en) * 2018-06-01 2019-12-31 北京百度网讯科技有限公司 Event discovery method, device, equipment and storage medium
CN112559745A (en) * 2020-12-11 2021-03-26 科大讯飞股份有限公司 Method and related device for determining hot event
CN114064918A (en) * 2021-11-06 2022-02-18 中国电子科技集团公司第五十四研究所 Multi-modal event knowledge graph construction method

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9189473B2 (en) * 2012-05-18 2015-11-17 Xerox Corporation System and method for resolving entity coreference
CN111143576A (en) * 2019-12-18 2020-05-12 中科院计算技术研究所大数据研究院 Event-oriented dynamic knowledge graph construction method and device
CN113282703B (en) * 2021-04-01 2022-05-06 中科雨辰科技有限公司 Method and device for constructing event associated map of news data
CN113468345B (en) * 2021-09-02 2021-12-07 中科雨辰科技有限公司 Entity co-reference detection data processing system based on knowledge graph

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110633330A (en) * 2018-06-01 2019-12-31 北京百度网讯科技有限公司 Event discovery method, device, equipment and storage medium
CN112559745A (en) * 2020-12-11 2021-03-26 科大讯飞股份有限公司 Method and related device for determining hot event
CN114064918A (en) * 2021-11-06 2022-02-18 中国电子科技集团公司第五十四研究所 Multi-modal event knowledge graph construction method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于触发词语义选择的Twitter事件共指消解研究;魏萍等;《计算机科学》;20181215(第12期);全文 *
王君泽等.面向共指事件识别的同义表述模式抽取研究.《情报学报》.2020,(第03期), *

Also Published As

Publication number Publication date
CN114579675A (en) 2022-06-03

Similar Documents

Publication Publication Date Title
CN114579675B (en) Data processing system for determining common finger event
CN114925692B (en) Data processing system for acquiring target event
Neykov et al. Robust fitting of mixtures using the trimmed likelihood estimator
Airoldi et al. Mixed membership stochastic block models for relational data with application to protein-protein interactions
Huang et al. Dirichlet process mixture model for document clustering with feature partition
CN111832289B (en) Service discovery method based on clustering and Gaussian LDA
CN108519971B (en) Cross-language news topic similarity comparison method based on parallel corpus
US10394872B2 (en) Learning topics by simulation of a stochastic cellular automaton
WO2021051508A1 (en) Robot dialogue generating method and apparatus, readable storage medium, and robot
Chen et al. Dependent normalized random measures
WO2021008037A1 (en) A-bilstm neural network-based text classification method, storage medium, and computer device
Gropp et al. Scalable dynamic topic modeling with clustered latent dirichlet allocation (clda)
Shatkay et al. Information retrieval meets gene analysis
CN113239697A (en) Entity recognition model training method and device, computer equipment and storage medium
Yin et al. Accelerating distributed Expectation–Maximization algorithms with frequent updates
Kundaje et al. Combining sequence and time series expression data to learn transcriptional modules
Zhou et al. GD-RDA: a new regularized discriminant analysis for high-dimensional data
CN115017269A (en) Data processing system for determining similar texts
De Iorio et al. Bayesian nonparametric mixture modeling for temporal dynamics of gender stereotypes
Corder et al. Estimating average treatment effects utilizing fractional imputation when confounders are subject to Missingness
CN113868424A (en) Text theme determining method and device, computer equipment and storage medium
Li et al. Learning management knowledge for manufacturing systems in the early stages using time series data
Das et al. Blocked Gibbs sampler for hierarchical Dirichlet processes
Zhang Epistatic clustering: a model-based approach for identifying links between clusters
Inoue et al. Improved parameter estimation for variance-stabilizing transformation of gene-expression microarray data

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