CN109284444A - A kind of recommended method of good friend, device, server and storage medium - Google Patents
A kind of recommended method of good friend, device, server and storage medium Download PDFInfo
- Publication number
- CN109284444A CN109284444A CN201811447964.5A CN201811447964A CN109284444A CN 109284444 A CN109284444 A CN 109284444A CN 201811447964 A CN201811447964 A CN 201811447964A CN 109284444 A CN109284444 A CN 109284444A
- Authority
- CN
- China
- Prior art keywords
- user
- friend
- information
- potential
- good friend
- 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 56
- 238000003860 storage Methods 0.000 title claims abstract description 32
- 230000007774 longterm Effects 0.000 abstract description 4
- 230000008569 process Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 8
- 235000004936 Bromus mango Nutrition 0.000 description 6
- 241001093152 Mangifera Species 0.000 description 6
- 235000014826 Mangifera indica Nutrition 0.000 description 6
- 235000009184 Spondias indica Nutrition 0.000 description 6
- 238000004891 communication Methods 0.000 description 6
- 239000012634 fragment Substances 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000005291 magnetic effect Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000003745 diagnosis Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 235000007926 Craterellus fallax Nutrition 0.000 description 1
- 240000007175 Datura inoxia Species 0.000 description 1
- 230000001133 acceleration Effects 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000001376 precipitating effect Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000002699 waste material Substances 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
- 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)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses the recommended method of good friend a kind of, device, server and storage mediums, wherein, this method comprises: the address list friend information based on each user establishes good friend's relational graph, wherein the friend relation figure is used to indicate the friend relation between user；The potential friend information of target user is determined based on the friend relation figure；Recommend potential good friend to the target user according to the potential friend information.Since address list is the long-term social customer relationship to precipitate in the process of people, being is more known relational network for users, therefore by carrying out relationship analysis to the address book data of storage, obtain more reasonable and accurate potential good friend, it may remind the user that the relationship between good friend, to the social networks of abundant user, user experience is promoted.
Description
Technical field
The present invention relates to Internet technical field more particularly to a kind of recommended method of good friend, device, server and storages
Medium.
Background technique
Along with the universal and commercialization of internet, more and more friend-making sites, social platform, mailbox platform constantly gush
It is existing, therefore there are a large amount of character relation, social relationships and human relations, and form complicated relation chain.
In the prior art, the friend relation net of horn of plenty user, user need oneself to go to search extension good friend, such as basis
Interest information is searched, the identical people of interest is determined with the interactive information of internet etc., is then added to the good friend of oneself.
Obviously, the mode of this extension good friend needs to waste many experience of user in the prior art, meanwhile, it adds in this way
Good friend there is no a relevance, user extends the low efficiency of circle of friends and experience effect is poor.
Summary of the invention
The present invention provides recommended method, device, server and the storage medium of a kind of good friend, and realization is fast and accurately dived
In friend recommendation, the friend relation net of reasonable extensions user improves user experience.
In a first aspect, the embodiment of the invention provides the recommended methods of good friend a kind of, comprising:
Address list friend information based on each user establishes good friend's relational graph, wherein the friend relation figure is used for table
Show the friend relation between user；
The potential friend information of target user is determined based on the friend relation figure；
Recommend potential good friend to the target user according to the potential friend information.
Second aspect, the embodiment of the invention also provides the recommendation apparatus of good friend a kind of, comprising:
Friend relation figure determining module establishes good friend's relational graph for the address list friend information based on each user,
In, the friend relation figure is used to indicate the friend relation between user；
Potential good friend's determining module, for determining the potential friend information of target user based on the friend relation figure；
Potential friend recommendation module, for recommending potential good friend to the target user according to the potential friend information.
The third aspect, the embodiment of the invention also provides a kind of server, the server includes:
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processing
Device realizes the recommended method of good friend as described in any embodiment of that present invention a kind of.
Fourth aspect, it is described the embodiment of the invention also provides a kind of storage medium comprising computer executable instructions
Computer executable instructions are a kind of good as described in any embodiment of that present invention for executing when being executed as computer processor
The recommended method of friend.
The embodiment of the present invention establishes good friend's relational graph by the address list friend information based on each user, wherein described
Friend relation figure is used to indicate the friend relation between user；The potential good friend of target user is determined based on the friend relation figure
Information；Recommend potential good friend to the target user according to the potential friend information.Since address list is the long-term society of people
The customer relationship to precipitate during handing over, being is more known relational network for users, therefore by storage
Address book data carries out relationship analysis, obtains more then reminding the relationship between user good friend rationally with accurate potential good friend,
To the social networks of abundant user, user experience is promoted.
Detailed description of the invention
Fig. 1 is the flow chart of the recommended method of one of the embodiment of the present invention one good friend.
Fig. 2 is the flow chart of the recommended method of one of the embodiment of the present invention two good friend.
Fig. 3 is the schematic diagram that one of embodiment of the present invention two determines potential good friend.
Fig. 4 is the schematic diagram that the another kind in the embodiment of the present invention two determines potential good friend.
Fig. 5 is the structural schematic diagram of one of the embodiment of the present invention two friend recommendation system.
Fig. 6 is the structural schematic diagram of the recommendation apparatus of one of the embodiment of the present invention three good friend.
Fig. 7 is the structural schematic diagram of one of the embodiment of the present invention four server.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining the present invention rather than limiting the invention.It also should be noted that in order to just
Only the parts related to the present invention are shown in description, attached drawing rather than entire infrastructure.
Embodiment one
Fig. 1 is a kind of flow chart of the recommended method for good friend that the embodiment of the present invention one provides, and the present embodiment is applicable to
The case where recommending potential good friend to user, this method can be executed by the recommendation apparatus of good friend, which can use hardware
And/or software realization, and can be configured in server, this method specifically comprises the following steps:
S110, the address list friend information based on each user establish good friend's relational graph, wherein the friend relation figure is used
Friend relation between expression user.
Wherein, address list can be good friend or the contact information of user's foundation, including user identity and contact method letter
Breath, such as telephonic communication record or mailbox address book etc..Specifically, user A can establish oneself address list in user terminal, then
User B and C in its address list can be considered as the user that good friend is added to by user A.It is logical based on each user
Friend information in news record can establish friend relation figure, for indicating the friend relation between user.Since address list can be with
It is the customer relationship of the long-term social accumulation addition of precipitating in the process of user, being is more known network of personal connections for users
Network.Therefore, using each user address list friend information establish friend relation figure can it is more acurrate and it is reasonable indicate respectively
Friend relation between a user.
S120, the potential friend information that target user is determined based on the friend relation figure.
Target user can be any one or more users in friend relation figure.The potential good friend of target user can be with
It is that the user of good friend is not added to by target user but may be understanding or the user for having common friend relationship.For example, a kind of
Situation are as follows: it is good friend that user B is added in user A, but user B is good friend there is no addition user A, then for user B, uses
Family A can be with the potential good friend for him.Another situation are as follows: it is good friend that user B is added in user A, and user C addition user B is
Good friend can potential good friend each other between user C and A then for user A and C.Friend relation figure based on foundation can be true
Set the goal the potential friend information of user, and friend information may include the identification information and contact information of good friend.
S130, potential good friend is recommended to the target user according to the potential friend information.
On the basis of determining potential friend information, corresponding potential good friend can be recommended to user, for example use in target
Directly recommend to show existing potential good friend and good friend's contact method in the address list at family, so that target user can be convenient directly
It connects potential good friend addition in the address list of oneself, extends the friend circle of oneself.
Optionally, potential good friend is recommended to the target user according to the potential friend information, comprising:
At least one contact information of the potential good friend is sent to the target user.Determining potential good friend
On the basis of, when recommending potential good friend to target user, multiple contact methods of potential good friend can be recommended into target simultaneously
User, such as email address and the corresponding user's pet name of account etc..
Optionally, the vertex representation user in the friend relation figure, directed edge indicate the friend relation between user；Appoint
One representative points also have attribute information, including the first attribute information and the second attribute information, wherein first attribute information
User information including being added to good friend by the target user, the second attribute information include adding the target user preferably
The user information of friend；The user information includes at least the identification information of user.
Specifically, the friend relation figure of the foundation can be a Directed multi-graph, it be connected to each vertex and
The user-defined object on side, each vertex can indicate a user, and each vertex can be by a unique VertexID
It is identified as vertex ID, such as 1,2,3 or other identifier information etc..Representative points can be any in friend relation figure
Vertex, each vertex are with attribute information.Wherein the first attribute information can be considered as target user corresponding with representative points
Address list in friend information.Second attribute information, which can be considered as, is added to good friend's for the corresponding target user of representative points
User information.And user information includes at least identification information of user, such as name or the ID mark of user etc. and can say
The unique information of bright user identity, vertex ID can be one-to-one with the identity of user.
Illustratively, there may be the sides of multiple parallel (parallel) to share identical source and destination in friend relation figure
Ground vertex, identical vertex may exist a variety of relationships.For example a side by 1 direction 2 is only existed between vertex 1 and 2, then
The user that can indicate that vertex 1 represents is added to the user that vertex 2 represents as good friend, but the user that vertex 2 represents is not
The user that addition vertex 1 represents is good friend, is a kind of relationship for unidirectionally becoming good friend.If between vertex 1 and vertex 2 simultaneously
There are one by 1 be directed toward 2 while and one by 2 be directed toward 1 while, or there are a two fingers to side, then can indicate vertex 1
The user represented with 2 is added to mutually other side as good friend, i.e., mutually in the address list of other side.Illustratively, for two
The recommendation of degree relationship, that is, friends of friends relationship, which can be abstracted into, searches out the shortest distance on specified vertex in digraph as 2 institute
There is vertex, the vertex for meeting above-mentioned condition is known as to two hop neighbors on vertex, i.e., potential good friend.
Optionally, the address list friend information based on each user establishes good friend's relational graph, comprising:
All good friends identification information of each user being sent in the address list of each user；
The attribute information of each user is determined according to the identification information that each user sends and receives, wherein described
First attribute information determines that second attribute information is according to each use according to the identification information that each user sends
The identification information that family receives determines；
The friend relation figure is established based on each user and its attribute information.
Illustratively, it is assumed that the ID of each user and ID of corresponding vertex be it is same, in each user by the ID of oneself
It, can be using all user informations for sending ID of each user as each user after being sent to the good friend in oneself address list
The first attribute information.Meanwhile it can be using the user information for all ID that each user receives as the second of each user
Attribute information.Such as the first attribute information and the second attribute information can be stored respectively in the form of a list list.In this way
After the attribute information of each user and each user determine, it can determine that the vertex in good friend's relational graph, vertex belong to
Relationship between property information and vertex and vertex.
Certainly, if target user increases good friend newly in address list and either imports contact person's operation, system can update
The friend relation figure, during update, can only update has unidirectional addition or the use of two-way addition good friend with target user
The corresponding vertex in family and vertex attribute information etc. reduce system-computed amount, accelerate friend recommendation speed.
The technical solution of the present embodiment, the address list friend information based on each user establish good friend's relational graph, wherein institute
Friend relation figure is stated for indicating the friend relation between user；Determine that target user's is potential good based on the friend relation figure
Friendly information；Recommend potential good friend to the target user according to the potential friend information.Since address list is that people are long-term
The customer relationship to precipitate during social, being is more known relational network for users, therefore by storage
Address book data carry out relationship analysis, obtain more rationally and accurate potential good friend, may remind the user that the pass between good friend
System, so that the social networks of abundant user, promotes user experience.
Embodiment two
Fig. 2 is a kind of flow chart of the recommended method of good friend provided by Embodiment 2 of the present invention, in the base of above-described embodiment
On plinth, optionally, this method is advanced optimized, as shown in Fig. 2, this method specifically includes:
S210, the address list friend information based on each user establish good friend's relational graph, wherein the friend relation figure is used
Friend relation between expression user.
The first attribute information and the second attribute information of target user's corresponding vertex described in S220, comparison；Determine the mesh
Mark the different user of identification information and the mesh in the first attribute information and the second attribute information of user's corresponding vertex
Mark potential good friend each other between user.
Specifically, can determine that the user's of the vertex correspondence is potential good according to the attribute information on vertex in friend relation figure
Friendship condition.Fig. 3 is the schematic diagram that one of embodiment of the present invention two determines potential good friend, as shown in figure 3, for target user
For corresponding representative points 1, it is assumed that include user 2,3 and 4 in the list of the first attribute information；In second attribute information list
Including user 2,4 and 6.I.e. target user is added to user 2, and user 3 and user 4 are good friend.And target user be by user 4,
User 5 and user 6 are added to good friend, therefore, by comparing the first attribute information and the second attribute information, it can be realized that target
The corresponding user 1 in vertex 1 and user 2 good friend each other, user 1 and user 4 good friend each other, and user 3 is that user 1 is single
To good friend is added to, it is good friend that user 6, which is unidirectionally added to user 1,.It therefore, can potential good friend by user 6 as user 1
And the potential good friend by user 1 as user 3.
S230, potential good friend is recommended to the target user according to the potential friend information.
Optionally, in another embodiment, determine that the potential good friend of target user believes based on the friend relation figure
Breath, comprising: the first attribute information or the second attribute information between target user's corresponding vertex of more any preset quantity；Really
It is potential each other good between the target user of common identity identification information present in fixed first attribute information or the second attribute information
Friend.
Wherein, preset quantity can be the number of the corresponding attribute information of more several representative points while presetting
Mesh, for example the first attribute information or the second attribute information between any two vertex can be compared simultaneously.The preset quantity can
To be set according to the actual performance and business of system.Fig. 4 is that the another kind in the embodiment of the present invention two is determining latent
In the schematic diagram of good friend, as shown in figure 4, illustratively, if by target user 1 and the corresponding vertex 1 of target user 2 and vertex
2 are used as representative points, and second attribute information on vertex 1 includes: user 2, and user 4, and user 5；Second attribute information on vertex 2
It include: user 1, user 2, and user 4, then it is recognized that user 1 is added to good friend by user 2,4 and 5, user 2 is by user, and 2
Good friend is added to 4, i.e., user 1 and user 2 are added to good friend by user 2 and 4 simultaneously, and user 1 and user 2 possess common good
Friendly two people, if preset, when gathering around there are two more than common friend, so that it may be determined as potential good friend, then it can be by mesh
User 1 and target user 2 are marked as mutual potential good friend.Certainly, it during specific recommend, can further inquire
User 2 whether in the first attribute information of user 1, if, can not potential good friend by user 2 as user 1, such as
Fruit does not exist, then can potential good friend by user 2 as user 1.Similarly, it can be determined that whether user 1 is the potential good of user 2
Friend.Similar, it can use the first attribute information between target user and determine corresponding potential good friend.
Optionally, after the potential friend information that target user is determined based on the friend relation figure, which comprises
By the target user and its corresponding identification information of potential good friend and the number of common friend to gather shape
Formula storage.During specific implementation, the information aggregate of a commending friends can be added in each vertex, preservation pushes away
The user for recommending out can knowable potential good friend, each element in set is that user knowable ID (UIN) and can possess
Common friend number, i.e. (uin, num) binary group.For example, the potential good friend of target user 1 includes user 2 and user 3,
Common friend number is 2.Wherein, the common friend of user 2 and user 1 can be is added to good friend by user 1 and user 2 simultaneously
User and/or be by user 1 and user 2 while the user for being added to good friend.The potential good friend of recommendation is stored to set, it can
To facilitate system quickly to traverse the commending friends set of target user when being recommended, it is quickly found out commending friends.
Optionally, first attribute information and the second attribute information on each vertex are stored in the form of set respectively.
Illustratively, gathered using W, save the user list (i.e. the first attribute information) that addition user is contact person, each element is
One addition active user is the ID of the user of contact person.Gathered using M, saves active user and be added to which user as connection
People's (i.e. the second attribute information), each element are the ID for the user that an active user has been added to contact person.
Optionally, the attribute information on each vertex further includes contact information, the contact information packet on each vertex
It includes in first attribute information, at least one contact method of each user and the addition number of the contact method, and with
The form of set stores.
During specific implementation, the shape that the contact information in the attribute information on each vertex can be gathered
Formula stores, for example is gathered using C, saves the All Contacts of user's addition, and each element adds for user in address list each
The contact method of a contact person, it may be possible to cell-phone number or email address.Allow to repeat to add certain contact method, increases addition time
Digital section.I.e. each element is the binary group of one (contact method adds number).Contact method is stored in the form of set
Afterwards, when carrying out friend recommendation, it can quickly traverse set and find the contact method for wanting potential good friend, accelerate the recommendation of system well
Friendly speed facilitates deployment for system cluster.
In addition, the embodiment of the present invention can be applied in relationship analysis system, which can be closed by business diagnosis module
It is computing module, data cache module, data memory module composition.Business diagnosis module be responsible for address list Batch Processing analysis,
Notify relation service.Relation service computing module is responsible for calculated relationship, data update to MongoDB (mango DB database) and collect
Group.Data cache module is responsible for caching and calculates data after completion, inquires for inquiry business.Data store mould MongoDB (mango
DB database) the responsible data for being used to store relation service of cluster.As shown in figure 5, MongoDB (mango DB database) cluster can
To include 2 two servers of fragment 1 and fragment and MongoDB (mango DB database) routing, wherein can in each server
To include main MongoD (mango DB database) service and spare MongoD (mango DB database) service.It utilizes simultaneously
The data interaction of mayknowSvr (the temporary service of relationship) between service and the address list main program of each user is realized to each use
The address book data at family is read out and inquires, and user can inquire good friend's situation of the user during login system.It utilizes
Address list analyzes the data interaction between program and mayknowSvr (the temporary service of relationship) service, realizes repairing for user communication record
Change, including increases, the operation such as deletion and modification.MayknowSvr (the temporary service of relationship) service can be from Memcache simultaneously
The potential friend information of each user by being calculated is read in (cache service) caching.MayknowSvr (relationship
Temporary service) address book data of each user that can will acquire of service and potential good friend's data are sent to by routing
Fragment 1 and 2 server of fragment are stored.In the resource abundance situation of high configuration cluster, using in the embodiment of the present invention
The advantages that contact relationship system analyzes next data, and inquiry is fast, and it is accurate to recommend, and is convenient for deployment.
Embodiment three
Fig. 6 is a kind of structural schematic diagram of the recommendation apparatus for good friend that the embodiment of the present invention three provides, as shown in fig. 6, institute
Stating device includes:
Friend relation figure determining module 610 establishes good friend's relational graph for the address list friend information based on each user,
Wherein, the friend relation figure is used to indicate the friend relation between user；
Potential good friend's determining module 620, for determining the potential friend information of target user based on the friend relation figure；
Potential friend recommendation module 630 is potential good for being recommended according to the potential friend information to the target user
Friend.
Optionally, the vertex representation user in the friend relation figure, directed edge indicate the friend relation between user；Appoint
One representative points also have attribute information, including the first attribute information and the second attribute information, wherein first attribute information
User information including being added to good friend by the target user, the second attribute information include adding the target user preferably
The user information of friend；The user information includes at least the identification information of user.
Optionally, the friend relation figure determining module 610, is specifically used for:
All good friends identification information of each user being sent in the address list of each user；
The attribute information of each user is determined according to the identification information that each user sends and receives, wherein described
First attribute information determines that second attribute information is according to each use according to the identification information that each user sends
The identification information that family receives determines；
The friend relation figure is established based on each user and its attribute information.
Optionally, potential good friend's determining module 620, is specifically used for:
Compare the first attribute information and the second attribute information of target user's corresponding vertex；
Determine the identification information in the first attribute information and the second attribute information of target user's corresponding vertex
Potential good friend each other between different users and the target user.
Optionally, potential good friend's determining module 620, is specifically also used to:
Compare the first attribute information or the second attribute information between target user's corresponding vertex of any preset quantity；
Between the target user for determining common identity identification information present in the first attribute information or the second attribute information
Potential good friend each other.
Optionally, described device further include: potential good friend's memory module, for determining mesh based on the friend relation figure
After the potential friend information for marking user, by the target user and its corresponding identification information of potential good friend and common good
Friend's number is stored with aggregate form.
Optionally, the potential friend recommendation module 630, is specifically used for: at least one by the potential good friend contacts
Mode information is sent to the target user.
Optionally, first attribute information and the second attribute information on each vertex are stored in the form of set respectively.
Optionally, the attribute information on each vertex further includes contact information, the contact information packet on each vertex
It includes in first attribute information, at least one contact method of each user and the addition number of the contact method, and with
The form of set stores.
Good friend provided by any embodiment of the invention can be performed in the recommendation apparatus of good friend provided by the embodiment of the present invention
Recommended method, have the corresponding functional module of execution method and beneficial effect.The not technology of detailed description in the present embodiment
Details, reference can be made to a kind of recommended method for good friend that any embodiment of that present invention provides.
Example IV
Referring to Fig. 7, a kind of server 700 is present embodiments provided comprising: one or more processors 720；Storage dress
710 are set, for storing one or more programs, when one or more of programs are held by one or more of processors 720
Row, so that one or more of processors 720 realize a kind of recommended method of good friend provided by the embodiment of the present invention, packet
It includes:
Address list friend information based on each user establishes good friend's relational graph, wherein the friend relation figure is used for table
Show the friend relation between user；
The potential friend information of target user is determined based on the friend relation figure；
Recommend potential good friend to the target user according to the potential friend information.
Certainly, it will be understood by those skilled in the art that processor 720 can also realize that any embodiment of that present invention is provided
A kind of good friend recommended method technical solution.
The server 700 that Fig. 7 is shown is only an example, should not function and use scope band to the embodiment of the present invention
Carry out any restrictions.
As shown in fig. 7, server 700 is showed in the form of universal computing device.The component of server 700 may include but
Be not limited to: one or more processor 720, storage device 710 connect different system components (including storage device 710 and place
Manage device 720) bus 750.
Bus 750 indicates one of a few class bus structures or a variety of, including memory bus or Memory Controller,
Peripheral bus, graphics acceleration port, processor or the local bus using any bus structures in a variety of bus structures.It lifts
For example, these architectures include but is not limited to industry standard architecture (ISA) bus, microchannel architecture (MAC)
Bus, enhanced isa bus, Video Electronics Standards Association (VESA) local bus and peripheral component interconnection (PCI) bus.
Server 700 typically comprises a variety of computer system readable media.These media can be it is any being capable of bedding and clothing
The usable medium that business device 700 accesses, including volatile and non-volatile media, moveable and immovable medium.
Storage device 710 may include the computer system readable media of form of volatile memory, such as arbitrary access
Memory (RAM) 711 and/or cache memory 712.Server 700 may further include other removable/not removable
Dynamic, volatile/non-volatile computer system storage medium.Only as an example, storage system 713 can be used for read and write can not
Mobile, non-volatile magnetic media (Fig. 7 do not show, commonly referred to as " hard disk drive ").Although being not shown in Fig. 7, Ke Yiti
For the disc driver for being read and write to removable non-volatile magnetic disk (such as " floppy disk "), and to moving non-volatile light
The CD drive of disk (such as CD-ROM, DVD-ROM or other optical mediums) read-write.In these cases, each driver
It can be connected by one or more data media interfaces with bus 750.Storage device 710 may include at least one program
Product, the program product have one group of (for example, at least one) program module, these program modules are configured to perform the present invention
The function of each embodiment.
Program/utility 714 with one group of (at least one) program module 715 can store in such as storage dress
It sets in 710, such program module 715 includes but is not limited to operating system, one or more application program, other program moulds
It may include the realization of network environment in block and program data, each of these examples or certain combination.Program module
715 usually execute function and/or method in any embodiment described in the invention.
Server 700 can also be with one or more external equipments 760 (such as keyboard, sensing equipment, display 770 etc.)
Communication, can also be enabled a user to one or more equipment interact with the server 700 communicate, and/or with make the clothes
Any equipment (such as network interface card, modem etc.) that business device 700 can be communicated with one or more of the other calculating equipment
Communication.This communication can be carried out by input/output (I/O) interface 730.Also, server 700 can also be suitable by network
Orchestration 740 and one or more network (such as local area network (LAN), wide area network (WAN) and/or public network, such as because of spy
Net) communication.As shown in fig. 7, network adapter 740 is communicated by bus 750 with other modules of server 700.It should be understood that
Although not shown in the drawings, other hardware and/or software module can be used in conjunction with server 700, including but not limited to: micro- generation
Code, device driver, redundant processing unit, external disk drive array, RAID system, tape drive and data backup are deposited
Storage system etc..
The program that processor 720 is stored in storage device 710 by operation, thereby executing various function application and number
According to processing, such as realize a kind of recommended method of good friend provided by the embodiment of the present invention.
Embodiment five
The embodiment of the present invention five provides a kind of storage medium comprising computer executable instructions, and the computer is executable
It instructs when being executed by computer processor for executing the recommended method of good friend a kind of, this method comprises:
Address list friend information based on each user establishes good friend's relational graph, wherein the friend relation figure is used for table
Show the friend relation between user；
The potential friend information of target user is determined based on the friend relation figure；
Recommend potential good friend to the target user according to the potential friend information.
Certainly, a kind of storage medium comprising computer executable instructions, computer provided by the embodiment of the present invention
The method operation that executable instruction is not limited to the described above, can also be performed a kind of good friend provided by any embodiment of the invention
Recommended method in relevant operation.
The computer storage medium of the embodiment of the present invention, can be using any of one or more computer-readable media
Combination.Computer-readable medium can be computer-readable signal media or computer readable storage medium.It is computer-readable
Storage medium for example may be-but not limited to-the system of electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, device or
Device, or any above combination.The more specific example (non exhaustive list) of computer readable storage medium includes: tool
There are electrical connection, the portable computer diskette, hard disk, random access memory (RAM), read-only memory of one or more conducting wires
(ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-
ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.In this document, computer-readable storage
Medium can be any tangible medium for including or store program, which can be commanded execution system, device or device
Using or it is in connection.
Computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By the use of instruction execution system, device or device or program in connection.
The program code for including on computer-readable medium can transmit with any suitable medium, including --- but it is unlimited
In wireless, electric wire, optical cable, RF etc. or above-mentioned any appropriate combination.
The computer for executing operation of the present invention can be write with one or more programming languages or combinations thereof
Program code, described program design language include object oriented program language-such as Java, Smalltalk, C++,
It further include conventional procedural programming language-such as " C " language or similar programming language.Program code can be with
It fully executes, partly execute on the user computer on the user computer, being executed as an independent software package, portion
Divide and partially executes or executed on a remote computer or server completely on the remote computer on the user computer.?
Be related in the situation of remote computer, remote computer can pass through the network of any kind --- including local area network (LAN) or
Wide area network (WAN)-be connected to subscriber computer, or, it may be connected to outer computer (such as mentioned using Internet service
It is connected for quotient by internet).
Note that the above is only a better embodiment of the present invention and the applied technical principle.It will be appreciated by those skilled in the art that
The invention is not limited to the specific embodiments described herein, be able to carry out for a person skilled in the art it is various it is apparent variation,
It readjusts and substitutes without departing from protection scope of the present invention.Therefore, although being carried out by above embodiments to the present invention
It is described in further detail, but the present invention is not limited to the above embodiments only, without departing from the inventive concept, also
It may include more other equivalent embodiments, and the scope of the invention is determined by the scope of the appended claims.
Claims (12)
1. a kind of recommended method of good friend, which is characterized in that the described method includes:
Address list friend information based on each user establishes good friend's relational graph, wherein the friend relation figure is used for indicating
Friend relation between family；
The potential friend information of target user is determined based on the friend relation figure；
Recommend potential good friend to the target user according to the potential friend information.
2. the method according to claim 1, wherein the vertex representation user in the friend relation figure, oriented
Side indicates the friend relation between user；
Either objective vertex also has attribute information, including the first attribute information and the second attribute information, wherein described first belongs to
Property information includes that the user information of good friend is added to by the target user, and the second attribute information includes adding the target user
The user information added as a friend；
The user information includes at least the identification information of user.
3. according to the method described in claim 2, it is characterized in that, the address list friend information based on each user establishes good friend
Relational graph, comprising:
All good friends identification information of each user being sent in the address list of each user；
The attribute information of each user is determined according to the identification information that each user sends and receives, wherein described first
Attribute information determines that second attribute information connects according to each user according to the identification information that each user sends
The identification information received determines；
The friend relation figure is established based on each user and its attribute information.
4. according to the method described in claim 2, it is characterized in that, determining that target user's is potential based on the friend relation figure
Friend information, comprising:
Compare the first attribute information and the second attribute information of target user's corresponding vertex；
Determine that the identification information in the first attribute information and the second attribute information of target user's corresponding vertex is different
User and the target user between potential good friend each other.
5. according to the method described in claim 2, it is characterized in that, determining that target user's is potential based on the friend relation figure
Friend information, comprising:
Compare the first attribute information or the second attribute information between target user's corresponding vertex of any preset quantity；
It determines between the target user of common identity identification information present in the first attribute information or the second attribute information each other
Potential good friend.
6. according to the method any in claim 2-5, which is characterized in that determine that target is used based on the friend relation figure
After the potential friend information at family, which comprises
The target user and its corresponding identification information of potential good friend and common friend number are stored with aggregate form.
7. according to the method any in claim 2-5, which is characterized in that according to the potential friend information to the mesh
It marks user and recommends potential good friend, comprising:
At least one contact information of the potential good friend is sent to the target user.
8. according to the method any in claim 2-5, which is characterized in that first attribute information on each vertex and
Second attribute information is stored in the form of set respectively.
9. according to the method any in claim 2-5, which is characterized in that the attribute information on each vertex further includes connection
Mode information, the contact information on each vertex are included in first attribute information, at least one connection of each user
The addition number of mode and the contact method, and stored in the form of set.
10. a kind of recommendation apparatus of good friend, which is characterized in that described device includes:
Friend relation figure determining module establishes good friend's relational graph for the address list friend information based on each user, wherein institute
Friend relation figure is stated for indicating the friend relation between user；
Potential good friend's determining module, for determining the potential friend information of target user based on the friend relation figure；
Potential friend recommendation module, for recommending potential good friend to the target user according to the potential friend information.
11. a kind of server, which is characterized in that the server includes:
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real
A kind of now recommended method of good friend as described in any in claim 1-9.
12. a kind of storage medium comprising computer executable instructions, the computer executable instructions are by computer disposal
For executing the recommended method of good friend as described in any in claim 1-9 a kind of when device executes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811447964.5A CN109284444A (en) | 2018-11-29 | 2018-11-29 | A kind of recommended method of good friend, device, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811447964.5A CN109284444A (en) | 2018-11-29 | 2018-11-29 | A kind of recommended method of good friend, device, server and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109284444A true CN109284444A (en) | 2019-01-29 |
Family
ID=65173245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811447964.5A Pending CN109284444A (en) | 2018-11-29 | 2018-11-29 | A kind of recommended method of good friend, device, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109284444A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113297436A (en) * | 2021-04-28 | 2021-08-24 | 上海淇玥信息技术有限公司 | User policy distribution method and device based on relational graph network and electronic equipment |
| CN113486258A (en) * | 2021-07-05 | 2021-10-08 | 北京易数科技有限公司 | Data analysis method, device, medium and electronic equipment based on social network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100309225A1 (en) * | 2009-06-03 | 2010-12-09 | Gray Douglas R | Image matching for mobile augmented reality |
| CN103425703A (en) * | 2012-05-25 | 2013-12-04 | 深圳市腾讯计算机***有限公司 | Method and device for processing network information |
| CN104580385A (en) * | 2014-12-16 | 2015-04-29 | 腾讯科技（深圳）有限公司 | Method and device expanding user relationship chain |
| WO2017024920A1 (en) * | 2015-08-12 | 2017-02-16 | 大连民族学院 | Method and terminal for acquiring social relationship chain, and computer readable medium |
| CN107346333A (en) * | 2017-06-27 | 2017-11-14 | 浙江大学 | A kind of online social networks friend recommendation method and system based on link prediction |
| CN108768835A (en) * | 2018-05-30 | 2018-11-06 | 彩讯科技股份有限公司 | A kind of mail analytic method, device, server and storage medium |
-
2018
- 2018-11-29 CN CN201811447964.5A patent/CN109284444A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100309225A1 (en) * | 2009-06-03 | 2010-12-09 | Gray Douglas R | Image matching for mobile augmented reality |
| CN103425703A (en) * | 2012-05-25 | 2013-12-04 | 深圳市腾讯计算机***有限公司 | Method and device for processing network information |
| CN104580385A (en) * | 2014-12-16 | 2015-04-29 | 腾讯科技（深圳）有限公司 | Method and device expanding user relationship chain |
| WO2017024920A1 (en) * | 2015-08-12 | 2017-02-16 | 大连民族学院 | Method and terminal for acquiring social relationship chain, and computer readable medium |
| CN107346333A (en) * | 2017-06-27 | 2017-11-14 | 浙江大学 | A kind of online social networks friend recommendation method and system based on link prediction |
| CN108768835A (en) * | 2018-05-30 | 2018-11-06 | 彩讯科技股份有限公司 | A kind of mail analytic method, device, server and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113297436A (en) * | 2021-04-28 | 2021-08-24 | 上海淇玥信息技术有限公司 | User policy distribution method and device based on relational graph network and electronic equipment |
| CN113297436B (en) * | 2021-04-28 | 2023-09-05 | 上海淇玥信息技术有限公司 | User policy distribution method and device based on relational graph network and electronic equipment |
| CN113486258A (en) * | 2021-07-05 | 2021-10-08 | 北京易数科技有限公司 | Data analysis method, device, medium and electronic equipment based on social network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11323347B2 (en) | Systems and methods for social graph data analytics to determine connectivity within a community | |
| US8938434B2 (en) | Household grouping based on public records | |
| WO2018024057A1 (en) | Method and apparatus for accessing service | |
| KR101955297B1 (en) | Data information transaction method and system | |
| WO2018059176A1 (en) | Method and apparatus for generating targeted label and storage medium | |
| CN111159587B (en) | User access information processing method and device and terminal equipment | |
| JP6450013B2 (en) | Techniques for graph-based natural language processing | |
| CN110163004A (en) | A kind of method, relevant device and system that block chain generates | |
| US20140095308A1 (en) | Advertisement distribution apparatus and advertisement distribution method | |
| CN105872837A (en) | User recommendation method and device | |
| CN110555172B (en) | User relationship mining method and device, electronic equipment and storage medium | |
| US10033827B2 (en) | Scalable management of composite data collected with varied identifiers | |
| CN107835498B (en) | Method and equipment for managing user | |
| CN111814065B (en) | Information propagation path analysis method and device, computer equipment and storage medium | |
| US9619780B2 (en) | Information exchange in the social network environment | |
| CN108427761B (en) | News event processing method, terminal, server and storage medium | |
| CN105808649A (en) | Search result sorting method and device | |
| US20150302088A1 (en) | Method and System for Providing Personalized Content | |
| US10681499B2 (en) | Methods and systems for evaluating applications in an application distribution platform | |
| CN104750718B (en) | The searching method and equipment of a kind of data information | |
| CN108733698A (en) | A kind of processing method and background service system of log information | |
| CN109284444A (en) | A kind of recommended method of good friend, device, server and storage medium | |
| CN114143000B (en) | Method and device for inquiring trace based on careless transmission protocol and secret sharing | |
| CN109672721B (en) | Media file pushing method and device, server and computer readable storage medium | |
| US20160283517A1 (en) | Real Estate Data Gathering System and Method |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190129 |