CN109656961B - Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment - Google Patents

Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment Download PDF

Info

Publication number
CN109656961B
CN109656961B CN201811406209.2A CN201811406209A CN109656961B CN 109656961 B CN109656961 B CN 109656961B CN 201811406209 A CN201811406209 A CN 201811406209A CN 109656961 B CN109656961 B CN 109656961B
Authority
CN
China
Prior art keywords
user
person
relationship
name
strength value
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
CN201811406209.2A
Other languages
Chinese (zh)
Other versions
CN109656961A (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.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen 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 Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Priority to CN201811406209.2A priority Critical patent/CN109656961B/en
Publication of CN109656961A publication Critical patent/CN109656961A/en
Application granted granted Critical
Publication of CN109656961B publication Critical patent/CN109656961B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application relates to the field of big data, and discloses a homonymous task searching method and device based on data analysis, a medium and electronic equipment. The method comprises the following steps: identifying a person having a target person name from the queried system in response to receiving the target person name entered by the user; acquiring the relationship characteristics of each identified person with the target person name and the user; determining a relationship strength value of each person with the target person name and the user according to the identified relationship characteristics of each person with the target person name and the user; and determining the person displayed to the user from the persons with the target person names based on the relationship strength value of each person with the target person names and the user. The embodiment of the disclosure improves the query efficiency of the same-name contacts of each scene in work.

Description

Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment
Technical Field
The disclosure relates to the field of big data, in particular to a method, a device, a medium and electronic equipment for searching homonymous tasks based on data analysis.
Background
In a mail system/personnel system in the prior art, when contacts are searched through personnel names, the situation that more contacts with the same name are frequently searched, and when the situation that more contacts with the same name are searched, contact screening is needed manually, so that the screening cost is increased, and the problem that accurate selection cannot be performed due to the fact that information is lost is solved.
Disclosure of Invention
The application aims to improve the query efficiency of the same-name characters and reduce the screening cost.
According to a first aspect of the application, a homonymous task search method based on data analysis is disclosed, comprising:
identifying a person having a target person name from the queried system in response to receiving the target person name entered by the user;
acquiring the relationship characteristics of each identified person with the target person name and the user;
determining a relationship strength value of each person with the target person name and the user according to the identified relationship characteristics of each person with the target person name and the user;
and determining the person displayed to the user from the persons with the target person names based on the relationship strength value of each person with the target person names and the user.
According to an example embodiment of the present application, obtaining the relationship feature of each of the identified persons having the target person name with the user includes:
the relationship features of each person having the target person name with the user include: the relationship features of the relationship strength of the target person can be demonstrated by the upper-lower relationship, the project cooperation relationship, the friend relationship and the like.
According to an exemplary embodiment of the present application, the acquiring the relationship feature of each of the identified persons having the target person name and the user includes:
acquiring the upper and lower relationship between each person with the target person name and the user from a personnel registry;
acquiring the project cooperation relationship between each character with the target character name and the user from the cooperation project file of the user;
and acquiring the friend relationship between each person with the target person name and the user from the application chat record of the user.
According to an example embodiment of the present application, determining a relationship strength value of each person having the target person name to a user from the identified relationship features of each person having the target person name to the user includes:
determining a first relationship strength value according to the acquired upper and lower relationship;
determining a second relationship strength value according to the acquired project cooperation level relationship;
determining a third relationship strength value according to the acquired friend relationship;
and determining the relationship strength value of each person with the target person name and the user according to the determined first relationship strength value, second relationship strength value and third relationship strength value.
According to an exemplary embodiment of the present application, determining a person displayed to a user from among persons each having the target person name based on a relationship strength value of each person having the target person name to the user, includes:
and determining the person with the highest relation strength value among the persons with the target person names as the person displayed to the user.
According to an exemplary embodiment of the present application, determining a person displayed to a user from among persons each having the target person name based on a relationship strength value of each person having the target person name to the user, includes:
and determining the person with the relationship strength value exceeding a preset relationship strength threshold value from the persons with the target person names as the person displayed to the user.
According to an exemplary embodiment of the present application, the determining a person whose relationship strength value exceeds a predetermined relationship strength threshold value among the persons each having the target person name as a person displayed to the user includes:
and if a plurality of persons with the relationship strength value exceeding the preset relationship strength threshold value exist in the persons with the target person names, displaying the persons with the relationship strength value exceeding the preset relationship strength threshold value in a sequence from high to low.
According to an exemplary embodiment of the present application, determining a person displayed to a user from among persons each having the target person name based on a relationship strength value of each person having the target person name to the user, includes:
when the person displayed to the user is not the target person to be found, the same name person showing the relationship strength value higher than the predetermined threshold value in a high-to-low manner is selected for the user.
According to another aspect of the present application, there is disclosed a homonym character search device based on data analysis, including:
an identification module for identifying a person having a target person name from the queried system in response to receiving the target person name input by a user;
the acquisition module acquires the relationship characteristics of each identified person with the target person name and the user;
the numerical value confirmation module is used for determining the relationship strength value of each person with the target person name and the user according to the relationship characteristics of each person with the target person name and the user;
and a target confirmation module for determining the person displayed to the user from the persons with the target person names based on the relationship strength value of each person with the target person names and the user.
According to another aspect of the application there is provided a computer readable program medium storing computer program instructions which, when executed by a computer, cause the computer to perform the method as described above.
According to another aspect of the application, an electronic device is disclosed, comprising:
a memory storing computer instructions;
a processor reads the computer readable instructions stored in the memory to perform the methods of the embodiments of the present disclosure.
Compared with the prior art, the queried system needs to be manually screened after searching the contact person by name, and the accuracy of query can be affected due to the lack of information. The method and the system acquire all the prestored characters with the names of the target characters and the relation characteristics through inquiring the inquired system, determine the relation strength according to the relation of the characters through the prestored relation characteristics, increase the accuracy of the determined target characters which are the target characters to be searched, and reduce the problem that the inquired system cannot judge the target characters due to information deletion because each person is prestored in the inquired system when joining the group, company or organization.
Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure.
FIG. 1 is a schematic illustration of an environment for a homonymous task search method application based on data analysis, shown in accordance with an exemplary embodiment;
FIG. 2 is a flowchart illustrating a method of homonymous task search based on data analysis, according to an example embodiment;
FIG. 3 is a block diagram illustrating a method apparatus for homonymous task search based on data analysis, in accordance with an illustrative embodiment;
FIG. 4 is an exemplary block diagram of an electronic device for implementing the above-described data analysis-based homonymous task search method, according to an illustrative embodiment;
fig. 5 is a computer readable storage medium for implementing the above-described homonymous task search method based on data analysis, according to an example embodiment.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as detailed in the accompanying claims.
Furthermore, the drawings are merely schematic illustrations of the present application and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities.
The application firstly provides a homonymous task searching method based on data analysis. The method of the present disclosure may exist in various terminals, such as servers, cloud computing physical infrastructure, smartphones, tablet computers, desktop computers, notebook computers, ipads, self-service terminals, and any device or collection of devices having computing control functions and communication functions.
FIG. 1 is an environmental schematic diagram illustrating an application of a homonymous task search method based on data analysis, according to an example embodiment. As shown in fig. 1. The server may communicate with each of the implementing terminals of the present disclosure over a communication link or receive instructions from the implementing terminals of the present disclosure and execute. The communication link connection mode can be as follows: a wired communication network connection and a wireless communication network connection. The connection mode of the wired communication network can be twisted pair, coaxial cable, optical fiber and the like; the connection mode of the wireless communication network can be microwave, cellular network, etc.
FIG. 2 illustrates a flow chart of a method of homonymous task search based on data analysis in accordance with an example embodiment of the present disclosure.
In step S100, in response to receiving a target person name input by a user, a person having the target person name is identified from the queried system.
In one embodiment, before identifying the person having the target person name from the queried system, the queried system may store the relationship characteristics of each target person in a manner that the queried system receives a post-described personnel registry, a collaborative project file, etc. entered or scanned by a unit staff, and stores the received personal data containing the relationship characteristics in a memory of the queried system.
In step S110, the relationship features of the identified persons each having the target person name and the user are acquired.
In one embodiment, the relationship feature of the person having the target person name to the user includes: upper and lower relationships, project cooperation relationships, friendship relationships.
In one embodiment, obtaining the identified relationship features of each person having the target person name to the user includes:
acquiring the upper and lower relationship between each person with the target person name and the user from a personnel registry;
in one embodiment, the personnel registry is a personnel registry that is pre-filled in memory of the queried system when the person joins the group or company.
Acquiring the relationship between each character with the target character name and the user from the cooperation project file of the user;
in one embodiment, the user's collaboration project file is a file that reads the person name information in the collaboration project file and identifies whether there is a collaboration relationship.
And acquiring the friend relationship between each person with the target person name and the user from the application chat record of the user.
In one embodiment, the user's application chat record is a chat record of chat software of the user with each character having the target character name, and it is determined whether the user is in a friend relationship with each character having the target character name according to whether the chat record exists.
In one embodiment, whether the user is in a friend relationship with each person having the target person name further comprises: and judging whether the user and each character with the target character name are in a friend relationship or not according to the content of the chat record.
In step S130, a relationship strength value of each person having the target person name to the user is determined based on the identified relationship characteristics of each person having the target person name to the user.
Determining a first relationship strength value according to the acquired upper and lower relationship;
in one embodiment, a first relationship strength value is determined from the acquired superior-inferior relationship;
for example: the relationship strength of the upper and lower relationship between each character having the target character name and the relationship feature of the user is divided into 0-5 points, the higher the obtained score is, the stronger the relationship strength is, and the obtained score is taken as a first relationship strength value.
Determining a second relationship strength value according to the acquired project cooperation level relationship;
for example: dividing the relationship strength of the project cooperation level relationship of each character with the target character name and the relationship characteristic of the user into 0-5 points, wherein the higher the obtained score is, the stronger the relationship strength is, and taking the obtained score as a second relationship strength value.
And determining a third relationship strength value according to the acquired friend relationship.
For example: dividing the relationship strength of the friend relationship between each character with the target character name and the relationship characteristic of the user into 0-5 points, wherein the higher the obtained score is, the stronger the relationship strength is, and taking the obtained score as a third relationship strength value.
And determining the relationship strength value of each person with the target person name and the user according to the determined first relationship strength value, second relationship strength value and third relationship strength value.
The method is simple and easy to implement, removes complicated machine calculation and improves the searching speed.
In one embodiment, determining the relationship strength value of each person having the target person name and the user according to the determined first relationship strength value, second relationship strength value, and third relationship strength value specifically includes:
and adding the determined characters with the target character names with the first relationship intensity value, the second relationship intensity value and the third relationship intensity value of the user to obtain a sum, and determining the target character corresponding to the obtained sum maximum value as the character displayed to the user.
In one embodiment, determining the relationship strength value of each person having the target person name and the user according to the determined first relationship strength value, second relationship strength value, and third relationship strength value specifically includes:
and carrying out weighted calculation on each determined person with the target person name and the first relationship intensity value, the second relationship intensity value and the third relationship intensity value of the user to obtain a weighted calculation value, and determining the target person corresponding to the value with the largest obtained weighted calculation value as the person displayed to the user.
For example: there are two persons a and B having the target person names, the first relationship intensity value of the person a and the user is 5, the second relationship intensity value is 4, the third relationship intensity value is 4, the first relationship intensity value of the person B and the user is 5, the second relationship intensity value is 5, the third relationship intensity value is 4, and the weighted ratio of the first relationship intensity value, the second relationship intensity value, and the third relationship intensity value is 5:3:2, then: the relationship strength between the person a and the user is m1=0.5x5+0.3x4+0.2x4=4.5, and similarly, the relationship strength between the person a and the user is m2=4.8. The person B having a high relationship strength is determined as the person displayed to the user.
The advantage of selecting a person with a high relationship strength as the person displayed to the user is that the higher the relationship strength the greater the association with the user of the person's representation, the greater the likelihood that the person is the target person to be found by the user, so the person with a high relationship strength is selected as the target person to be found by the user.
In another embodiment, determining a person to be displayed to the user from among the persons each having the target person name based on the relationship strength value of each person having the target person name to the user, includes:
and determining the person with the relationship strength value exceeding a preset relationship strength threshold value from the persons with the target person names as the person displayed to the user.
In another embodiment, the determining the person whose relationship strength value exceeds a predetermined relationship strength threshold value among the persons each having the target person name as the person displayed to the user includes:
and if a plurality of persons with the relationship strength value exceeding the preset relationship strength threshold value exist in the persons with the target person names, displaying the persons with the relationship strength value exceeding the preset relationship strength threshold value in a sequence from high to low.
In another embodiment, determining a person to be displayed to the user from among the persons each having the target person name based on the relationship strength value of each person having the target person name to the user, includes:
when the person displayed to the user is not the target person to be found, the same name person showing the relationship strength value higher than the predetermined threshold value in a high-to-low manner is selected for the user.
The advantage of selecting the person with the name of the target person, wherein the relationship strength value of the person exceeds the predetermined relationship strength threshold value, is that the person with the highest relationship strength value is not necessarily the target person to be searched by the user, so that a plurality of person selections are provided for the user, the fault tolerance rate of searching is improved, the time for searching again when the provided single person is not the target person to be searched by the user is saved, and the searching efficiency is improved.
It will be appreciated that the technical solution of the present disclosure and the order of steps of the embodiments shown for illustrating the solution are not fixed, and are not limited to those described above, and the order of execution of the steps may be interchanged, or even a plurality of steps may be executed at the same time.
The application also provides a device for searching the same name characters, and the following is an embodiment of the device of the present disclosure.
Fig. 3 is a block diagram illustrating a homonymous persona search device, according to an example embodiment. As shown in fig. 3, the homonymous person search device S300 includes:
an acquisition module S310 configured to identify a person having a target person name from the queried system in response to receiving the target person name input by the user
The receiving module S320 is configured to obtain the relationship feature of each of the identified persons having the target person name and the user.
The numerical value confirmation module S330 determines a relationship strength value of each person having the target person name and the user according to the identified relationship feature of each person having the target person name and the user.
The target confirmation module S340 is configured to determine a person to be displayed to the user from among the persons each having the target person name based on the relationship strength value of each person having the target person name to the user.
According to a third aspect of the present disclosure, there is also provided an electronic device capable of implementing the above-mentioned homonymous task search method based on data analysis.
Those skilled in the art will appreciate that the various aspects of the present disclosure may be implemented as a system, method, or program product. Accordingly, various aspects of the disclosure may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.
An electronic device 400 according to such an embodiment of the present disclosure is described below with reference to fig. 4. The electronic device 400 shown in fig. 4 is merely an example and should not be construed as limiting the functionality and scope of use of the disclosed embodiments.
As shown in fig. 4, the electronic device 400 is embodied in the form of a general purpose computing device. The components of electronic device 400 may include, but are not limited to: the at least one processing unit 410, the at least one memory unit 420, and a bus 430 connecting the various system components, including the memory unit 420 and the processing unit 410.
Wherein the storage unit stores program code that is executable by the processing unit 410 such that the processing unit 410 performs steps according to various exemplary embodiments of the present disclosure described in the above-described "example methods" section of the present specification.
The storage unit 420 may include readable media in the form of volatile storage units, such as Random Access Memory (RAM) 421 and/or cache memory 422, and may further include Read Only Memory (ROM) 423.
The storage unit 420 may also include a program/utility 424 having a set (at least one) of program modules 425, such program modules 425 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 430 may be a local bus representing one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or using any of a variety of bus architectures.
The electronic device 400 may also communicate with one or more external devices 600 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 400, and/or any device (e.g., router, modem, etc.) that enables the electronic device 400 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 450. Also, electronic device 400 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 460. As shown, the network adapter 460 communicates with other modules of the electronic device 400 over the bus 430. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 400, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a usb disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
According to a fourth aspect of the present application, there is also provided a computer readable storage medium having stored thereon a program product capable of implementing the method described above in the present specification. In some possible implementations, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the disclosure as described in the "exemplary methods" section of this specification, when the program product is run on the terminal device.
Referring to fig. 5, a program product 500 for implementing the above-described method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
Furthermore, the above-described figures are only schematic illustrations of processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities already described above and shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (8)

1. The method for searching the homonymous task based on the data analysis is characterized by comprising the following steps of:
identifying a person having a target person name from the queried system in response to receiving the target person name entered by the user;
acquiring the upper and lower relationship between each person with the target person name and the user from a personnel registry;
acquiring the relationship between each character with the target character name and the user from the cooperation project file of the user;
acquiring the friend relationship between each character with the target character name and the user from the application chat record of the user;
determining a first relationship strength value according to the acquired upper and lower relationship;
determining a second relationship strength value according to the acquired project cooperation level relationship;
determining a third relationship strength value according to the acquired friend relationship;
carrying out weighted operation on the determined first relationship strength value, second relationship strength value and third relationship strength value to obtain a weighted calculation value, and taking the weighted calculation value as the relationship strength value of each person with the target person name and the user;
based on the relationship strength value of each person having the target person name and the user, a part of the persons are selected from the persons each having the target person name as the persons displayed to the user.
2. The method of claim 1, wherein selecting a portion of the persons from the persons each having the target person name as the person to be displayed to the user based on the relationship strength value of each person having the target person name to the user, comprises:
and determining the person with the highest relation strength value among the persons with the target person names as the person displayed to the user.
3. The method of claim 1, wherein selecting a portion of the persons from the persons each having the target person name as the person to be displayed to the user based on the relationship strength value of each person having the target person name to the user, comprises:
and determining the person with the relationship strength value exceeding a preset relationship strength threshold value from the persons with the target person names as the person displayed to the user.
4. The method of claim 3, wherein the determining a person whose relationship strength value exceeds a predetermined relationship strength threshold among the persons each having the target person name as the person displayed to the user comprises:
and if a plurality of persons with the relationship strength value exceeding the preset relationship strength threshold value exist in the persons with the target person names, displaying the persons with the relationship strength value exceeding the preset relationship strength threshold value in a sequence from high to low.
5. The method of claim 1, wherein selecting a portion of the persons from the persons each having the target person name as the person to be displayed to the user based on the relationship strength value of each person having the target person name to the user, comprises:
when the person displayed to the user is not the target person to be found, the same name person showing the relationship strength value higher than the predetermined threshold value in a high-to-low manner is selected for the user.
6. A homonymous persona search device based on data analysis, the device comprising:
an identification unit that identifies a person having a target person name from a queried system in response to receiving the target person name input by a user;
an acquisition unit that acquires, from a personal registration table, a superior-inferior relationship between each person having the target person name and a user; acquiring the relationship between each character with the target character name and the user from the cooperation project file of the user; acquiring the friend relationship between each character with the target character name and the user from the application chat record of the user;
the numerical value confirming unit is used for confirming a first relation strength value according to the acquired upper-lower relation; determining a second relationship strength value according to the acquired project cooperation level relationship; determining a third relationship strength value according to the acquired friend relationship; carrying out weighted operation on the determined first relationship strength value, second relationship strength value and third relationship strength value to obtain a weighted calculation value, and taking the weighted calculation value as the relationship strength value of each person with the target person name and the user;
and a target confirmation unit that selects a part of persons from the persons each having the target person name as the persons displayed to the user based on the relationship strength value of each person having the target person name with the user.
7. An electronic device, comprising:
a memory storing computer instructions;
a processor reading computer readable instructions stored in a memory to perform the method of any one of claims 1-5.
8. A computer program medium having stored thereon computer readable instructions which, when executed by a processor of a computer, cause the computer to perform the method of any of claims 1-5.
CN201811406209.2A 2018-11-23 2018-11-23 Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment Active CN109656961B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811406209.2A CN109656961B (en) 2018-11-23 2018-11-23 Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811406209.2A CN109656961B (en) 2018-11-23 2018-11-23 Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment

Publications (2)

Publication Number Publication Date
CN109656961A CN109656961A (en) 2019-04-19
CN109656961B true CN109656961B (en) 2023-09-29

Family

ID=66111523

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811406209.2A Active CN109656961B (en) 2018-11-23 2018-11-23 Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN109656961B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880623A (en) * 2011-07-13 2013-01-16 富士通株式会社 Method and device for searching people with same name
CN103067576A (en) * 2012-12-21 2013-04-24 东莞宇龙通信科技有限公司 Information display method and information display device
CN105721654A (en) * 2016-02-26 2016-06-29 宁波萨瑞通讯有限公司 Method for sorting stroke sequences of contacts and mobile equipment
WO2016176274A1 (en) * 2015-04-29 2016-11-03 Ebay Inc. Enhancing search queries using user implicit data

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8645417B2 (en) * 2008-06-18 2014-02-04 Microsoft Corporation Name search using a ranking function
US8977979B2 (en) * 2010-12-06 2015-03-10 International Business Machines Corporation Social network relationship mapping
US20130110827A1 (en) * 2011-10-26 2013-05-02 Microsoft Corporation Relevance of name and other search queries with social network feature

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102880623A (en) * 2011-07-13 2013-01-16 富士通株式会社 Method and device for searching people with same name
CN103067576A (en) * 2012-12-21 2013-04-24 东莞宇龙通信科技有限公司 Information display method and information display device
WO2016176274A1 (en) * 2015-04-29 2016-11-03 Ebay Inc. Enhancing search queries using user implicit data
CN105721654A (en) * 2016-02-26 2016-06-29 宁波萨瑞通讯有限公司 Method for sorting stroke sequences of contacts and mobile equipment

Also Published As

Publication number Publication date
CN109656961A (en) 2019-04-19

Similar Documents

Publication Publication Date Title
CN110211121B (en) Method and device for pushing model
CN110135590B (en) Information processing method, information processing apparatus, information processing medium, and electronic device
CN113704063B (en) Performance monitoring method, device, equipment and storage medium of cloud mobile phone
CN113821433A (en) Method, device, equipment, medium and product for testing cloud mobile phone application program
CN109597482B (en) Automatic page turning method and device for electronic book, medium and electronic equipment
CN113704058B (en) Service model monitoring method and device and electronic equipment
CN113626441A (en) Text management method, device and equipment based on scanning equipment and storage medium
CN113595886A (en) Instant messaging message processing method and device, electronic equipment and storage medium
CN110224921B (en) Method, device, medium and electronic equipment for sending mail containing recruitment information
CN111881381A (en) Display method, device, equipment and storage medium
CN109656961B (en) Method and device for searching homonymous tasks based on data analysis, medium and electronic equipment
CN113626301B (en) Method and device for generating test script
CN114880422A (en) Interest point information processing method based on robot process automation and related device
CN111338642B (en) Method, device, terminal and storage medium for determining application download path
CN112165549A (en) Short message processing method, device, equipment and medium applied to intelligent terminal
CN111767447A (en) Method and device for determining user traffic path
CN113836291B (en) Data processing method, device, equipment and storage medium
CN113343090B (en) Method, apparatus, device, medium and product for pushing information
CN113010812B (en) Information acquisition method, device, electronic equipment and storage medium
CN108536362B (en) Method and device for identifying operation and server
CN116993365A (en) Identification method, device, equipment and storage medium of cheating equipment
CN114401337A (en) Data sharing method, device and equipment based on cloud mobile phone and storage medium
CN115129730A (en) Flow data identification method and device, storage medium and computer equipment
CN113918779A (en) Terminal device application data acquisition and analysis method and device
CN116319716A (en) Information processing method, no-service system, electronic device, 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
GR01 Patent grant
GR01 Patent grant