CN108229722A - A kind of method and computer equipment in determining relation chain path - Google Patents
A kind of method and computer equipment in determining relation chain path Download PDFInfo
- Publication number
- CN108229722A CN108229722A CN201711274397.3A CN201711274397A CN108229722A CN 108229722 A CN108229722 A CN 108229722A CN 201711274397 A CN201711274397 A CN 201711274397A CN 108229722 A CN108229722 A CN 108229722A
- Authority
- CN
- China
- Prior art keywords
- relation chain
- source terminal
- terminal
- chain path
- information
- 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
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000005540 biological transmission Effects 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 3
- 230000000694 effects Effects 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a kind of method and computer equipment in determining relation chain path, this method includes:The inquiry request that source terminal is sent is received, target property information is carried in request message;According to target property information, multilevel relation chain associated with source terminal is built, until the target terminal exactly matched with target property information;According to source terminal, multilevel relation chain and target terminal, determine at least one relation chain path and fed back to source terminal.The present invention passes through target property information, build multilevel relation chain associated with source terminal, until the target terminal exactly matched with target property information, and according to source terminal, multilevel relation chain and target terminal, it is fed back after determining at least one relation chain path to source terminal, the safety of privacy information can be ensured while time cost is reduced, avoids receiving harassing and wrecking information, promotes contact success rate and user experience.
Description
Technical field
Method and computer the present invention relates to data analysis technique field more particularly to a kind of determining relation chain path are set
It is standby.
Background technology
In actual life, if it is desired to reaching a strange place, by a map, trying to locate by following up a clue will soon determine
Multiple paths arrive at;If looking for some stranger however, to arrive, but without " map " tool in this way, how to look for, have
Several paths, it is as a result unknown.
Although the guess for six degrees of separation theory that there are one art of mathematics to be pointed out:You are spaced between any one stranger
People do not exceed six, that is to say, that at most by six people, you can just recognize any one stranger.That is:
Between any two people not acquainted with each other, by certain contact method, positive connection or relationship can be generated.
Social networks chain refers to interpersonal point-to-point relationship, and it is one in social groups that everyone, which can regard,
Node, and the line between 2 points becomes a relation chain.The relation chain that acquaintance network is formed can be referred to as strong
Relation chain, and weak relation chain or micro- relation chain can be referred to as based on the relation chain that the formation such as hobby, interest are got up for some.But
It is the contact that six degrees of separation theory is spoken of, is not related to the power of relation chain, and in actual life, even if passes through weak contact chain
Find target person, it is also difficult to substantive contact occur, expend time and manpower, poor user experience.
Invention content
The technical problems to be solved by the invention are in view of the deficiencies of the prior art, to provide a kind of determining relation chain path
Method and computer equipment.
The technical solution that the present invention solves above-mentioned technical problem is as follows:A kind of method in determining relation chain path, including with
Lower step:
Step 1:The inquiry request that source terminal is sent is received, target property information is carried in the request message;
Step 2:According to the target property information, multilevel relation chain associated with the source terminal is built, until with
The target terminal that the target property information exactly matches, wherein, in the multilevel relation chain, display is direct with the source terminal
The attribute information of all information of associated first order relation chain and remaining grade of relation chain, all information include privacy information
And attribute information;
Step 3:According to the source terminal, the multilevel relation chain and the target terminal, at least one relation chain is determined
It is simultaneously fed back to the source terminal in path.
The beneficial effects of the invention are as follows:By the target property information in the inquiry request that is sent according to source terminal, build
Multilevel relation chain associated with source terminal, until the target terminal that is exactly matched with target property information, and according to source terminal,
Multilevel relation chain and target terminal are fed back after determining at least one relation chain path to source terminal, can reduce time cost
While ensure the safety of privacy information, avoid receiving harassing and wrecking information, promote contact success rate and user experience.
Based on the above technical solution, the present invention can also be improved as follows.
Further, before step 2, the method further includes:
Step 4:The concern request that source terminal is sent is received, and institute is sent to first terminal associated with the source terminal
It states to pay close attention to and ask, the concern request is for request and the first terminal opening relationships chain and marks relationship strength index;
Step 5:After the first feedback information of agreement opening relationships chain for receiving second terminal transmission, by described second eventually
The relationship strength index at end is labeled as first threshold, by the relationship of the terminal in the first terminal in addition to the second terminal
Intensity index is labeled as second threshold, wherein, first threshold is different from second threshold;
Then in step 2, in the multilevel relation chain, the relationship strength index of every grade of relation chain is shown;
Then step 3 is specially:It is whole according to the source terminal, the relationship strength index of every grade of relation chain and the target
End determines at least one relational link radially source terminal feedback, wherein, the relationship strength of every grade of relation chain refers to
Number is the first threshold.
Advantageous effect using above-mentioned further scheme is:By searching qualified object in strong relational network,
And cook up at least one relation chain path with strong and weak index automatically, so as to reduce the time into, reduce manpower consumption,
Promote contact efficiency.
Further, the relation chain path is a plurality of, and before source terminal feedback, the method further includes:
Step 6:Calculate the sum of the relationship strength index of relation chain in every relation chain path;
Then, it is specially step 7 to source terminal feedback:Referred to according to the corresponding relationship strength in a plurality of relation chain path
The sum of number sends relation chain routing information to the source terminal.
Further, step 7 is specially:It is sent to the source terminal, relationship strength refers in a plurality of relation chain path
The maximum relation chain path of the sum of number.
Advantageous effect using above-mentioned further scheme is:Relationship strength index is higher, between the node for illustrating relation chain
Contact it is closer, therefore, the relation chain path of the sum of relationship strength index maximum is sent to source terminal, can further be dropped
Low time and manpower consumption, raising efficiency and user experience.
Further, step 7 specifically includes:
Step 7.1:By the sum of corresponding relationship strength index in a plurality of relation chain path, according to sequence from big to small
Arrangement obtains relation chain path and recommends class table;
Step 7.2:Class table is recommended according to the relation chain path, relation chain routing information is sent to the source terminal.
Further, step 7.2 is specially:The relation chain path is sent to the source terminal and recommends class table, with toilet
It states the corresponding user of source terminal and recommends selection target relation chain path in class table from the relation chain path.
Advantageous effect using above-mentioned further scheme is:By by the corresponding relationship strength index in a plurality of relation chain path
The sum of, class table is recommended to be sent to source terminal according to the relation chain path being ranked sequentially from big to small, so as to source terminal pair
The user answered recommends selection target relation chain path in class table from relation chain path, so as to facilitate reality of the user according to oneself
Border situation flexibly selects, and avoids because blindly recommending the time and the manpower consumption that bring.
Further, the method further includes:
Step 8:The second feedback information that the source terminal is sent is received, second feedback information, which is used to indicate, passes through institute
It states relationship by objective (RBO) chain path and has contacted success;
Step 9:By the relationship strength index of all relation chains in the relationship by objective (RBO) chain path, in the first threshold
On the basis of increase N, the value of N is more than 0.
Advantageous effect using above-mentioned further scheme is:When the instruction for receiving source terminal transmission passes through relationship by objective (RBO) chain
After path has contacted successful second feedback information, the relationship strength index of strong relation chain is updated, so as to in strong relational network
Relation chain optimize, and the information in the relationship by objective (RBO) chain path can be preserved, when searching again, can directly recommend,
Without matching again, the time is saved.
Further, step 7.2 specifically includes:
Step 7.2.1:The source is sent to by most preceding relation chain path is come in relation chain path recommendation class table
Terminal;
Step 7.2.2:After receiving the source terminal and sending the third feedback information for contacting failure, according to the relationship
The sequence in class table is recommended in chain path, sends the relational link in the relation chain path recommendation class table to the source terminal successively
Diameter, alternatively, performing step 1.
Further, the privacy information includes:Name and contact method, the attribute information include:Hobby, the age,
Industry, unit, occupation and/or the post information being engaged in.
The another technical solution that the present invention solves above-mentioned technical problem is as follows:A kind of computer equipment, including:Storage
Device, processor and the computer program run on the memory and on the processor is stored in, wherein,
The processor realizes the method described in any of the above-described embodiment when performing described program.
The advantages of additional aspect of the invention, will be set forth in part in the description, and will partly become from the following description
It obtains significantly or is recognized by present invention practice.
Description of the drawings
It in order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to the embodiment of the present invention or the prior art
Attached drawing is briefly described needed in description, it should be apparent that, drawings described below is only the present invention's
Some embodiments, for those of ordinary skill in the art, without creative efforts, can also be according to this
A little attached drawings obtain other attached drawings.
Fig. 1 is a kind of schematic flow chart of the method in determining relation chain path provided in an embodiment of the present invention;
Fig. 2 is the schematic flow chart of a kind of method in determining relation chain path that another embodiment of the present invention provides;
Fig. 3 is the schematic flow chart of a kind of method in determining relation chain path that another embodiment of the present invention provides;
Fig. 4 is the schematic flow chart of a kind of method in determining relation chain path that another embodiment of the present invention provides;
Fig. 5 is the schematic flow chart of a kind of method in determining relation chain path that another embodiment of the present invention provides;
Fig. 6 is the relation chain path schematic diagram in a kind of method in determining relation chain path provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is the part of the embodiment rather than whole embodiments of the present invention.Based on this hair
Embodiment in bright, the every other reality that those of ordinary skill in the art are obtained under the premise of creative work is not made
Example is applied, should all belong to the scope of protection of the invention.
As shown in Figure 1, a kind of method 100 in determining relation chain path includes the following steps:
110:The inquiry request that source terminal is sent is received, target property information is carried in request message.
120:According to target property information, multilevel relation chain associated with source terminal is built, until believing with objective attribute target attribute
Cease the target terminal exactly matched.
Wherein, display and all information and remaining grade of the first order relation chain of source terminal direct correlation in multilevel relation chain
The attribute information of relation chain, all information include privacy information and attribute information.
130:According to source terminal, multilevel relation chain and target terminal, at least one relation chain path is determined and to source terminal
Feedback.
Specifically, in this embodiment, privacy information can include:Name and contact method.Wherein, contact method can be with
Including:Telephone number, Email, wechat, QQ and/or MSN.Attribute information can include:Hobby, age, the row being engaged in
Industry, unit, occupation and/or post information.It should be understood that being merely illustrative here, the embodiment of the present invention is not limited to and this.
A kind of method in determining relation chain path that above-described embodiment provides, passes through the inquiry request sent according to source terminal
In target property information, multilevel relation chain associated with source terminal is built, until being exactly matched with target property information
Target terminal, and according to source terminal, multilevel relation chain and target terminal determines anti-to source terminal behind at least one relation chain path
Feedback, and display and all information and remaining grade of relation chain of the first order relation chain of source terminal direct correlation in multilevel relation chain
Attribute information, all information include privacy information and attribute information, it is hidden so as to ensure while time cost is reduced
The safety of personal letter breath avoids receiving harassing and wrecking information, promotes contact success rate and user experience.
It should be understood that in this embodiment, the executive agent of method 100 can be server, it can be by being mounted on source end
APP on end realizes the communication interaction with server.In addition, target terminal can be one could also say that it is multiple, it is clear that one
During a target terminal, determining relation chain path can also have a plurality of.Wherein, source terminal and target terminal may each comprise but not
It is only limitted to mobile terminal, intelligent terminal, IPD, tablet computer and PC machine.
Optionally, as one embodiment of the present of invention, as shown in Fig. 2, before step 110, method 100 can also wrap
It includes:
140:The concern request that source terminal is sent is received, and concern request is sent to first terminal associated with terminal,
Concern request is for request and first terminal opening relationships chain and marks relationship strength index.
150:After the first feedback information of agreement opening relationships chain for receiving second terminal transmission, by the pass of second terminal
It is that intensity index is labeled as first threshold, the relationship strength index of the terminal in first terminal in addition to second terminal is labeled as
Second threshold, wherein, first threshold is different from second threshold.
The relationship strength index of every grade of relation chain is then shown in the multilevel relation chain in step 120.
Then step 130 is specially:According to source terminal, the relationship strength index and target terminal of every grade of relation chain, determine to
A few relation chain path is simultaneously fed back to source terminal, wherein, the relationship strength index of every grade of relation chain is first threshold.
Specifically, in this embodiment it is possible to APP by being mounted in terminal, completes note in system (server)
Volume operation, such as:The information such as user's input handset number, name, occupation, unit, age, hobby, it is unique to obtain using cell-phone number
The account of mark.It is then possible to import in former cell phone address book to system, improve and fill in member property information, such as occupation, it is single
Position, age, hobby etc., each member is obtained using cell-phone number as the account of unique mark.
It should be understood that terminal here can include but is not limited to mobile terminal, intelligent terminal, IPD, tablet computer and PC
Machine.
" concern " application is sent out to address list part important member, i.e., sends concern request to server, server receives
Concern request is sent to the terminal of important member after being asked to the concern, asks opening relationships chain and mark relationship strength to refer to
Number.Other side does not respond, and system automatic marking relationship strength index is 0 (weak relation chain).Other side agrees to, marks relationship strength index
Arbitrary value (strong relation chain) in 1 to 5.
Keyword is inputted in search box, which is the target property information that system receives.System traverses relationship
Network, finds qualified object (target terminal), planning relation chain path, and every grade of relation chain marks strength factor, and
Except remaining relation chain node of the first relation chain shows the non-privacy information (i.e. attribute information) of member.
When not finding eligible object, prompt message can be sent to source terminal, i.e. system then prompts optimization crucial
Word, return to step 110 or is exited.
A kind of method in determining relation chain path that above-described embodiment provides meets item by being searched in strong relational network
The object of part, and at least one relation chain path with strong and weak index is cooked up automatically, so as to reduce the time into reduction
Manpower consumption promotes contact efficiency.
Optionally, as an alternative embodiment of the invention, as shown in figure 3, relation chain path is a plurality of, to source terminal
Before feedback, method 100 can also include:
160:Calculate the sum of relationship strength index of the relation chain in every relation chain path.
Then, it is specially 170 to source terminal feedback:According to the sum of corresponding relationship strength index in a plurality of relation chain path, to
Source terminal sends relation chain routing information.
Specifically, in this embodiment, step 170 is specifically as follows:A plurality of relation chain path Zhong Guan is sent to source terminal
It is the relation chain path of the sum of intensity index maximum.
Specifically, in this embodiment, the sum of relationship strength index of relation chain by calculating every relation chain path,
And according to the sum of corresponding relationship strength index in a plurality of relation chain path, by the relation chain of wherein the sum of relationship strength index maximum
Path is sent to source terminal, and relationship strength index is higher, illustrates that the contact between the node of relation chain is closer, therefore, will close
It is that the relation chain path of the sum of intensity index maximum is sent to source terminal, can further reduces time and manpower consumption, is promoted
Efficiency and user experience.
Optionally, as an alternative embodiment of the invention, as shown in figure 4, step 170 can specifically include:
171:By the sum of corresponding relationship strength index in a plurality of relation chain path, according to being ranked sequentially from big to small, obtain
Recommend class table to relation chain path.
172:Class table is recommended according to relation chain path, relation chain routing information is sent to source terminal.
Specifically, in this embodiment, step 172 is specifically as follows:Relation chain path, which is sent, to source terminal recommends class table,
So that the corresponding user of source terminal recommends selection target relation chain path in class table from relation chain path.
Specifically, in this embodiment, by by the sum of corresponding relationship strength index in a plurality of relation chain path, according to from
Arriving the small relation chain path being ranked sequentially greatly recommends class table to be sent to source terminal, so that the corresponding user of source terminal is from pass
Selection target relation chain path in class table is recommended in tethers path, so as to which user is facilitated flexibly to be selected according to the actual conditions of oneself
It selects, avoids because blindly recommending the time and the manpower consumption that bring.
Optionally, as an alternative embodiment of the invention, as shown in figure 4, method 100 can also include:
180:The second feedback information that source terminal is sent is received, which is used to indicate through relationship by objective (RBO) chain
Path has contacted success.
190:By the relationship strength index of all relation chains in relationship by objective (RBO) chain path, increase on the basis of first threshold
Add N, the value of N is more than 0.
Specifically, in this embodiment, such as:Increase by 0.5 or 1, but the embodiment of the present invention does not do this any restriction.
In this embodiment, when the instruction for receiving source terminal transmission has contacted successful the by relationship by objective (RBO) chain path
After two feedback informations, the relationship strength index of strong relation chain is updated, so as to be optimized to the relation chain in strong relational network, and
And the information in the relationship by objective (RBO) chain path can be preserved, it when searching again, can directly recommend, without matching again, save the time.
Optionally, as an alternative embodiment of the invention, as shown in figure 5, step 172 can also include:
1721:Source terminal is sent to by most preceding relation chain path is come in relation chain path recommendation class table.
1722:After receiving source terminal and sending the third feedback information for contacting failure, class is recommended according to relation chain path
Sequence in table sends the relation chain path in relation chain path recommendation class table to source terminal successively;Alternatively, perform step 110.
Specifically, it in this embodiment, is sent to most preceding relation chain path is come in relation chain path recommendation class table
After source terminal, if receiving the third feedback information of contact failure, then the relation chain path for coming second is sent to source terminal,
Meanwhile the relationship strength index of all relation chains in most preceding relation chain path can will be come, on the basis of first threshold
M is reduced, so as to be optimized to the relation chain in strong relational network.
Alternatively, after receiving source terminal and sending the third feedback information for contacting failure, receive what source terminal was sent again
New target property information redefines relation chain path.
It should be understood that in various embodiments of the present invention, the size of the serial number of above-mentioned each process is not meant to execution sequence
Successively, the execution sequence of each process should be determined with its function and internal logic, the implementation process without coping with the embodiment of the present invention
Form any restriction.
A kind of method in determining relation chain path provided in an embodiment of the present invention is described in detail above in conjunction with Fig. 1-5,
This method is further described with reference to example shown in fig. 6.
(1), assume there are 50 contact persons in the cell phone address book of user A, after user A is in registration in system, will communicate
Record inputs the system, and the attribute information of 50 contact persons, such as occupation, unit, age, hobby etc. also input are preserved.
(2), user A sends out " concern " 30 contact persons in 50 contact persons, such as:Point in systems can be passed through
Hit " concern ", scan personal Quick Response Code, the modes such as NFC and bluetooth receive the feedback informations of 20 individual consents, then A with this 20
Contact between people is strong relation chain, and marks arbitrary number of the relationship strength index between 1-5,10 person-to-person with other
It contacts as weak relation chain, and it is 0 to mark relationship strength index.
It should be noted that any user can be divided the contact person in oneself cell phone address book by above-mentioned steps
Then strong or weak relation can form the interpersonal relationship of the relationship strength index with characterization strong or weak relation.
If user A is considered as to a father node in interpersonal relationship, then with its be strong relation chain 20 people distinguish
It is child node, the user for this 20 people being respectively strong relation chain is Sun Jiedian, and so on.
(3), user A does not recognize the people for doing " patent agent ", is now to lookup one " patent agent " and is done only for it
It is title services, then needs to input target property information " patent agent " in systems, system is according to the search condition in people
Qualified multilevel relation chain is searched in the network of personal connections of border.Wherein, all information of first order relation chain can be shown, i.e., sub
The privacy information and attribute information of the user of node can be shown, and the user of Sun Jiedian, only show its attribute information.
(4), when having " patent agency in the attribute information for determining user B, C, D by the information of child node and Sun Jiedian
During people ", then user B, C, D is target object, and determines relation chain path according to multilevel relation chain.
It should be noted that when progress " patent agent " scans for, can first be searched for generally, then carry out essence
Really matching so that final result is exactly matched with search key.Such as:The attribute information of intermediate node and " " patent agency
People " is associated ", such as:" knowing production ", " knowing production consultant ", " knowing production agency " etc., the embodiment of the present invention does not make this any
It limits.
Such as:Personnel associated with " patent agent " have user a and user b in the child node of user A;User a's
Personnel associated with " patent agent " have a1, a2 and a3 in child node (i.e. the Sun Jiedian of user A);The child node of user b
Personnel associated with " patent agent " have b1 in (i.e. the Sun Jiedian of user A), and attribute information has for " patent agent's "
User D.
Attribute information has user B for " patent agent " in the child node (i.e. the Sun Jiedian of user a) of user a1 and a2;
Attribute information has user C for " patent agent " in the child node of user a3;Child node (the i.e. Sun Jie of user b of user b1
Point) in attribute information have a user C for " patent agent ".
Then, relation chain path is as shown in the table:
Number | Relation chain path | The sum of relationship strength index | Sequence |
1 | A—a—a1—B | 6 | 2 |
2 | A—a—a2—B | 7 | 1 |
3 | A—a—a3—C | 4 | 4 |
4 | A—b—b1—C | 5 | 3 |
5 | A—b—D | 3 | 5 |
According to upper table, it may be determined that 5 relation chain path numbers are respectively 1-5.Under default situations, can be by number
2 relation chain path is sent to the mobile phone of user A.Sorted recommendation list can be issued to the mobile phone of user A, user A visitors
Family is therefrom selected according to the demand of oneself, for example, select number for 5 relation chain path, if based on the relation chain path contact into
Work(then will send feedback information to system, and system will update the relationship strength index between A-b and b-D, so as to optimize relationship
Network.
Obviously, the method in determining relation chain path provided in an embodiment of the present invention, eliminates weak relationship from the beginning
Interference, it is possible to reduce unnecessary information, and also relation chain with intensity index is similar navigates with " map ", has stronger
Realistic meaning and use value.
It should be understood that the scheme that the specific number occurred in above-described embodiment is intended merely to the description embodiment of the present invention was lifted
Example, not to any restriction of the forecast scheme configuration of the embodiment of the present invention.
The embodiment of the present invention also provides a kind of computer equipment, including:Memory, processor and storage are on a memory simultaneously
The computer program run on a processor, wherein, processor realizes the method 100 in the various embodiments described above when performing program.
Specifically, in this embodiment, computer equipment includes but are not limited to the network equipments such as server, high in the clouds.
In addition, the terms "and/or", only a kind of incidence relation for describing affiliated partner, represents there may be
Three kinds of relationships, for example, A and/or B, can represent:Individualism A exists simultaneously A and B, these three situations of individualism B.Separately
Outside, character "/" herein, it is a kind of relationship of "or" to typically represent forward-backward correlation object.
More than, only specific embodiment of the invention, but protection scope of the present invention is not limited thereto is any to be familiar with
Those skilled in the art in the technical scope disclosed by the present invention, can readily occur in various equivalent modifications or substitutions,
These modifications or substitutions should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be wanted with right
Subject to the protection domain asked.
Claims (10)
- A kind of 1. method in determining relation chain path, which is characterized in that include the following steps:Step 1:The inquiry request that source terminal is sent is received, target property information is carried in the inquiry request;Step 2:According to the target property information, multilevel relation chain associated with the source terminal is built, until with described The target terminal that target property information exactly matches, wherein, in the multilevel relation chain, display is directly linked with the source terminal The all information of first order relation chain and the attribute information of remaining grade of relation chain, all information include privacy information and category Property information;Step 3:According to the source terminal, the multilevel relation chain and the target terminal, at least one relation chain path is determined And it is fed back to the source terminal.
- 2. according to the method described in claim 1, it is characterized in that, before step 2, the method further includes:Step 4:The concern request that the source terminal is sent is received, and institute is sent to first terminal associated with the source terminal It states to pay close attention to and ask, the concern request is for request and the first terminal opening relationships chain and marks relationship strength index;Step 5:After the first feedback information of agreement opening relationships chain for receiving second terminal transmission, by the second terminal Relationship strength index is labeled as first threshold, by the relationship strength of the terminal in the first terminal in addition to the second terminal Index is labeled as second threshold, wherein, first threshold is different from second threshold;Then in step 2, in the multilevel relation chain, the relationship strength index of every grade of relation chain is shown;Then step 3 is specially:According to the source terminal, the relationship strength index of every grade of relation chain and the target terminal, at least one institute is determined It states relation chain path and is fed back to the source terminal, wherein, the relationship strength index of every grade of relation chain is first threshold Value.
- 3. according to the method described in claim 2, it is characterized in that, the relation chain path to be a plurality of, to the source terminal Before feedback, the method further includes:Step 6:Calculate the sum of the relationship strength index of relation chain in every relation chain path;Then, it is specially step 7 to source terminal feedback:According to the corresponding relationship strength index in a plurality of relation chain path it With, to the source terminal send relation chain routing information.
- 4. according to the method described in claim 3, it is characterized in that, step 7 is specially:It is sent to the source terminal, a plurality of institute State the relation chain path of the sum of relationship strength index maximum in relation chain path.
- 5. according to the method described in claim 3, it is characterized in that, step 7 specifically includes:Step 7.1:By the sum of corresponding relationship strength index in a plurality of relation chain path, arranged according to sequence from big to small Row obtain relation chain path and recommend class table;Step 7.2:Class table is recommended according to the relation chain path, relation chain routing information is sent to the source terminal.
- 6. according to the method described in claim 5, it is characterized in that, step 7.2 is specially:The pass is sent to the source terminal Class table is recommended in tethers path, so that the corresponding user of the source terminal recommends selection target in class table to close from the relation chain path Tethers path.
- 7. according to the method described in claim 6, it is characterized in that, the method further includes:Step 8:The second feedback information that the source terminal is sent is received, second feedback information is used to indicate through the mesh Mark relation chain path has contacted success;Step 9:By the relationship strength index of all relation chains in the relationship by objective (RBO) chain path, in the base of the first threshold Increase N on plinth, the value of N is more than 0.
- 8. according to the method described in claim 5, it is characterized in that, step 7.2 specifically includes:Step 7.2.1:The source terminal is sent to by most preceding relation chain path is come in relation chain path recommendation class table;Step 7.2.2:After receiving the source terminal and sending the third feedback information for contacting failure, according to the relational link Diameter recommends the sequence in class table, sends the relation chain path in the relation chain path recommendation class table to the source terminal successively; Alternatively, perform step 1.
- 9. according to the method described in any one of claim 1-8, which is characterized in that the privacy information includes:Name and connection It is mode, the attribute information includes:Hobby, age, the industry being engaged in, unit, occupation and/or post information.
- 10. a kind of computer equipment, which is characterized in that including:It memory, processor and is stored on the memory and in institute The computer program run on processor is stated, wherein,The processor realizes the method described in any one of claim 1-9 when performing described program.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711274397.3A CN108229722A (en) | 2017-12-06 | 2017-12-06 | A kind of method and computer equipment in determining relation chain path |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711274397.3A CN108229722A (en) | 2017-12-06 | 2017-12-06 | A kind of method and computer equipment in determining relation chain path |
Publications (1)
Publication Number | Publication Date |
---|---|
CN108229722A true CN108229722A (en) | 2018-06-29 |
Family
ID=62653330
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711274397.3A Pending CN108229722A (en) | 2017-12-06 | 2017-12-06 | A kind of method and computer equipment in determining relation chain path |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108229722A (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102393843A (en) * | 2011-06-29 | 2012-03-28 | 广州市动景计算机科技有限公司 | Method and system for establishing relational network of user by using communication information of mobile terminal |
CN102955781A (en) * | 2011-08-19 | 2013-03-06 | 腾讯科技(深圳)有限公司 | Method and device for figure search |
CN104202319A (en) * | 2014-08-28 | 2014-12-10 | 北京淘友天下科技发展有限公司 | Method and device for social relation recommendation |
CN104219255A (en) * | 2013-05-29 | 2014-12-17 | 赵剑 | Social network mutual-assisting technique for satisfying user demands based on mobile phone address list |
CN105279159A (en) * | 2014-06-05 | 2016-01-27 | 腾讯科技(北京)有限公司 | Contact prompting method and device |
CN105894118A (en) * | 2016-04-01 | 2016-08-24 | 丁伟明 | Interpersonal relation path selection method and interpersonal relation path selection device |
-
2017
- 2017-12-06 CN CN201711274397.3A patent/CN108229722A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102393843A (en) * | 2011-06-29 | 2012-03-28 | 广州市动景计算机科技有限公司 | Method and system for establishing relational network of user by using communication information of mobile terminal |
CN102955781A (en) * | 2011-08-19 | 2013-03-06 | 腾讯科技(深圳)有限公司 | Method and device for figure search |
CN104219255A (en) * | 2013-05-29 | 2014-12-17 | 赵剑 | Social network mutual-assisting technique for satisfying user demands based on mobile phone address list |
CN105279159A (en) * | 2014-06-05 | 2016-01-27 | 腾讯科技(北京)有限公司 | Contact prompting method and device |
CN104202319A (en) * | 2014-08-28 | 2014-12-10 | 北京淘友天下科技发展有限公司 | Method and device for social relation recommendation |
CN105894118A (en) * | 2016-04-01 | 2016-08-24 | 丁伟明 | Interpersonal relation path selection method and interpersonal relation path selection device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20190166072A1 (en) | System and method for the automated notification of compatibility between real-time network participants | |
US8938220B2 (en) | Automated selection and presentation of pertinent contacts | |
US9160858B2 (en) | Routing of work in an enterprise based upon social information associated with enterprise agents and clients | |
US20150088562A1 (en) | Restaurant selection, wait time and attendance management | |
US11301534B2 (en) | Mediating method and device | |
CN110569507B (en) | Semantic recognition method, device, equipment and storage medium | |
CN101611398A (en) | The context-sensitive searches and the function that are used for instant messaging applications | |
CN106211020A (en) | The AD HOC Peer-To-Peer of mobile device | |
CN108452526A (en) | The querying method and device, storage medium, electronic device for failure cause of playing | |
US20120136877A1 (en) | System and method for selecting compatible users for activities based on experiences, interests or preferences as identified from one or more web services | |
CN103970814B (en) | For the method and system for the tissue for indicating visitor on a user interface | |
CN103942271B (en) | User profile searches system and method | |
CN103843281A (en) | Information exchange in the social network environment | |
US20070208747A1 (en) | Mutual Contacts Discovery | |
US20170308611A1 (en) | Personal relationship network search system and method therefor | |
CN109510758A (en) | Session establishing method, terminal, third-party application server and system | |
JP2012516492A (en) | Method, apparatus and computer program for adding profile data | |
CN105099727B (en) | Add the method and device of group member | |
US10212549B2 (en) | Social networking connections through short range wireless devices | |
EP3840347A1 (en) | Electronic communication system for providing expert information and method of using same | |
KR101736222B1 (en) | System and method for recommending meeting place | |
KR20110040335A (en) | Method and system for managing personal relalationship using electronic business cards | |
CN108229722A (en) | A kind of method and computer equipment in determining relation chain path | |
CN106202222A (en) | The determination method and device of focus incident | |
CN103716344A (en) | Agency-relation processing method and system, agent server and terminal device |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180629 |
|
RJ01 | Rejection of invention patent application after publication |