CN111178564B - Information processing method, information processing device, readable storage medium and terminal equipment - Google Patents
Information processing method, information processing device, readable storage medium and terminal equipment Download PDFInfo
- Publication number
- CN111178564B CN111178564B CN201910754938.5A CN201910754938A CN111178564B CN 111178564 B CN111178564 B CN 111178564B CN 201910754938 A CN201910754938 A CN 201910754938A CN 111178564 B CN111178564 B CN 111178564B
- Authority
- CN
- China
- Prior art keywords
- target user
- degree
- reserved
- site
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 29
- 238000003672 processing method Methods 0.000 title claims abstract description 16
- 210000003462 vein Anatomy 0.000 claims abstract description 46
- 230000003993 interaction Effects 0.000 claims description 13
- 238000000034 method Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 4
- 230000000694 effects Effects 0.000 abstract description 7
- 238000010586 diagram Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 239000013078 crystal Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000011160 research Methods 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/02—Reservations, e.g. for tickets, services or events
-
- 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Abstract
The embodiment of the application provides an information processing method, an information processing device, a readable storage medium and terminal equipment, wherein the n-degree humane relation between at least part of users added in a reserved place and target users is obtained; and if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user. By showing the n-degree humane relationship between at least one user joining the reserved site and the target user to the target user, the certainty factor of the site is increased, and the uncertainty factor is reduced, so that the target user can know the user condition in the reserved site more clearly, and the target user can be helped to find the site and the partner for the activities in real time and quickly.
Description
Technical Field
The present application relates to the field of information processing technologies, and in particular, to an information processing method, an information processing device, a readable storage medium, and a terminal device.
Background
As the community scale increases, the investment scale of municipal administration in the construction of casinos (basketball courts, tennis courts, chess and card houses, etc.) increases. Many sites currently support online booking, and after one user subscribes to a site on the network, other users can see the booking information of the site on the network and can opt to join the site to be able to participate in offline activities organized at the site.
However, the inventor researches and discovers that the booking information displayed by the current site booking function is simple and only comprises site related information, such as site name, site, activity time and the like, and the site selected based on the information still has a plurality of uncertainty factors, such as whether the subscriber of the site is credible, how his technology is, and the like, so that the user is difficult to select the site and the activity experience of the user is reduced.
Disclosure of Invention
In view of this, embodiments of the present application provide an information processing method, an apparatus, a readable storage medium, and a terminal device, so as to reduce uncertainty in a user's selection of a site.
In order to achieve the above object, the embodiment of the present application provides the following technical solutions:
In a first aspect, there is provided an information processing method including:
Acquiring an n-degree vein relation between at least part of users joining the reserved site and the target user; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
And if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user.
In a second aspect, there is provided an information processing apparatus comprising:
The acquisition module is used for acquiring the n-degree vein relation between at least part of users joining the reserved places and the target users; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
And the display module is used for displaying the reservation information of the reserved place to the target user if the n-degree vein relation between at least one user and the target user meets the preset condition, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user.
In a third aspect, a terminal device is provided, comprising a memory and a processor;
The memory is used for storing programs;
the processor is configured to execute the program to implement the steps of the information processing method according to any one of the above.
In a fourth aspect, there is provided a readable storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor, implements the steps of the information processing method according to any of the preceding claims.
The information processing method, the information processing device, the readable storage medium and the terminal equipment provided by the embodiment of the application acquire the n-degree vein relation between at least part of users added in the reserved places and target users; and if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user. By showing the n-degree humane relationship between at least one user joining the reserved site and the target user to the target user, the certainty factor of the site is increased, and the uncertainty factor is reduced, so that the target user can know the user condition in the reserved site more clearly, and the target user can be helped to find the site and the partner for the activities in real time and quickly.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present application, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of an implementation of an information processing method according to an embodiment of the present application;
FIG. 2 is an exemplary diagram of a friend relationship chain of a user according to an embodiment of the present application;
FIG. 3 is a flowchart of one implementation of determining the priority of each reserved venue according to the n-degree relationship between the user joining each reserved venue and the target user according to an embodiment of the present application;
FIG. 4 is an example of site booking information presented to a target user according to an embodiment of the present application;
FIG. 5 is an exemplary diagram of site details provided by an embodiment of the present application;
FIG. 6 is a schematic diagram of an information processing apparatus according to an embodiment of the present application;
Fig. 7 is an exemplary diagram of a hardware structure block diagram of a terminal device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The information processing method provided by the embodiment of the application can be applied to electronic equipment, and the electronic equipment can be a desktop computer or portable electronic equipment, such as a notebook computer, a tablet computer, a smart phone and the like.
An implementation flowchart of the information processing method provided by the embodiment of the present application is shown in fig. 1, and may include:
step S11: an n-degree humane relationship of at least some users joining the reserved venue with the target user is obtained.
The users joining the reserved site include at least subscribers of the reserved site, and if other users (referred to as participants for convenience of description) choose to join the reserved site, the users joining the reserved site include: subscribers and participants.
In the embodiment of the application, the n-degree humane relationship between all the users joining the reserved site and the target user can be obtained, and the n-degree humane relationship between part of the users joining the reserved site and the target user can also be obtained.
For example, only the n-degree relationship between subscribers and target users of a reserved site may be obtained; or the n-degree humane relationship of the subscriber and the target user and the n-degree humane relationship of each participant and the target user can be obtained.
The n degree relationship includes: 1-degree friend relation and/or k-degree friend relation, wherein k is a positive integer greater than 1; the friends of the target user are 1-degree friends of the target user; and the k-degree friend of the target user is a friend of the k-1-degree friend of the target user. That is, in the embodiment of the present application, the value of n includes 1 and/or k, where the value of k may also include a plurality of values, and the specific values and number of n and k included in k are determined according to the actual relationship between at least some users joining the reserved sites and the target users.
If at least part of users joining the reserved site are friends of the target user, the obtained n-degree relationship between at least part of users joining the reserved site and the target user only comprises a 1-degree friend relationship.
If the friends of the target user are not included in at least part of the users joining the reserved places, the obtained n-degree relationship between the at least part of the users joining the reserved places and the target user only includes k-degree friend relationship.
If at least part of the users joining the reserved site have friends of both target users and non-target users, the obtained n-degree relationship between the at least part of the users joining the reserved site and the target users comprises a 1-degree relationship and a k-degree relationship.
Optionally, the friend list of each user may be put in a friend pool, when the n-degree relationship between at least some users joining the reserved place and the target user needs to be obtained, the friend list of the target user may be obtained from the friend pool, the friends of the target user are 1-degree friends of the target user, then the friend list of the 1-degree friends of the target user is obtained from the friend pool, among the friends of the 1-degree friends of the target user, other friends are two-degree friends of the target user, and so on, by obtaining the friend list of the k-1-degree friends of the target user, the k-degree friends of the target user may be determined.
For example, as shown in fig. 2, an example diagram of a friend relationship chain of 10 users of users a-J provided in an embodiment of the present application is assumed that friends of user a include B, C, D, E four users, friends of user B include C, F, G three users, friends of user G include H, I, J, F four users, B, C, D, E is a1 degree friend of a, F, G is a2 degree friend of a, and H, I, J is a3 degree friend of a.
Step S12: and if the n-degree vein relation between at least one user of the at least part of users and the target user meets the preset condition, displaying reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user.
Optionally, the meeting the preset condition by the n-degree vein relation between the at least one user and the target user may include: for each of the at least one user, the corresponding n value is less than a threshold value. For example, assuming that the threshold is 6, there are currently 3 users having n-degree context with the target user satisfying the preset condition, where user 1 is an n 1-degree friend of the target user, user 2 is an n 2-degree friend of the target user, and user 3 is an n 3-degree friend of the target user, then n1 is less than 6, n2 is less than 6, and n3 is also less than 6. The values of n1, n2 and n3 may be the same or different.
When the n-degree relationship between the at least one user and the target user is displayed in the reservation information, the at least one user can be displayed according to whether the at least one user is a site reservation user or not. For example, assume that there are A, B, C users joining a reserved venue, where user a is a venue's subscriber. If users A, B, C are friends of the target user, the subscription information displayed may include "A-initiated, 3 friends have joined". If A is the 2-degree friend of the target user (assuming A is the friend of the friend A1 of the target user) and B, C is the friend of the target user, the displayed subscription information may include "friend initiation of A1, 2 friends have joined"
Further, when receiving the user triggered site detail display instruction, the detailed information of the at least one user, such as a head portrait, an identification mark, and the like, may be displayed in the site detail.
The information processing method provided by the application is used for acquiring the n-degree vein relation between at least part of users added in the reserved places and the target users; and if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying reservation information of the reserved site to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user. By showing the n-degree humane relationship between at least one user joining the reserved site and the target user to the target user, the certainty factor of the site is increased, and the uncertainty factor is reduced, so that the target user can know the user condition in the reserved site more clearly, and the target user can be helped to find the site and the partner for the activities in real time and quickly.
In an alternative embodiment, when there are a plurality of reserved sites for which reservation information can be presented to the target user, the priority of each reserved site may be determined according to the n-degree relationship between the user joining each reserved site and the target user.
In the embodiment of the application, the higher the priority of the reserved place is, the higher the familiarity of the user joining the reserved place and the target user is, or the familiarity of the user and the target user is easier.
And displaying the reservation information of the reserved sites to the target user according to the order of the priority from high to low.
By determining the priority and displaying reservation information of reserved sites to the target user according to the priority, the user is helped to select the sites more quickly.
In an alternative embodiment, one implementation of determining the priority of each reserved site according to the n-degree context of the user joining each reserved site and the target user may be:
and determining the priority of each reserved site according to the n-degree relationship between the site subscribers and the target users in the users joining each reserved site, wherein the smaller n is, the higher the priority of the reserved site is represented.
In the embodiment of the application, the priority of the reserved places is determined only by using the n-degree relationship between the place subscribers and the target users.
In an alternative embodiment, if the priorities of at least two reserved sites are determined to be the same according to the n-degree context relationship between the site subscribers and the target user, the priorities of the at least two reserved sites may be determined according to the n-degree context relationship between the non-subscribers (i.e., participants) among the users joining the at least two reserved sites and the target user.
Optionally, the number of people meeting the preset condition in the n-degree vein relation with the target user in the users belonging to the non-subscriber added to the reserved places can be counted corresponding to each reserved place in the at least two reserved places, or the minimum value of n meeting the preset condition in the users meeting the n-degree vein relation with the target user is determined; the higher the number of people or the smaller the minimum value of n, the higher the priority of the reserved places.
For example, assume that friends A and B of the target user have reserved a lot, respectively, where A reserved lot 1 and B reserved lot 2, and the users who have joined lot 1 have: a1, A2 and A3, wherein the n-degree vein relation between A1 and A2 and the target user meets the preset condition, and the users who have added to the site 2 are as follows: b1, B2, B3 and B4, wherein only the n-degree vein relation between B1 and the target user meets the preset condition. In this example, since both A and B are friends of the target user, the priority of site 1 and site 2 is determined to be the same based on the n-degree context of the site subscriber and the target user. At this time:
The number of people meeting the preset condition in relation to the n-degree veins of the target user among the users belonging to the non-site subscribers can be counted, and the priorities of the two sites are determined according to the number of people, in the example, the number of people counted by the site 1 is 2, the number of people counted by the site 2 is 1, and then the priority of the site 1 is higher than that of the site 2.
Or alternatively
Determining the minimum value of n of the n-degree humane relation with the target user in the users meeting the preset conditions, and assuming that in A1 and A2, A1 is A2-degree friend of the target user, A2 is a 3-degree friend of the target user and user B1 is A1-degree friend of the target user, wherein the minimum value of n of the n-degree humane relation with the target user in the users meeting the preset conditions in the field 1 is 2, and the minimum value of n of the n-degree humane relation with the target user in the users meeting the preset conditions in the field 2 is 1, so that the priority of the field 2 is higher than that of the field 1.
In an alternative embodiment, if the priorities of at least two reserved places are determined to be the same according to the n-degree context relationship between the place subscriber and the target user, the priorities of the at least two reserved places may be determined based on the interaction frequency of the place subscriber and the target user or the m (m < n) degree friends of the target user. Optionally:
if the site subscriber is a 1-degree friend of the target user, namely n=1, determining the priority of at least two reserved sites according to the interaction frequency of the site subscriber and the target user; wherein, the higher the interaction frequency of the site subscriber and the target user, the higher the priority of the site subscribed by the site subscriber.
If the site subscriber is a non-1 degree friend of the target user, that is, n >1, the priorities of the at least two reserved sites may be determined according to the interaction frequency of the site subscriber and the m degree friend of the target user. The m-degree friends of the target user are 1-degree friends of the site subscriber. The higher the interaction frequency of the site subscriber with the m-degree friends of the target user, the higher the priority of the site to which the site subscriber subscribes.
For example, assuming that friend A1 of friend a of the target user reserved venue 3 and friend B1 of friend B of the target user reserved venue 4, since both A1 and B1 are 2 degree friends of the target user, the priorities of venue 3 and venue 4 are determined to be the same based on the n degree context of the venue subscriber and the target user. At this time:
the interaction frequency P1 between A1 and a and the interaction frequency P2 between B and B can be obtained, if P1 is greater than P2, the priority of the site 3 is higher than the priority of the site 4, and if P2 is greater than P1, the priority of the site 4 is higher than the priority of the site 3.
In an alternative embodiment, a flowchart of an implementation of determining the priority of each reserved site according to the n-degree context of the user joining each reserved site and the target user is shown in fig. 3, and may include:
Step S31: and counting the number of people meeting the preset condition in the n-degree relationship with the target user among the users joining the reserved sites corresponding to each reserved site in the plurality of reserved sites.
Step S32: determining the priority of reserved places according to the number of people counted; the greater the number of people, the higher the priority of characterizing the corresponding reserved venue.
For example, assume that users A and B have reserved a lot, respectively, where A reserved lot 1 and B reserved lot 2, and that users who have joined lot 1 have: a1, A2 and A3, wherein the relation between A and A2 and n-degree veins of a target user meets preset conditions, and the users who have joined in the site 2 are as follows: b1, B2, B3 and B4, wherein the n-degree vein relation between the B1, B2 and B3 and the target user meets the preset condition. In this example, the number of people meeting the preset condition in the n-degree vein relation with the target user among the users added to the venue 1 is 2, and the number of people meeting the preset condition in the n-degree vein relation with the target user among the users added to the venue 2 is 3, and the priority of the venue 2 is higher than that of the venue 1.
Further, if the priorities of at least two sites are determined to be the same according to the number of people, the priorities of the sites can be determined according to the n-degree relationship between the site subscribers and the target users among the users joining each of the sites.
For example, assume that users A and B have reserved a lot, respectively, where A reserved lot 1 and B reserved lot 2, and that users who have joined lot 1 have: a1, A2 and A3, wherein the n-degree vein relation between A, A and A2 and the target user meets the preset condition, and the users who have added to the site 2 are as follows: b1, B2, B3 and B4, wherein the n-degree vein relation between the B1, B2 and B3 and the target user meets the preset condition. In this example, the number of people with the n-degree vein relation with the target user in the user added to the site 1 is 3, and the number of people with the n-degree vein relation with the target user in the user added to the site 2 is also 3, so that the priorities of the site 1 and the site 2 are the same, at this time, the priorities of the two sites can be determined according to the n-degree vein relation between the site subscriber and the target user, in this example, the n-degree vein relation between the A and the target user satisfies the preset condition, and the n-degree vein relation between the B and the target user does not satisfy the preset condition, where the priority of the site 1 is higher than the priority of the site 2. Or if the n-degree vein relations between A and B and the target user meet the preset condition, the smaller the value of n of the n-degree vein relation between the A and the target user is, the higher the priority of the corresponding site is, for example, if A is a 1-degree friend of the target user and B is a 2-degree friend of the target user, the priority of the site 1 is higher than the priority of the site 2.
As shown in fig. 4, an example of site subscription information presented to a target user is provided in an embodiment of the present application, where the target user is presented with subscription information of 4 subscribed sites. Wherein, the "Yue Fu Zhang secondary B basketball court 13 number field" is initiated by the friend crystal of the target user, and the field has 3 friends of the target user to join. "Yuan Fu last period A movie theatre" is initiated by friends of the target user who have good friends, i.e. 2-degree friends of the target user. The "yue yu fu go to the first-period football field" is initiated by 3-degree friends of the friend kang of the target user, namely, 4-degree friends of the target user. "Yue Ruan Suo second badminton court No. 13" is initiated by 5 degree friends of the target user's friend crystal, i.e. 6 degree friends of the target user. For each reserved venue, a "join" entry is provided that can be clicked to join the venue. In addition, if the target user clicks on a corresponding position of a reserved site, a detailed information display instruction can be triggered to be generated, and detailed information related to the site can be displayed based on the instruction. As shown in fig. 5, after the target user clicks the display area of "yue fu shang bi-span basketball court 13", an exemplary diagram of the detailed information of the displayed court is shown, in this example, the head portraits and identification marks of all friends (jingjingkang and Diff) of the target user in the court are displayed in the detailed information, and are not shown of the friends. After the target user selects to join, prompt information for prompting the user to join successfully is displayed, and the relationship between the user joining the site and the target user is displayed, wherein the displayed information is 6 people joining and 3 friends.
Corresponding to the method embodiment, the application also provides an information processing device, and a schematic structural diagram of the information processing device provided by the application is shown in fig. 6, which may include:
An acquisition module 61 and a display module 62; wherein,
The obtaining module 61 is configured to obtain an n-degree relationship between at least some users joining the reserved site and the target user; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
The display module 62 is configured to display, to the target user, reservation information of the reserved site if the n-degree context between the at least one user and the target user satisfies a preset condition, where the reservation information includes the n-degree context between the at least one user and the target user.
The information processing device provided by the application acquires the n-degree vein relation between at least part of users joining in a reserved place and target users; and if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user. By showing the n-degree humane relationship between at least one user joining the reserved site and the target user to the target user, the certainty factor of the site is increased, and the uncertainty factor is reduced, so that the target user can know the user condition in the reserved site more clearly, and the target user can be helped to find the site and the partner for the activities in real time and quickly.
In an alternative embodiment, the presentation module 62 may include:
The determining unit is used for determining the priority of each reserved place according to the n-degree humane relationship between the user joining each reserved place and the target user if reservation information of a plurality of reserved places can be displayed to the target user;
And the display unit is used for displaying the reservation information of the reserved sites to the target user according to the order of the priority from high to low.
In an alternative embodiment, the determining unit may be specifically configured to:
And determining the priority of each reserved site according to the n-degree relationship between site subscribers in the users joining each reserved site and the target user, wherein the smaller n is, the higher the priority of each reserved site is represented.
In an alternative embodiment, the determining unit may be further adapted to:
If the priorities of at least two reserved sites are the same according to the n-degree humane relationship between the site subscribers and the target user, determining the priorities of the at least two reserved sites according to the n-degree humane relationship between the non-subscribers in the users joining the at least two reserved sites and the target user.
In an alternative embodiment, the determining unit may be further adapted to:
When it is determined that the priorities of at least two reserved places are the same according to the n-degree humane relationship between the place reservation person and the target user,
If n is 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the target user;
If n is greater than 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the m-degree friends of the target user; m is smaller than n.
In an alternative embodiment, the determining unit is specifically configured to: counting the number of people meeting the preset condition in the n-degree relationship with the target user among the users added to each reserved site corresponding to each reserved site; determining the priority of reserved places according to the number of people counted; the greater the number of people, the higher the priority of characterizing the corresponding reserved venue.
Corresponding to the method embodiment, the embodiment of the application also provides a terminal device, and the terminal device can be configured with the information processing device. An example diagram of a hardware structure block diagram of a terminal device provided by an embodiment of the present application is shown in fig. 7, and may include:
A processor 1, a communication interface 2, a memory 3 and a communication bus 4;
wherein the processor 1, the communication interface 2 and the memory 3 complete the communication with each other through the communication bus 4;
alternatively, the communication interface 2 may be an interface of a communication module, such as an interface of a GSM module;
the processor 1 may be a central processing unit CPU, or an Application-specific integrated Circuit ASIC (Application SPECIFIC INTEGRATED Circuit), or one or more integrated circuits configured to implement embodiments of the present application.
The memory 3 may comprise a high-speed RAM memory or may further comprise a non-volatile memory, such as at least one disk memory.
The processor 1 is specifically configured to execute a program stored in the memory, and execute the following steps:
Acquiring an n-degree vein relation between at least part of users joining the reserved site and the target user; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
And if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user.
Alternatively, the refinement function and the extension function of the program may be described with reference to the above.
The embodiment of the present application also provides a readable storage medium storing a program adapted to be executed by a processor, the program being configured to:
Acquiring an n-degree vein relation between at least part of users joining the reserved site and the target user; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
And if the n-degree vein relation between at least one user and the target user meets the preset condition, displaying the reservation information of the reserved place to the target user, wherein the reservation information comprises the n-degree vein relation between the at least one user and the target user.
Alternatively, the refinement function and the extension function of the program may be described with reference to the above.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (12)
1. An information processing method, characterized by comprising:
Acquiring an n-degree vein relation between at least part of users joining the reserved site and the target user; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, k being an integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
if the n-degree humane relationship between at least one user and the target user meets the preset condition, displaying the booking information of the booked place to the target user, wherein the booking information comprises the n-degree humane relationship between the at least one user and the target user, and the n-degree humane relationship between the at least one user and the target user meets the preset condition and comprises the following steps: for each of the at least one user, the corresponding n value is less than a threshold value;
If there are a plurality of reserved sites, the method for displaying the reserved sites to the target user includes:
Determining the priority of each reserved site according to the n-degree relationship between the user joining each reserved site and the target user;
And displaying the reservation information of the reserved sites to the target user according to the order of the priority from high to low.
2. The method of claim 1, wherein said prioritizing each reserved venue based on n-degree humane relationships of users joining each reserved venue with the target user comprises:
And determining the priority of each reserved site according to the n-degree relationship between site subscribers in the users joining each reserved site and the target user, wherein the smaller n is, the higher the priority of each reserved site is represented.
3. The method as recited in claim 2, further comprising:
If the priorities of at least two reserved sites are the same according to the n-degree humane relationship between the site subscribers and the target user, determining the priorities of the at least two reserved sites according to the n-degree humane relationship between the non-subscribers in the users joining the at least two reserved sites and the target user.
4. The method as recited in claim 2, further comprising:
When it is determined that the priorities of at least two reserved places are the same according to the n-degree humane relationship between the place reservation person and the target user,
If n is 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the target user;
If n is greater than 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the m-degree friends of the target user; m is smaller than n.
5. The method of claim 1, wherein said prioritizing each reserved venue based on n-degree humane relationships of users joining each reserved venue with the target user comprises:
Counting the number of people meeting the preset condition in the n-degree relationship with the target user among the users added to each reserved site corresponding to each reserved site;
Determining the priority of reserved places according to the number of people counted; the greater the number of people, the higher the priority of characterizing the corresponding reserved venue.
6. An information processing apparatus, characterized by comprising:
the acquisition module is used for acquiring the n-degree vein relation between at least part of users joining the reserved places and the target users; the n-degree human relationship includes: 1-degree friend relation and/or k-degree friend relation, wherein k is a positive integer greater than 1; the friends of the target user are 1-degree friends of the target user; the k-degree friends of the target user are friends of the k-1-degree friends of the target user;
The display module is configured to display reservation information of the reserved site to the target user if the n-degree context of the at least one user and the target user satisfies a preset condition, where the reservation information includes the n-degree context of the at least one user and the target user, and the n-degree context of the at least one user and the target user satisfies the preset condition includes: for each of the at least one user, the corresponding n value is less than a threshold value;
wherein, the show module includes:
The determining unit is used for determining the priority of each reserved place according to the n-degree humane relationship between the user joining each reserved place and the target user if reservation information of a plurality of reserved places can be displayed to the target user;
And the display unit is used for displaying the reservation information of the reserved sites to the target user according to the order of the priority from high to low.
7. The apparatus according to claim 6, wherein the determining unit is specifically configured to:
And determining the priority of each reserved site according to the n-degree relationship between site subscribers in the users joining each reserved site and the target user, wherein the smaller n is, the higher the priority of each reserved site is represented.
8. The apparatus of claim 7, wherein the determining unit is further configured to:
If the priorities of at least two reserved sites are the same according to the n-degree humane relationship between the site subscribers and the target user, determining the priorities of the at least two reserved sites according to the n-degree humane relationship between the non-subscribers in the users joining the at least two reserved sites and the target user.
9. The apparatus of claim 7, wherein the determining unit is further configured to:
When it is determined that the priorities of at least two reserved places are the same according to the n-degree humane relationship between the place reservation person and the target user,
If n is 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the target user;
If n is greater than 1, determining the priority of the at least two reserved sites according to the interaction frequency of the site subscribers and the m-degree friends of the target user; m is smaller than n.
10. The apparatus according to claim 6, wherein the determining unit is specifically configured to: counting the number of people meeting the preset condition in the n-degree relationship with the target user among the users added to each reserved site corresponding to each reserved site; determining the priority of reserved places according to the number of people counted; the greater the number of people, the higher the priority of characterizing the corresponding reserved venue.
11. A terminal device comprising a memory and a processor;
The memory is used for storing programs;
The processor is configured to execute the program to implement the respective steps of the information processing method according to any one of claims 1 to 5.
12. A readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the information processing method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910754938.5A CN111178564B (en) | 2019-08-15 | 2019-08-15 | Information processing method, information processing device, readable storage medium and terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910754938.5A CN111178564B (en) | 2019-08-15 | 2019-08-15 | Information processing method, information processing device, readable storage medium and terminal equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111178564A CN111178564A (en) | 2020-05-19 |
| CN111178564B true CN111178564B (en) | 2024-05-03 |
Family
ID=70653658
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910754938.5A Active CN111178564B (en) | 2019-08-15 | 2019-08-15 | Information processing method, information processing device, readable storage medium and terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111178564B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101324879A (en) * | 2008-07-31 | 2008-12-17 | 崔高 | Website system and method for implementing share of relationship among persons |
| CN104639662A (en) * | 2015-03-13 | 2015-05-20 | 重庆动美网络科技有限公司 | Sports field booking system based on internet and booking treatment method thereof |
| CN107395743A (en) * | 2017-08-16 | 2017-11-24 | 维沃移动通信有限公司 | A kind of information processing method and mobile terminal |
| CN108337152A (en) * | 2017-12-15 | 2018-07-27 | 上海易点时空网络有限公司 | Multistage relationship among persons task is sought help processing method and server |
-
2019
- 2019-08-15 CN CN201910754938.5A patent/CN111178564B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101324879A (en) * | 2008-07-31 | 2008-12-17 | 崔高 | Website system and method for implementing share of relationship among persons |
| CN104639662A (en) * | 2015-03-13 | 2015-05-20 | 重庆动美网络科技有限公司 | Sports field booking system based on internet and booking treatment method thereof |
| CN107395743A (en) * | 2017-08-16 | 2017-11-24 | 维沃移动通信有限公司 | A kind of information processing method and mobile terminal |
| CN108337152A (en) * | 2017-12-15 | 2018-07-27 | 上海易点时空网络有限公司 | Multistage relationship among persons task is sought help processing method and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111178564A (en) | 2020-05-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10742574B2 (en) | Method and device for implementing instant communication | |
| US8655385B2 (en) | Social networking methods and apparatus for use in facilitating participation in user-relevant social groups | |
| WO2014186074A1 (en) | Generating a playlist based on content meta data and user parameters | |
| US20160335599A1 (en) | Systems and methods for exchanging information | |
| US20160162601A1 (en) | Interface for context based communication management | |
| CN113365086B (en) | Live data interaction method and device, electronic equipment, server and storage medium | |
| CN105338154B (en) | A kind of contact sequencing method, device and terminal | |
| WO2012070571A1 (en) | Management device for sns supervision site, and information disclosure method using sns supervision site | |
| WO2017185644A1 (en) | Method and device for adjusting confrontation progress bar according to number of supporters | |
| US20150317570A1 (en) | Schedule adjustment device, schedule adjustment method, and schedule adjustment program | |
| CN111178564B (en) | Information processing method, information processing device, readable storage medium and terminal equipment | |
| Hatcher et al. | The IIS–32: A brief inventory of interpersonal strengths | |
| TWI522939B (en) | Events integrating method andsystem | |
| CN108786117A (en) | A kind of mobile phone games player group technology, device and server | |
| KR20160149020A (en) | Method and system for reserving golf games | |
| JP5821460B2 (en) | AC support server apparatus, AC support system, and AC support server program | |
| US20180082265A1 (en) | Generating activity suggestions to assist user in maintaining work-life balance | |
| JP2008295985A (en) | Golf community system using internet | |
| CN105814904B (en) | Media resource sharing method and equipment | |
| US11386172B1 (en) | Apparatus and method for matching individuals based upon a commitment disposition criterion | |
| CN114691975A (en) | Activity recommendation method, device, storage medium and apparatus | |
| CN108924953A (en) | A kind of management method and device of AP | |
| US20160261985A1 (en) | Mobile smart phone device based system and method for facilitating the meeting of two or more geographically nearby located people interested in synchronously performing a social networking activity | |
| CN114500846B (en) | Live action viewing angle switching method, device, equipment and readable storage medium | |
| US20170308867A1 (en) | Application program providing student athlete sporting event calendaring and player information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |