CN103166930B - The method and system of pushing network information - Google Patents

The method and system of pushing network information Download PDF

Info

Publication number
CN103166930B
CN103166930B CN201110421190.0A CN201110421190A CN103166930B CN 103166930 B CN103166930 B CN 103166930B CN 201110421190 A CN201110421190 A CN 201110421190A CN 103166930 B CN103166930 B CN 103166930B
Authority
CN
China
Prior art keywords
network
user
good friend
likability
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201110421190.0A
Other languages
Chinese (zh)
Other versions
CN103166930A (en
Inventor
丁江伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN201110421190.0A priority Critical patent/CN103166930B/en
Publication of CN103166930A publication Critical patent/CN103166930A/en
Application granted granted Critical
Publication of CN103166930B publication Critical patent/CN103166930B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Transfer Between Computers (AREA)

Abstract

A method for pushing network information, comprises the following steps: obtain the good friend in the friend relation chain of user and friend relation chain; Obtain the cohesion between described user and good friend; Obtain the business likability of the good friend of described user; The expectation likability of described user to Network is calculated according to described cohesion and described business likability; The network information relevant to described Network is pushed to described user according to described expectation likability.The method of above-mentioned pushing network information, can the potential demand of effective digging user, can improve the probability that user accepts the Network that the network information is recommended, thus improve the success rate of network information recommendation network business.A kind of system of pushing network information is provided in addition.

Description

The method and system of pushing network information
[technical field]
The present invention relates to networking technology area, relate to a kind of method and system of pushing network information especially.
[background technology]
Along with the development of network technology and the growth of user's request, various Network emerges in an endless stream, and business development business pushes the network information relevant to Network by the Internet to user, propagates and promote Network with this.
The method of traditional pushing network information, when Network promoted by needs, then push the relevant network information of this Network with certain information format to the all-network user in certain territorial scope, and upgrade according to the cycle of presetting or frequency the network information pushed.
The method of traditional pushing network information, owing to pushing the relevant network information of Network according to regular time, fixing mode to user, its poor effect received, the probability that user accepts the Network that the network information is recommended is not high, and namely the success rate of network information recommendation network business is not high yet.
[summary of the invention]
Based on this, be necessary that providing a kind of can improve the method that the pushing network information of success rate is recommended in Network.
A method for pushing network information, comprises the following steps:
Obtain the good friend in the friend relation chain of user and friend relation chain;
Obtain the cohesion between described user and good friend;
Obtain the business likability of the good friend of described user;
The expectation likability of described user to Network is calculated according to described cohesion and described business likability;
The network information relevant to described Network is pushed to described user according to described expectation likability.
Preferably, the step of the cohesion between the described user of described acquisition and good friend comprises:
Obtain the network interaction record between user and good friend and/or personal information;
The cohesion between described user and good friend is calculated according to described network interaction record and/or personal information.
Preferably, the step of the business likability of the good friend of described acquisition user comprises:
Obtain the good friend of user to the operation note of Network;
The business likability of the good friend of user is calculated according to described operation note.
Preferably, described operation note comprises the combination of one or more in log-on message, read-write record, evaluation information.
Preferably, the described step pushing the network information relevant to described Network to described user according to described expectation likability comprises:
Network is sorted to the expectation likability order from high to low of Network according to described user;
The network information relevant to the Network of the forward predetermined number that sorts is pushed to described user.
Preferably, described method also comprises:
Obtain the feedback information of described user to the network information pushed;
Resequence according to the Network to be recommended of described feedback information to described user.
Based on this, there is a need to provide a kind of and can improve the system that the pushing network information of success rate is recommended in Network.
A system for pushing network information, comprising:
Good friend's acquisition module, the good friend in the friend relation chain that obtains user and friend relation chain;
Cohesion acquisition module, for obtaining the cohesion between described user and good friend;
Likability acquisition module, for obtaining the business likability of the good friend of described user;
Expect likability computing module, for calculating the expectation likability of described user to Network according to described cohesion and described business likability;
Info push module, for pushing the network information relevant to described Network according to described expectation likability to described user.
Preferably, described cohesion acquisition module comprises:
Cohesion relevant information acquisition module, for obtaining network interaction record between user and good friend and/or personal information;
Cohesion computing module, for calculating the cohesion between described user and good friend according to described network interaction record and/or personal information.
Preferably, described likability acquisition module comprises:
Operation note acquisition module, for obtaining the operation note of good friend to Network of user;
Likability computing module, for calculating the good friend of user to the likability of Network according to described operation note.
Preferably, described operation note comprises the combination of one or more in log-on message, read-write record, evaluation information.
Preferably, described info push module comprises:
Order module, for sorting Network to the expectation likability order from high to low of Network according to described user;
Pushing module, pushes the network information relevant to the Network of the forward predetermined number that sorts to described user.
Preferably, described system also comprises:
Feedback information acquisition module, for obtaining the feedback information of described user to the network information pushed;
Described order module is also for resequencing according to the Network to be recommended of described feedback information to described user.
The method and system of above-mentioned pushing network information, according to the business likability of the good friend of the cohesion between user and good friend and user, obtain the expectation likability of user to Network, and expect that likability pushes the network information relevant to Network to user according to this.Because the hobby between the user that cohesion is high is likely similar, if user good friend buddy-buddy is very high to the likability of certain Network, then this user also may be interested in this Network, so adopt aforesaid way to push the relevant network information of the interested Network of its good friend to user, can the potential demand of effective digging user, the probability that user accepts the Network that the network information is recommended can be improved, thus improve the success rate of network information recommendation network business.
[accompanying drawing explanation]
Fig. 1 is the schematic flow sheet of the method for pushing network information in an embodiment;
Fig. 2 is the schematic flow sheet of acquisition user in an embodiment and the cohesion between good friend;
Fig. 3 is the schematic flow sheet of the business likability of the good friend of acquisition user in an embodiment;
Fig. 4 is the schematic flow sheet pushing the network information relevant to Network according to expectation likability to user in an embodiment;
Fig. 5 is the interface schematic diagram of the network information to user's propelling movement in an embodiment;
Fig. 6 is the structural representation of the system of pushing network information in an embodiment;
Fig. 7 is the structural representation of the cohesion acquisition module in an embodiment;
Fig. 8 is the structural representation of the likability acquisition module in an embodiment;
Fig. 9 is the structural representation of the info push module in an embodiment;
Figure 10 is the structural representation of the system of pushed information in another embodiment.
[embodiment]
As shown in Figure 1, in one embodiment, a kind of method of pushing network information, comprises the following steps:
Step S10, obtains the good friend in the friend relation chain of user and friend relation chain.
In Web Community, user can set up friend relation with other users one or more, and namely other users being friend relation with user form the friend relation chain of user.The friend relation chain of user stores in a database with the form of the buddy list corresponding with user ID.In the present embodiment, the buddy list of user can be obtained by the friend relation chain obtaining user, obtain the good friend in the friend relation chain of user further.It should be noted that user and good friend are relative relations, the good friend of user is also user in Web Community.
Step S20, obtains the cohesion between user and good friend.
As shown in Figure 2, in one embodiment, step S20 comprises the following steps:
Step S202, obtains the network interaction record between user and good friend and/or personal information.
Concrete, network interaction record comprises the access of the instant messaging record of the request of the network information between user and good friend and response record, voice or word, intercommunication mail record and the network information and review record etc.Preferably, personal information comprises the information such as age, school, educational background, specialty, address, hobby of user.
Step S204, calculates the cohesion between user and good friend according to network interaction record and/or personal information.
In one embodiment, can according to the cohesion between the network interaction record calculating user between user and good friend and good friend.Concrete, can the network interaction frequency between counting user and good friend, mutual duration etc., and the cohesion arranged between user and good friend is the increasing function of its network interaction frequency and duration, the numerical value of the network interaction frequency namely between user and good friend, mutual duration is larger, then the cohesion between user and good friend is higher.
In one embodiment, cohesion between user and good friend can be calculated according to the personal information of the personal information of user and good friend.Concrete, can similarity between the personal information of counting user and the personal information of good friend, and the cohesion arranged between user and good friend is the increasing function of the similarity of the personal information of user and good friend.
In another embodiment, cohesion between user and good friend can be calculated according to the personal information of the personal information of the network interaction record between user and good friend and user and good friend.Concrete, can similarity between the personal information of the network interaction frequency between comprehensive statistics user and good friend and duration and user and the personal information of good friend, and the cohesion arranged between user and good friend is the increasing function of the network interaction frequency, duration and personal information similarity.
Preferably, in one embodiment, relation chain storehouse can be pre-set, after calculating the cohesion between user and good friend, this cohesion is stored in relation chain storehouse, and can relation chain storehouse be upgraded timing.
Step S30, obtains the business likability of the good friend of user.Concrete, the business likability of the good friend of user and the good friend of user are to the likability of Network.
As shown in Figure 3, in one embodiment, step S30 comprises the following steps:
Step S302, obtains the good friend of user to the operation note of Network.
Concrete, the operation of user to Network comprises registration operation, read operation and write operation.Such as, registration is operating as the operation that user registers some Networks, as submitted registration request to, filling registration information etc.; Read operation is the operation that the network information such as daily record, photograph album that user checks its good friend and delivers is carried out; Write operation then submits the operation of the network informations such as daily record, photograph album, comment to for user.Further, the good friend of user is obtained to the number of operations of Network and/or operation duration.
Step S304, calculates the business likability of the good friend of user according to aforesaid operations record.
Concrete, can according to the good friend of user to the good friend of the number of operations of Network and/or operation duration recording user to the likability of Network.Accordingly, if the good friend of user to the number of operations of Network and/or operation duration larger, then the business likability that can arrange the good friend of user is higher.
Preferably, in one embodiment, customer service storehouse can be pre-set, the business likability of the good friend of the user calculated is stored in customer service storehouse.As mentioned above, because user and good friend are relative relations, customer service storehouse actual storage be the business likability of all users.
Step S40, calculates user to the expectation likability of Network according to the business likability of the good friend of the cohesion between user and good friend and user.
Concrete, expect that likability is to the prediction index of user to the potential likability of Network.Because the hobby between more intimate good friend may be more similar, therefore, the expectation likability of user to Network can be calculated according to the business likability of user and the cohesion of good friend and the good friend of user; The business likability of good friend to Network of user is higher and user and this good friend cohesion is higher, then the expectation likability of user to this Network is higher.
Preferably, in one embodiment, the expectation likability of user to Network is calculated as follows:
Expect F a = Σ i friendNum C i * F ai
Wherein, ExpectF arepresent that user is to the expectation likability of Network a, friendNum represents good friend's number of user, C irepresent the cohesion between user and its i-th good friend, F airepresent that this i-th good friend is to the business likability of Network a.
In one embodiment, the user calculated can be stored to customer service storehouse, to upgrade customer service storehouse, and for calculating the expectation likability of user to Network next time to the expectation likability of Network as the business likability of user.
Step S50, pushes the network information relevant to Network according to above-mentioned expectation likability to user.
As shown in Figure 4, in one embodiment, step S50 comprises the following steps:
Step S502, sorts Network to the expectation likability order from high to low of Network according to user.
Step S504, pushes the network information relevant to the Network of the forward predetermined number of sequence to user.
In one embodiment, preset the network information relevant to Network, during pushing network information, then direct by the network information push that presets to user.In another embodiment, go back dynamic and the network information is set, the personal information of the good friend of user is joined in the network information and is pushed to user together.Such as, as shown in Figure 5, name Andy, Ben of the good friend of user are joined in the network information pushed to user.In the present embodiment, because the personal information of the good friend by user also joins in the network information, the attention rate of user can be improved further, thus improve the success rate that user accepts the Network that the network information is recommended further.
In one embodiment, in the network information relevant to Network of user's propelling movement, also can comprise the link information (as shown in Figure 5) of this Network.User directly clicks the page that this link just can enter into this Network, user friendly operation.
In an example, the method for above-mentioned pushing network information also comprises step: obtain the feedback information of user to the network information pushed, resequence according to the Network to be recommended of feedback information to user.
Concrete, the broadcasting frequency of the network information, user can be obtained to the clicking rate of the network information, and user is to the operation note of the Network that the network information is correlated with, if user is to the registration, login record, Visitor Logs, write operation record etc. of Network.
In one embodiment, if the broadcasting frequency of the network information exceedes default threshold value, the Network then this network information can be correlated with is discharged in the Network queue to be recommended of user backward, because if continue again to push the relevant network information of this Network to user, then may cause invasion to user.Accordingly, if the Network that user is relevant to the network information pushed adds operation note, as registration, login or access etc., then also this Network can be discharged in the Network queue to be recommended of user backward, because the Network that the network information pushed successfully has made user receive this network information recommends, then the relevant information of this Network can push to user after some cycles again.
The method of above-mentioned pushing network information, by according to user to the feedback information of the network information pushed, resequence to user's Network to be recommended, the renewable network information relevant to Network pushed to user, thus can further improve the success rate pushing the Network relevant to the network information, and reduce the invasion to user.
As shown in Figure 6, a kind of system of pushing network information, comprises good friend's acquisition module 100, cohesion acquisition module 200, likability acquisition module 300, expects likability computing module 400, info push module 500, wherein:
Good friend's acquisition module 100, the good friend in the friend relation chain that obtains user and friend relation chain.
In Web Community, user can set up friend relation with other users one or more, and namely other users being friend relation with user form the friend relation chain of user.The friend relation chain of user stores in a database with the form of the buddy list corresponding with user ID.In the present embodiment, good friend's acquisition module 100 can obtain the buddy list of user for the friend relation chain by obtaining user, obtains the good friend in the friend relation chain of user further.It should be noted that user and good friend are relative relations, the good friend of user is also user in Web Community.
Cohesion acquisition module 200, for obtaining the cohesion between user and good friend.
As shown in Figure 7, in one embodiment, cohesion acquisition module 200 comprises cohesion relevant information acquisition module 202, cohesion computing module 204, wherein:
Cohesion relevant information acquisition module 202, for obtaining network interaction record between user and good friend and/or personal information.
Concrete, network interaction record comprises the access of the instant messaging record of the request of the network information between user and good friend and response record, voice or word, intercommunication mail record and the network information and review record etc.Preferably, personal information comprises the information such as age, school, educational background, specialty, address, hobby of user.
Cohesion computing module 204, for calculating the cohesion between user and good friend according to network interaction record and/or personal information.
In one embodiment, cohesion computing module 204 can be used for according to the cohesion between the network interaction record calculating user between user and good friend and good friend.Concrete, cohesion computing module 204 can the network interaction frequency, mutual duration etc. between counting user and good friend, and the cohesion arranged between user and good friend is the increasing function of its network interaction frequency and duration.
In one embodiment, cohesion computing module 204 can be used for calculating cohesion between user and good friend according to the personal information of user and the personal information of good friend.Concrete, cohesion computing module 204 can be used for the similarity between the personal information of counting user and the personal information of good friend, and the cohesion arranged between user and good friend is the increasing function of the similarity of the personal information of user and good friend.
In another embodiment, cohesion computing module 204 can be used for calculating cohesion between user and good friend according to the network interaction record between user and good friend and the personal information of user and the personal information of good friend.Concrete, cohesion computing module 204 can be used for the similarity between the personal information of the network interaction frequency between comprehensive statistics user and good friend and duration and user and the personal information of good friend, and the cohesion arranged between user and good friend is the increasing function of the network interaction frequency, duration and personal information similarity.
Preferably, in one embodiment, relation chain storehouse (not shown) can be pre-set, after calculating the cohesion between user and good friend, this cohesion is stored in relation chain storehouse, and can relation chain storehouse be upgraded timing.
Likability acquisition module 300, for obtaining the business likability of the good friend of user.Concrete, the business likability of the good friend of user and the good friend of user are to the likability of Network.
As shown in Figure 8, in one embodiment, likability acquisition module 300 comprises operation note acquisition module 302, likability computing module 304, wherein:
Operation note acquisition module 302, for obtaining the operation note of good friend to Network of user.
Concrete, the operation of user to Network comprises registration operation, read operation and write operation.Such as, registration is operating as the operation that user registers some Networks, as submitted registration request to, filling registration information etc.; Read operation is the operation that the network information such as daily record, photograph album that user checks its good friend and delivers is carried out; Write operation then submits the operation of the network informations such as daily record, photograph album, comment to for user.Further, operation note acquisition module 302 can obtain the good friend of user to the number of operations of Network and/or operation duration.
Likability computing module 304, for calculating the business likability of the good friend of user according to aforesaid operations record.
Concrete, likability computing module 304 can according to the good friend of user to the good friend of the number of operations of Network and/or operation duration recording user to the likability of Network.Accordingly, if the good friend of user to the number of operations of Network and/or operation duration larger, then the business likability that can arrange the good friend of user is higher.
Preferably, in one embodiment, customer service storehouse (not shown) can be pre-set, the business likability of the good friend of the user calculated is stored in customer service storehouse.As mentioned above, because user and good friend are relative relations, customer service storehouse actual storage be the business likability of all users.
Expect likability computing module 400, the business likability for the good friend according to the cohesion between user and good friend and user calculates user to the expectation likability of Network.
Concrete, expect that likability is to the prediction index of user to the potential likability of Network.Because the hobby between more intimate good friend may be more similar, therefore, expect that likability computing module 400 can be used for calculating the expectation likability of user to Network according to the business likability of user and the cohesion of good friend and the good friend of user; The business likability of good friend to Network of user is higher and user and this good friend cohesion is higher, then can to arrange the expectation likability of user to this Network also higher for likability computing module 304.
Preferably, in one embodiment, expect that likability computing module 400 is for being calculated as follows the expectation likability of user to Network:
Expect F a = Σ i friendNum C i * F ai
Wherein, ExpecF arepresent that user is to the expectation likability of Network a, friendNum represents good friend's number of user, C irepresent the cohesion between user and its i-th good friend, F airepresent that this i-th good friend is to the business likability of Network a.
In one embodiment, expect that likability computing module 400 can be used for the user calculated to be stored to customer service storehouse to the expectation likability of Network as the business likability of user, to upgrade customer service storehouse, and for calculating the expectation likability of user to Network next time.
Info push module 500, for pushing the network information relevant to Network according to expectation likability to user.
As shown in Figure 9, in one embodiment, info push module 500 comprises order module 502, pushing module 504, wherein:
Order module 502, for sorting Network to the expectation likability order from high to low of Network according to user.
Pushing module 504, for pushing the network information relevant to the Network of the forward predetermined number of sequence to user.
In one embodiment, pushing module 504 can be used for presetting the network information relevant to Network, during pushing network information, then direct by the network information push that presets to user.In another embodiment, pushing module 504 also can be used for dynamically arranging the network information, the personal information of the good friend of user is joined in the network information and is pushed to user together.Such as, as shown in Figure 5, name Andy, Ben of the good friend of user are joined in the network information pushed to user.In the present embodiment, because the personal information of the good friend by user also joins in the network information, the attention rate of user can be improved further, thus improve the success rate that user accepts the Network that the network information is recommended further.
In one embodiment, in the network information relevant to Network of user's propelling movement, also can comprise the link information (as shown in Figure 5) of this Network.User directly clicks the page that this link just can enter into this Network, user friendly operation.
As shown in Figure 10, in one embodiment, the system of above-mentioned pushed information also comprises:
Feedback information acquisition module 600, for obtaining the feedback information of user to the network information pushed.
Concrete, feedback information acquisition module 600 can obtain the broadcasting frequency of the network information, user to the clicking rate of the network information, and user is to the operation note of the Network that the network information is correlated with, if user is to the registration, login record, Visitor Logs, write operation record etc. of Network.
In the present embodiment, order module 502 is also for resequencing according to the Network to be recommended of above-mentioned feedback information to user.
In one embodiment, if the broadcasting frequency of the network information exceedes default threshold value, the Network that then this network information can be correlated with by order module 502 is discharged in the Network queue to be recommended of user backward, because if continue again to push the relevant network information of this Network to user, then may cause invasion to user.Accordingly, if the Network that user is relevant to the network information pushed adds operation note, as registration, login or access etc., then this Network also can be discharged by order module 502 in the Network queue to be recommended of user backward, because the Network that the network information pushed successfully has made user receive this network information recommends, then the relevant information of this Network can push to user after some cycles again.
The system of above-mentioned pushing network information, by according to user to the feedback information of the network information pushed, resequence to user's Network to be recommended, the renewable network information relevant to Network pushed to user, thus can further improve the success rate pushing the Network relevant to the network information, and reduce the invasion to user.
The method and system of above-mentioned pushing network information, according to the business likability of the good friend of the cohesion between user and good friend and user, obtain the expectation likability of user to Network, and expect that likability pushes the network information relevant to Network to user according to this.Because the hobby between the user that cohesion is high is likely similar, if user good friend buddy-buddy is very high to the likability of certain Network, then this user also may be interested in this Network, so adopt aforesaid way to push the relevant network information of the interested Network of its good friend to user, can the potential demand of effective digging user, the probability that user accepts the Network that the network information is recommended can be improved, thus improve the success rate of network information recommendation network business.
The above embodiment only have expressed several execution mode of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that for the person of ordinary skill of the art, without departing from the inventive concept of the premise, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection range of patent of the present invention should be as the criterion with claims.

Claims (10)

1. a method for pushing network information, comprises the following steps:
Obtain the good friend in the friend relation chain of user and friend relation chain;
Obtain the network interaction record between described user and good friend;
The cohesion between described user and good friend is calculated according to described network interaction record;
Obtain the good friend of user to the operation note of Network;
The business likability of the good friend of user is calculated according to described operation note;
The expectation likability of described user to Network is calculated according to described cohesion and described business likability; The business likability of good friend to described Network of described user is higher and described user and this good friend cohesion is higher, then the expectation likability of described user to described Network is higher;
The network information relevant to described Network is pushed to described user according to described expectation likability.
2. the method for pushing network information according to claim 1, is characterized in that, described calculate the step of the cohesion between described user and good friend according to described network interaction record before also comprise:
Obtain the personal information of user and good friend;
Describedly calculate cohesion between described user and good friend according to described network interaction record, comprising:
The cohesion between described user and good friend is calculated according to described network interaction record and personal information.
3. the method for pushing network information according to claim 1, is characterized in that, described operation note comprises the combination of one or more in log-on message, read-write record, evaluation information.
4. the method for pushing network information as claimed in any of claims 1 to 3, is characterized in that, the described step pushing the network information relevant to described Network to described user according to described expectation likability comprises:
Network is sorted to the expectation likability order from high to low of Network according to described user;
The network information relevant to the Network of the forward predetermined number that sorts is pushed to described user.
5. the method for pushing network information according to claim 4, is characterized in that, described method also comprises:
Obtain the feedback information of described user to the network information pushed;
Resequence according to the Network to be recommended of described feedback information to described user.
6. a system for pushing network information, is characterized in that, comprising:
Good friend's acquisition module, the good friend in the friend relation chain that obtains user and friend relation chain;
Cohesion relevant information acquisition module, for obtaining the network interaction record between user and good friend;
Cohesion computing module, for calculating the cohesion between described user and good friend according to described network interaction record;
Operation note acquisition module, for obtaining the operation note of good friend to Network of user;
Likability computing module, for calculating the business likability of the good friend of user according to described operation note;
Expect likability computing module, for calculating the expectation likability of described user to Network according to described cohesion and described business likability; The business likability of good friend to described Network of described user is higher and described user and this good friend cohesion is higher, then the expectation likability of described user to described Network is higher;
Info push module, for pushing the network information relevant to described Network according to described expectation likability to described user.
7. the system of pushing network information according to claim 6, is characterized in that, described cohesion relevant information acquisition module is also for obtaining the personal information of user and good friend;
Described cohesion computing module is also for calculating the cohesion between described user and good friend according to described network interaction record and personal information.
8. the system of pushing network information according to claim 6, is characterized in that, described operation note comprises the combination of one or more in log-on message, read-write record, evaluation information.
9. according to the system of the pushing network information in claim 6 to 8 described in any one, it is characterized in that, described info push module comprises:
Order module, for sorting Network to the expectation likability order from high to low of Network according to described user;
Pushing module, pushes the network information relevant to the Network of the forward predetermined number that sorts to described user.
10. the system of pushing network information according to claim 9, is characterized in that, described system also comprises:
Feedback information acquisition module, for obtaining the feedback information of described user to the network information pushed;
Described order module is also for resequencing according to the Network to be recommended of described feedback information to described user.
CN201110421190.0A 2011-12-15 2011-12-15 The method and system of pushing network information Active CN103166930B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110421190.0A CN103166930B (en) 2011-12-15 2011-12-15 The method and system of pushing network information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110421190.0A CN103166930B (en) 2011-12-15 2011-12-15 The method and system of pushing network information

Publications (2)

Publication Number Publication Date
CN103166930A CN103166930A (en) 2013-06-19
CN103166930B true CN103166930B (en) 2016-04-13

Family

ID=48589676

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110421190.0A Active CN103166930B (en) 2011-12-15 2011-12-15 The method and system of pushing network information

Country Status (1)

Country Link
CN (1) CN103166930B (en)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104639508A (en) * 2013-11-14 2015-05-20 李�权 Multidimensional information transmission method
CN103580999A (en) * 2013-11-26 2014-02-12 北京中久联科技有限公司 Method and system for processing user information on mobile internet social platform
CN103729771A (en) * 2013-12-31 2014-04-16 腾讯科技(深圳)有限公司 Method and system for displaying user information
CN105635210B (en) * 2014-10-30 2021-04-27 腾讯科技(武汉)有限公司 Network information recommendation method and device and reading system
CN105590232A (en) * 2014-11-11 2016-05-18 中国移动通信集团广东有限公司 Client relation generation method and apparatus, and electronic device
CN104601444B (en) * 2014-12-26 2018-04-13 北京奇虎科技有限公司 A kind of information discloses method and apparatus
CN104579933B (en) * 2015-02-03 2018-05-11 上海卓易科技股份有限公司 A kind of user management method and system
CN104967679B (en) * 2015-06-09 2017-07-21 深圳市腾讯计算机系统有限公司 Information recommendation system, method and device
CN106445909A (en) * 2015-08-10 2017-02-22 北京奇虎科技有限公司 Instant messaging platform-based concerned object pushing method and apparatus
CN106469163A (en) * 2015-08-18 2017-03-01 中兴通讯股份有限公司 A kind of public number recommends method and system
CN105208113A (en) * 2015-08-31 2015-12-30 北京百度网讯科技有限公司 Information pushing method and device
CN105677881B (en) * 2016-01-12 2020-07-03 腾讯科技(深圳)有限公司 Information recommendation method and device and server
CN107545451B (en) * 2016-06-27 2020-11-27 腾讯科技(深圳)有限公司 Advertisement pushing method and device
CN106354822A (en) * 2016-08-30 2017-01-25 五八同城信息技术有限公司 Method and device for acquiring target user
CN106651448A (en) * 2016-12-23 2017-05-10 腾讯科技(深圳)有限公司 Advertisement information sending method, apparatus and system
CN107343030B (en) * 2017-06-19 2020-12-25 北京小米移动软件有限公司 Information pushing method, device and system
CN108650165B (en) * 2018-02-28 2021-10-29 创新先进技术有限公司 Communication data recovery method, device and equipment
CN110210885B (en) * 2018-05-30 2023-05-12 腾讯科技(深圳)有限公司 Method, device, equipment and readable storage medium for mining potential clients
CN109067897B (en) * 2018-08-24 2021-11-09 优视科技新加坡有限公司 Message pushing method and device, equipment/terminal/server and computer readable medium thereof
CN109615494A (en) * 2018-09-29 2019-04-12 阿里巴巴集团控股有限公司 Business derived method, device, electronic equipment and computer readable storage medium
CN110020204B (en) * 2019-03-29 2022-04-19 联想(北京)有限公司 Information processing method and electronic equipment
CN113032625B (en) * 2021-03-25 2023-11-14 腾讯科技(深圳)有限公司 Video sharing method and device, computer equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101079063A (en) * 2007-06-25 2007-11-28 腾讯科技(深圳)有限公司 Method, system and apparatus for transmitting advertisement based on scene information
CN101616356A (en) * 2009-07-31 2009-12-30 卓望数码技术(深圳)有限公司 A kind of wireless data service product information method for pushing and system
CN101694659A (en) * 2009-10-20 2010-04-14 浙江大学 Individual network news recommending method based on multitheme tracing
CN101916286A (en) * 2010-08-23 2010-12-15 宇龙计算机通信科技(深圳)有限公司 Information recommendation method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101079063A (en) * 2007-06-25 2007-11-28 腾讯科技(深圳)有限公司 Method, system and apparatus for transmitting advertisement based on scene information
CN101616356A (en) * 2009-07-31 2009-12-30 卓望数码技术(深圳)有限公司 A kind of wireless data service product information method for pushing and system
CN101694659A (en) * 2009-10-20 2010-04-14 浙江大学 Individual network news recommending method based on multitheme tracing
CN101916286A (en) * 2010-08-23 2010-12-15 宇龙计算机通信科技(深圳)有限公司 Information recommendation method and system

Also Published As

Publication number Publication date
CN103166930A (en) 2013-06-19

Similar Documents

Publication Publication Date Title
CN103166930B (en) The method and system of pushing network information
EP2506522B1 (en) Method and device for pushing data
JP6427159B2 (en) Interacting with spreadsheets using text messages
CN105427129B (en) Information delivery method and system
US9224095B2 (en) System and methods for generating optimal post times for social networking sites
CN103379158A (en) Method and system for recommending friend information in social network
CN103957275A (en) Pushing method, client terminal, server and system for user commenting information
US11030656B2 (en) Media information presentation method, server, and storage medium
CN102460431A (en) System and method for behavioural and contextual data analytics
CN103838814A (en) Method for dynamically displaying contacts diagram relationship
JP2019512764A (en) Method and apparatus for identifying the type of user geographical location
CN104657372A (en) Page operation data processing method and device
CN104461226A (en) Chatting method, device and system used for network
CN105099855A (en) Electronic device and playing and controlling method of voice information
CN102404240B (en) Information search system and method
CN104317804A (en) Voting information publishing method and device
CN103095559A (en) Method of outputting advertisement prompting message in instant messaging and system thereof
CN102333084A (en) Information push method based on user attribute, and system for the same
CN102279960A (en) User-element-containing advertisement publish control method and system
CN104008182A (en) Measuring method of social network communication influence and measure system thereof
CN102916867A (en) Information push method and system
CN103379019A (en) Microblog message pushing method, device and system
US20140047051A1 (en) Method and system for sending prompt information to social networking services community users
CN109241031B (en) Model generation method, model using method, device, system and storage medium
CN103780590B (en) Automatically prompting user the registration method of microblogging, Apparatus and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant