CN116186658A - User identity verification data processing system - Google Patents
User identity verification data processing system Download PDFInfo
- Publication number
- CN116186658A CN116186658A CN202310187162.XA CN202310187162A CN116186658A CN 116186658 A CN116186658 A CN 116186658A CN 202310187162 A CN202310187162 A CN 202310187162A CN 116186658 A CN116186658 A CN 116186658A
- Authority
- CN
- China
- Prior art keywords
- list
- initial
- target
- problem statement
- preset
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/31—User authentication
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3329—Natural language query formulation or dialogue systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/335—Filtering based on additional data, e.g. user or group profiles
-
- 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)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Computer Security & Cryptography (AREA)
- Databases & Information Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Artificial Intelligence (AREA)
- Human Computer Interaction (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a data processing system for user identity verification, which comprises: the method comprises the following steps of an initial text list, a preset problem statement template list, a processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the following steps are realized: acquiring an initial triplet list; acquiring an intermediate problem statement list; acquiring an intermediate word list corresponding to the intermediate problem statement list; acquiring a target problem statement list; acquiring a target word set; obtaining the keywords of the target user, comparing the keywords of the target user with each target word, and determining that the verification information of the user is normal information; it can be known that when the system sends out the questions, the questions are randomly sent out and the questions are questions with common sense and have no fixed answers, and when the user inputs the answers of the questions, the computer program can not obtain the answers of the questions with common sense through calculation, so that the user can only input the answers by himself to verify, and the safety of the system can be improved.
Description
Technical Field
The present invention relates to the field of information authentication, and in particular, to a data processing system for user authentication.
Background
The existing method for verifying information is mostly completed by comparing results, a system sends out questions with fixed answers, such as a simple calculation formula, a dynamic digital verification code, a graph given by clicking the system in sequence, and the like, a user inputs the answers according to the questions given by the system, when the answer input by the user is the same as the answer percentage of the questions stored in the system, the verification is passed, and otherwise, the verification is not passed.
However, the above method also has the following technical problems:
when the system sends out the questions, the questions are obtained from the database, the questions stored in the database are too simple and do not comprise the questions with non-fixed answers, and when the user inputs the answers of the questions, the user can obtain the answers by means of the computer program instead of inputting the answers by himself because the questions sent by the system have fixed answers and the answers of the questions can be calculated by the computer program, so that the system has lower safety.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
a data processing system for user authentication, comprising: initial text list a= { a 1 ，……，A i ，……，A m A list of preset question sentence templates, a processor and a memory storing a computer program, wherein A i For the i-th initial text, i= … … m, m being the initial text number, when the computer program is executed by the processor the following steps are implemented:
s100, pair A i Processing to obtain A i Corresponding initial triplet list B i ＝{B i1 ，……，B ij ，……，B in(i) }，B ij ＝{B 1 ij ，B 2 ij ，B 3 ij }，B 1 ij Is A i The first initial entity, B, in the corresponding jth initial triplet 2 ij Is A i Corresponding jthThe second initial entity in the initial triplet, B 3 ij Is B 1 ij And B 2 ij Initial association relation between the two, j= … … n (i), n (i) is A i Corresponding initial triplet number.
S200 according to B i And presetting a problem statement template list to obtain B i Corresponding intermediate question statement list C i ＝{C i1 ，……，C ij ，……，C in(i) }，C ij ＝{C 1 ij ，C 2 ij ，C 3 ij }，C 1 ij ＝{C 11 ij ，……，C 1r ij ，……，C 1s ij }，C 2 ij ＝{C 21 ij ，……，C 2r ij ，……，C 2s ij }，C 3 ij ＝{C 31 ij ，……，C 3r ij ，……，C 3s ij }，C 1r ij Is B 1 ij And B 2 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 2r ij Is B 1 ij And B 3 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 3r ij Is B 2 ij And B 3 ij And r= … … s, s are the number of intermediate problem sentences in the intermediate problem sentence list.
S300 according to C i Obtaining C i Corresponding intermediate word list D i ＝{D i1 ，……，D ij ，……，D in(i) }，D ij ＝{D 1 ij ，D 2 ij ，D 3 ij }，D 1 ij Is C 1r ij Corresponding intermediate word D 2 ij Is C 2r ij Corresponding intermediate word D 3 ij Is C 3r ij Corresponding intermediate words.
S400, all C i Processing is carried out, and a target problem statement list U= { U corresponding to the A is obtained 1 ，……，U x ，……，U p }，U x For the x-th target question statement corresponding to a, x= … … p, p is the number of target question statements corresponding to a, where the target question statement is for all C 1r ij 、C 2r ij And C 3r ij And performing intermediate problem statement after the duplicate removal processing.
S500, all D i Processing to obtain a target word set U corresponding to the U 0 ＝{U 0 1 ，……，U 0 x ，……，U 0 p }，U 0 x ＝{U 0 x1 ，……，U 0 xy ，……，U 0 xq(x) }，U 0 xy Is U (U) x Corresponding y-th target word, y= … … q (x), q (x) being U x The corresponding target word number is D which accords with a first preset condition 1 ij ，D 2 ij ，D 3 ij 。
S600, any U x And sending the message to the target user.
S700, when receiving the feedback U of the target user x Corresponding verification information, slave U x Obtaining the keyword of the target user from the corresponding verification information and combining the keyword of the target user with each U 0 xy And comparing to determine that the verification information of the user is normal information.
The invention has at least the following beneficial effects:
the invention provides a data processing system for user identity verification, which comprises: the method comprises the following steps of an initial text list, a preset problem statement template list, a processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the following steps are realized: acquiring an initial triplet list; acquiring an intermediate problem statement list according to the initial triplet list and a preset problem statement template list; acquiring an intermediate word list corresponding to the intermediate problem statement list; acquiring a target problem statement list; acquiring a target word set; obtaining the keywords of the target user, comparing the keywords of the target user with each target word, and determining that the verification information of the user is normal information; it can be known that when the system sends out the questions, the questions are randomly sent out and the questions are questions with common sense and have no fixed answers, and when the user inputs the answers of the questions, the computer program can not obtain the answers of the questions with common sense through calculation, so that the user can only input the answers by himself to verify, and the safety of the system can be improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a user authentication data processing system executing a computer program according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise 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 or inherent to such process, method, article, or apparatus, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
A first embodiment provides a data processing system for user authentication, including: initial text list a= { a 1 ，……，A i ，……，A m A list of preset question sentence templates, a processor and a memory storing a computer program, wherein A i For the i-th initial text, i= … … m, m is the initial text number, when the computer program is executed by the processor, the following steps are implemented, as shown in fig. 1:
s100, pair A i Processing to obtain A i Corresponding initial triplet list B i ＝{B i1 ，……，B ij ，……，B in(i) }，B ij ＝{B 1 ij ，B 2 ij ，B 3 ij }，B 1 ij Is A i The first initial entity, B, in the corresponding jth initial triplet 2 ij Is A i The second initial entity, B, in the corresponding jth initial triplet 3 ij Is B 1 ij And B 2 ij Initial association relation between the two, j= … … n (i), n (i) is A i The corresponding initial triplet number; one skilled in the art knows that any method of obtaining triples from text in the prior art belongs to the protection scope of the present invention, and is not described herein.
Specifically, the initial text is a text obtained from a knowledge database in a crawler manner, and the initial text is a text with initial character number not greater than a preset character number threshold, where a person skilled in the art knows that any knowledge database in the prior art belongs to the protection scope of the present invention, and is not described herein, for example, the knowledge database is a wikipedia database.
Preferably, the value of the preset character number threshold is 100, so that the situation that the preset character number is too large or too small is avoided, and the accuracy of acquiring the initial triples is low is avoided.
S200 according to B i And the preset problem statement template list is used for obtaining B i Corresponding intermediate question statement list C i ＝{C i1 ，……，C ij ，……，C in(i) }，C ij ＝{C 1 ij ，C 2 ij ，C 3 ij }，C 1 ij ＝{C 11 ij ，……，C 1r ij ，……，C 1s ij }，C 2 ij ＝{C 21 ij ，……，C 2r ij ，……，C 2s ij }，C 3 ij ＝{C 31 ij ，……，C 3r ij ，……，C 3s ij }，C 1r ij Is B 1 ij And B 2 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 2r ij Is B 1 ij And B 3 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 3r ij Is B 2 ij And B 3 ij And r= … … s, s are the number of intermediate problem sentences in the intermediate problem sentence list.
Specifically, the step S200 further includes the following steps:
s201, acquiring a preset problem statement template list E= { E 1 ，E 2 ，E 3 }，E 1 ＝{E 11 ，……，E 1r ，……，E 1s }，E 2 ＝{E 21 ，……，E 2r ，……，E 2s }，E 3 ＝{E 31 ，……，E 3r ，……，E 3s }，E 1r For the first initial entity and the firstThe r-th preset problem statement template in the preset problem statement template list corresponding to the two initial entities, E 2r For the r-th preset problem statement template in the preset problem statement template list corresponding to the initial association relationship between the first initial entity and the second initial entity, E 3r And the r-th preset problem statement template in the preset problem statement template list corresponding to the initial association relationship between the second initial entity and the first initial entity and the second initial entity.
Specifically, each preset problem statement template includes two slots to be filled and a plurality of preset characters, wherein one skilled in the art knows that any method for obtaining the preset problem statement template in the prior art belongs to the protection scope of the present invention, and is not described herein.
Further, the keyword types of the two slots to be filled in each preset problem statement template are different, and the keyword types can be any one of a first entity type, a second entity type and an initial association relationship type.
S203, B 1 ij Filling E into 1r B in the slots to be filled with the keyword type of the first entity type 2 ij Filling E into 1r C is constructed in the to-be-filled slot with the keyword type of the second entity type 1r ij 。
S205, B 1 ij Filling E into 2r B in the slots to be filled with the keyword type of the first entity type 3 ij Filling E into 2r C, constructing in the to-be-filled slot with the keyword type as the initial association type 2r ij 。
S207, will B 2 ij Filling E into 3r B in the slots to be filled with the keyword type of the second entity type 3 ij Filling E into 3r C, constructing in the to-be-filled slot with the keyword type as the initial association type 3r ij 。
The method comprises the steps of obtaining the intermediate problem statement according to the preset problem statement template list, processing the intermediate problem statement, obtaining the target problem statement, randomly sending out the target problem statement when the system sends out the questions, wherein the target problem statement is a question with common sense and has no fixed answer, and when the user inputs the answer of the target problem statement, the computer program cannot obtain the answer through calculation, so that the user can only input the answer by himself to verify, and the safety of the system can be improved.
S300 according to C i Obtaining C i Corresponding intermediate word list D i ＝{D i1 ，……，D ij ，……，D in(i) }，D ij ＝{D 1 ij ，D 2 ij ，D 3 ij }，D 1 ij Is C 1r ij Corresponding intermediate word D 2 ij Is C 2r ij Corresponding intermediate word D 3 ij Is C 3r ij Corresponding intermediate words.
Specifically, D 1 ij Meets the following conditions:
D 1 ij ＝B 3 ij 。
specifically, D 2 ij Meets the following conditions:
D 2 ij ＝B 2 ij 。
specifically, D 3 ij Meets the following conditions:
D 3 ij ＝B 1 ij 。
s400, all C i Processing is carried out, and a target problem statement list U= { U corresponding to the A is obtained 1 ，……，U x ，……，U p }，U x For the x-th target question statement corresponding to a, x= … … p, p is the number of target question statements corresponding to a, where the target question statement is for all C 1r ij 、C 2r ij And C 3r ij Performing intermediate problem sentences after the duplicate removal treatment; it is to be understood that all C i C in (C) 1r ij 、C 2r ij And C 3r ij Inserted into the U and subjected to the deduplication process, those skilled in the art know that any deduplication method in the prior art belongs to the protection scope of the present invention, and will not be described herein.
S500, all D i Processing to obtain a target word set U corresponding to the U 0 ＝{U 0 1 ，……，U 0 x ，……，U 0 p }，U 0 x ＝{U 0 x1 ，……，U 0 xy ，……，U 0 xq(x) }，U 0 xy Is U (U) x Corresponding y-th target word, y= … … q (x), q (x) being U x The corresponding target word number is D which accords with a first preset condition 1 ij ，D 2 ij ，D 3 ij 。
Specifically, the first preset condition is:
when one target problem statement is the same as the intermediate problem statement corresponding to the intermediate word in the target problem statement list, the intermediate word is obtained to be used as the target word corresponding to the target problem statement.
S600, any U x And sending the message to the target user.
S700, when receiving the feedback U of the target user x Corresponding verification information is obtained from the U x Obtaining the keyword of the target user from the corresponding verification information and combining the keyword of the target user with each U 0 xy And comparing to determine that the verification information of the user is normal information.
Specifically, the step S700 further includes the following steps:
s701, obtaining U x Keyword V of target user in corresponding verification information x One skilled in the art knows that any method for obtaining keywords from information in the prior art belongs to the protection scope of the present invention, and is not described herein.
S703, V x Inputting into a preset feature extraction model to obtain V x Corresponding first feature vector list V 0 x ＝{V 0 x1 ，……，V 0 xg ，……，V 0 xh }，V 0 xg Is V (V) x The corresponding g first feature vector, g= … … h, h is the number of first feature vectors, where those skilled in the art know that any model capable of obtaining feature vectors of words in the prior art belongs to the protection scope of the present invention, and is not described herein.
S705, U 0 x Inputting into a preset feature extraction model to obtain U 0 x A corresponding second feature vector list W x ＝{W x1 ，……，W xy ，……，W xq(x) }，W xy ＝{W 1 xy ，……，W g xy ，……，W h xy }，W g xy Is U (U) 0 xy And g second feature vector.
S707 according to V 0 x And W is x Obtaining V 0 x Corresponding similarity list E x ＝{E x1 ，……，E xy ，……，E xq(x) }，E xy Is V (V) 0 x And U 0 xy Similarity between, wherein E xy Meets the following conditions:
s709, when E x In the presence of E xy Not less than E 0 When determining that the authentication information of the user is normal information, E 0 Is a preset similarity threshold.
Specifically E 0 The value range of (2) is 0.9-1]Preferably E 0 =0.9, preventing the similarity threshold from being set or high or too low, resulting in erroneous authentication information of the determined user.
By acquiring the similarity between the keyword and the target word, whether the verification information of the user is normal information or not is determined, so that the accuracy of the determined verification information of the user is improved, and the safety of the system can be improved.
In another specific embodiment, the step S500 further includes the following steps:
s10, to U 0 Processing to obtain U 0 Corresponding specified word list g= { G 1 ，……，G e ，……，G f }，G e Is U (U) 0 Corresponding e-th designation word, e= … … f, f is U 0 Corresponding number of specified words, wherein the specified words are the number of specified words corresponding to U 0 xy The target word after the duplication elimination is understood as U 0 All U of (3) 0 xy Insert into G and perform deduplication.
S20, obtaining G from U e Corresponding U x Constructing a first specified problem statement list H= { H corresponding to G 1 ，……，H e ，……，H f }，H e ＝{ He1 ，……，H ek ，……，H et }，H ek Is G e The corresponding kth first specified question sentence, k= … … t, t is the number of the first specified question sentences, which can be understood as that the target word and G corresponding to the target question sentence are obtained from U e The same target question statement as G e A corresponding first specified question statement.
S30, according to H, obtaining a second specified problem statement list R= { R corresponding to G 1 ，……，R e ，……，R f }，R e ＝{R e1 ，……，R ea ，……，R ec }，R ea Is G e The corresponding a-th second specified question statement, a= … … c, c is the second specified question statement number.
Specifically, the step S30 includes the steps of obtaining R as follows ea ：
S31, from H e Optionally z first specified question sentences, where z is the preset number of first specified question sentences selected, and a person skilled in the art can set the number of first specified question sentences selected according to actual requirements.
S33, z are toThe first appointed question is input into a preset semantic fusion model, a first intermediate appointed question statement is obtained and is used as R e One of R ea 。
Specifically, the preset semantic fusion model is a pre-trained neural network model, wherein training samples of the model are a plurality of problem sentences, and an output result of the model is one problem sentence.
Above-mentioned, fuse a plurality of questions into a question, the degree of difficulty when having improved the user and verify to the question after the fusion still is the question that has commonality and does not have fixed answer, when the answer of user input question, the computer program can't obtain the answer of the question that has commonality through calculating, consequently, the user can only input the answer by oneself and verify, can improve the security of system.
S40, processing the R to obtain a final problem statement list corresponding to the A, wherein the method for obtaining the final problem statement list corresponding to the A is known to a person skilled in the art, and the method for obtaining the target problem statement list corresponding to the A is referred to and is not described herein.
S50, processing the H to obtain a final word set corresponding to the final problem statement list, wherein a method for obtaining the final word set corresponding to the final problem statement list is known to a person skilled in the art, and the method for obtaining the target word set corresponding to the U is referred to and is not described herein.
And S60, sending any final problem statement to the target user.
S70, when verification information corresponding to a final problem statement fed back by a target user is received, obtaining a word to be selected of the target user from the verification information corresponding to the final problem statement, comparing the word to be selected of the target user with the final word corresponding to each final problem statement list, and determining that the verification information of the user is normal information, wherein a method for determining that the verification information of the user is normal information is known to a person skilled in the art, and the method for determining that the verification information of the user is normal information in the first embodiment is not repeated.
When the system sends out the questions, the difficulty of randomly sending out the questions is increased, but the questions are questions with common sense and have no fixed answers, and when the user inputs the answers of the questions, the computer program cannot obtain the answers of the questions with common sense through calculation, so that the user can only input the answers by himself to verify, and the safety of the system can be improved.
The invention provides a data processing system for user identity verification, which comprises: the method comprises the following steps of an initial text list, a preset problem statement template list, a processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the following steps are realized: acquiring an initial triplet list; acquiring an intermediate problem statement list according to the initial triplet list and a preset problem statement template list; acquiring an intermediate word list corresponding to the intermediate problem statement list; acquiring a target problem statement list; acquiring a target word set; obtaining the keywords of the target user, comparing the keywords of the target user with each target word, and determining that the verification information of the user is normal information; it can be known that when the system sends out the questions, the questions are randomly sent out and the questions are questions with common sense and have no fixed answers, and when the user inputs the answers of the questions, the computer program can not obtain the answers of the questions with common sense through calculation, so that the user can only input the answers by himself to verify, and the safety of the system can be improved.
While certain specific embodiments of the invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the invention. Those skilled in the art will also appreciate that many modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (10)
1. A data processing system for user authentication, the system comprising: initial text list a= { a 1 ，……，A i ，……，A m Preset question statement template list, processor and computer program stored thereinA memory, wherein A i For the i-th initial text, i= … … m, m being the initial text number, when the computer program is executed by the processor the following steps are implemented:
s100, pair A i Processing to obtain A i Corresponding initial triplet list B i ＝{B i1 ，……，B ij ，……，B in(i) }，B ij ＝{B 1 ij ，B 2 ij ，B 3 ij }，B 1 ij Is A i The first initial entity, B, in the corresponding jth initial triplet 2 ij Is A i The second initial entity, B, in the corresponding jth initial triplet 3 ij Is B 1 ij And B 2 ij Initial association relation between the two, j= … … n (i), n (i) is A i The corresponding initial triplet number;
s200 according to B i And the preset problem statement template list is used for obtaining B i Corresponding intermediate question statement list C i ＝{C i1 ，……，C ij ，……，C in(i) }，C ij ＝{C 1 ij ，C 2 ij ，C 3 ij }，C 1 ij ＝{C 11 ij ，……，C 1r ij ，……，C 1s ij }，C 2 ij ＝{C 21 ij ，……，C 2r ij ，……，C 2s ij }，C 3 ij ＝{C 31 ij ，……，C 3r ij ，……，C 3s ij }，C 1r ij Is B 1 ij And B 2 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 2r ij Is B 1 ij And B 3 ij The (r) th intermediate question sentence in the corresponding intermediate question sentence list, C 3r ij Is B 2 ij And B 3 ij Corresponding intermediate question statementsThe r-th intermediate problem statement in the list, r= … … s, s is the number of intermediate problem statements in the intermediate problem statement list;
s300 according to C i Obtaining C i Corresponding intermediate word list D i ＝{D i1 ，……，D ij ，……，D in(i) }，D ij ＝{D 1 ij ，D 2 ij ，D 3 ij }，D 1 ij Is C 1r ij Corresponding intermediate word D 2 ij Is C 2r ij Corresponding intermediate word D 3 ij Is C 3r ij Corresponding intermediate words;
s400, all C i Processing is carried out, and a target problem statement list U= { U corresponding to the A is obtained 1 ，……，U x ，……，U p }，U x For the x-th target question statement corresponding to a, x= … … p, p is the number of target question statements corresponding to a, where the target question statement is for all C 1r ij 、C 2r ij And C 3r ij Performing intermediate problem sentences after the duplicate removal treatment;
s500, all D i Processing to obtain a target word set U corresponding to the U 0 ＝{U 0 1 ，……，U 0 x ，……，U 0 p }，U 0 x ＝{U 0 x1 ，……，U 0 xy ，……，U 0 xq(x) }，U 0 xy Is U (U) x Corresponding y-th target word, y= … … q (x), q (x) being U x The corresponding target word number is D which accords with a first preset condition 1 ij ，D 2 ij ，D 3 ij ；
S600, any U x Sending to a target user;
s700, when receiving the feedback U of the target user x Corresponding verification information is obtained from the U x The keyword of the target user is acquired from the corresponding verification information and is to be displayedKeyword and each U of target user 0 xy And comparing to determine that the verification information of the user is normal information.
2. A data processing system for user authentication according to claim 1, characterized in that in step S200 the steps of:
s201, acquiring a preset problem statement template list E= { E 1 ，E 2 ，E 3 }，E 1 ＝{E 11 ，……，E 1r ，……，E 1s }，E 2 ＝{E 21 ，……，E 2r ，……，E 2s }，E 3 ＝{E 31 ，……，E 3r ，……，E 3s }，E 1r E, for the r-th preset problem statement template in the preset problem statement template list corresponding to the first initial entity and the second initial entity, E 2r For the r-th preset problem statement template in the preset problem statement template list corresponding to the initial association relationship between the first initial entity and the second initial entity, E 3r The method comprises the steps of setting a r-th preset problem statement template in a preset problem statement template list corresponding to an initial association relationship between a second initial entity and a first initial entity;
s203, B 1 ij Filling E into 1r B in the slots to be filled with the keyword type of the first entity type 2 ij Filling E into 1r C is constructed in the to-be-filled slot with the keyword type of the second entity type 1r ij ；
S205, B 1 ij Filling E into 2r B in the slots to be filled with the keyword type of the first entity type 3 ij Filling E into 2r C, constructing in the to-be-filled slot with the keyword type as the initial association type 2r ij ；
S207, will B 2 ij Filling E into 3r B in the slots to be filled with the keyword type of the second entity type 3 ij Filling E into 3r The keyword type is initial association relationC is built in the type of slot to be filled 3r ij 。
3. A data processing system for user authentication according to claim 1, characterized in that in step S700 the steps of:
s701, obtaining U x Keyword V of target user in corresponding verification information x ；
S703, V x Inputting into a preset feature extraction model to obtain V x Corresponding first feature vector list V 0 x ＝{V 0 x1 ，……，V 0 xg ，……，V 0 xh }，V 0 xg Is V (V) x Corresponding g first feature vectors, g= … … h, h being the number of first feature vectors;
s705, U 0 x Inputting into a preset feature extraction model to obtain U 0 x A corresponding second feature vector list W x ＝{W x1 ，……，W xy ，……，W xq(x) }，W xy ＝{W 1 xy ，……，W g xy ，……，W h xy }，W g xy Is U (U) 0 xy A corresponding g-th second feature vector;
s707 according to V 0 x And W is x Obtaining V 0 x Corresponding similarity list E x ＝{E x1 ，……，E xy ，……，E xq(x) }，E xy Is V (V) 0 x And U 0 xy Similarity between, wherein E xy Meets the following conditions:
s709, when E x In the presence of E xy Not less than E 0 When determining that the authentication information of the user is normal information, E 0 Is a preset similarityA threshold value.
4. A data processing system for user authentication according to claim 2, wherein each of the predetermined question sentence templates comprises two slots to be filled and a number of predetermined characters.
5. The data processing system according to claim 4, wherein the keyword types of the two slots to be filled in each of the preset question sentence templates are different.
6. A data processing system for user authentication as defined in claim 5, wherein the keyword type is any one of a first entity type, a second entity type, and an initial association type.
7. A data processing system for user authentication according to claim 1, characterized in that D 1 ij Meets the following conditions:
D 1 ij ＝B 3 ij 。
8. a data processing system for user authentication according to claim 1, characterized in that D 2 ij Meets the following conditions:
D 2 ij ＝B 2 ij 。
9. a data processing system for user authentication according to claim 1, characterized in that D 3 ij Meets the following conditions:
D 3 ij ＝B 1 ij 。
10. a user authentication data processing system according to claim 1, wherein the first preset condition is: when one target problem statement is the same as the intermediate problem statement corresponding to the intermediate word in the target problem statement list, the intermediate word is obtained to be used as the target word corresponding to the target problem statement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310187162.XA CN116186658A (en) | 2023-02-22 | 2023-02-22 | User identity verification data processing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310187162.XA CN116186658A (en) | 2023-02-22 | 2023-02-22 | User identity verification data processing system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116186658A true CN116186658A (en) | 2023-05-30 |
Family
ID=86442131
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310187162.XA Pending CN116186658A (en) | 2023-02-22 | 2023-02-22 | User identity verification data processing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116186658A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117056497A (en) * | 2023-10-13 | 2023-11-14 | 北京睿企信息科技有限公司 | LLM-based question and answer method, electronic equipment and storage medium |
| CN117454990A (en) * | 2023-11-14 | 2024-01-26 | 生命奇点(北京)科技有限公司 | System for updating electronic medical record question-answer model based on feedback result |
-
2023
- 2023-02-22 CN CN202310187162.XA patent/CN116186658A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117056497A (en) * | 2023-10-13 | 2023-11-14 | 北京睿企信息科技有限公司 | LLM-based question and answer method, electronic equipment and storage medium |
| CN117056497B (en) * | 2023-10-13 | 2024-01-23 | 北京睿企信息科技有限公司 | LLM-based question and answer method, electronic equipment and storage medium |
| CN117454990A (en) * | 2023-11-14 | 2024-01-26 | 生命奇点(北京)科技有限公司 | System for updating electronic medical record question-answer model based on feedback result |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109829155B (en) | Keyword determination method, automatic scoring method, device, equipment and medium | |
| CN108920654B (en) | Question and answer text semantic matching method and device | |
| CN109446302B (en) | Question-answer data processing method and device based on machine learning and computer equipment | |
| CN116186658A (en) | User identity verification data processing system | |
| CN111814466A (en) | Information extraction method based on machine reading understanding and related equipment thereof | |
| TW201917601A (en) | User intention recognition method and device capable of recognizing user intention by acquiring dialogue text from a user | |
| CN110825857B (en) | Multi-round question and answer identification method and device, computer equipment and storage medium | |
| CN111159363A (en) | Knowledge base-based question answer determination method and device | |
| CN112380240A (en) | Data query method, device and equipment based on semantic recognition and storage medium | |
| CN111178064A (en) | Information pushing method and device based on field word segmentation processing and computer equipment | |
| CN112100374A (en) | Text clustering method and device, electronic equipment and storage medium | |
| CN112632261A (en) | Intelligent question and answer method, device, equipment and storage medium | |
| CN110502620B (en) | Method, system and computer equipment for generating guide diagnosis similar problem pairs | |
| CN112397197A (en) | Artificial intelligence-based inquiry data processing method and device | |
| CN112560545A (en) | Method and device for identifying form direction and electronic equipment | |
| CN113177405A (en) | Method, device and equipment for correcting data errors based on BERT and storage medium | |
| CN111552810B (en) | Entity extraction and classification method, entity extraction and classification device, computer equipment and storage medium | |
| CN117454990A (en) | System for updating electronic medical record question-answer model based on feedback result | |
| CN112559526A (en) | Data table export method and device, computer equipment and storage medium | |
| CN116955590A (en) | Training data screening method, model training method and text generation method | |
| CN116737800A (en) | Big data mining method and system applied to supply chain platform service | |
| CN113268563B (en) | Semantic recall method, device, equipment and medium based on graph neural network | |
| CN115859128A (en) | Analysis method and system based on file data interaction similarity | |
| CN116186223A (en) | Financial text processing method, device, equipment and storage medium | |
| CN113901821A (en) | Entity naming identification method, device, equipment and storage medium |
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 |