CN103995823A - Information recommending method based on social network - Google Patents
Information recommending method based on social network Download PDFInfo
- Publication number
- CN103995823A CN103995823A CN201410112163.9A CN201410112163A CN103995823A CN 103995823 A CN103995823 A CN 103995823A CN 201410112163 A CN201410112163 A CN 201410112163A CN 103995823 A CN103995823 A CN 103995823A
- Authority
- CN
- China
- Prior art keywords
- user
- trust
- users
- community
- mrow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 239000011159 matrix material Substances 0.000 claims abstract description 26
- 230000008569 process Effects 0.000 claims abstract description 6
- 238000011156 evaluation Methods 0.000 claims description 18
- 238000004364 calculation method Methods 0.000 claims description 17
- 230000003993 interaction Effects 0.000 claims description 13
- 230000002452 interceptive effect Effects 0.000 claims description 4
- 230000004044 response Effects 0.000 abstract description 3
- 238000003012 network analysis Methods 0.000 abstract description 2
- 238000001914 filtration Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011002 quantification Methods 0.000 description 2
- 235000010627 Phaseolus vulgaris Nutrition 0.000 description 1
- 244000046052 Phaseolus vulgaris Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/35—Clustering; Classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Data Mining & Analysis (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- General Health & Medical Sciences (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an information recommending method based on a social network. The information recommending method includes the following steps that first, trust degree and similarity between users are calculated, and a user relation matrix is constructed through weighted values; second, the users are clustered through a community discovering algorithm, and then a closest neighbor set of the users is formed; third, scores are predicted, and a recommending list is generated. The information recommending method based on the social network can achieve the following advantages that first, the cold start problem is solved: trust degree is introduced into the method, if enough neighbors cannot be obtained according to the common grading articles in the recommending process, trustable friends can serve as the start point of prediction, and thus the cold start problem can be relieved, and user coverage can be improved; real time performance is improved: community division is performed on the user network through the community discovering algorithm commonly used in social network analysis, in other words, same user interests are clustered, and thus the time for finding the neighbor set of the users is greatly shortened, and the real time performance of the information recommending response is improved.
Description
Technical Field
The invention relates to the technical field of network information, in particular to an information recommendation method based on a social network.
Background
The rapid development of the internet and the continuously increasing information resources lead to the rapid increase of the information index, and the information service field faces the problem that the information resources are rich, but the information with useful value is difficult to obtain, thereby bringing great information burden to people. On one hand, the phenomenon of information overload (information overload) caused by a large amount of data resources on the network occurs; on the other hand, the user cannot acquire the information resources required by the user. A recommendation system (recommendation systems) is an important method for serving in an 'information push' mode, is a main means for solving the problem of information overload, can actively push information which is possibly needed but difficult to obtain to a user on the basis of analyzing and predicting the user requirement by taking the user as a center, and recommends information resources with more utilization value for the user according to behavior characteristics of the user in different environment occasions.
With the development of the internet there is also a rapid expansion of social networks. Social networks connect people who have the same hobbies, even people who are not acquainted with each other, through the internet, thereby forming a group with a certain characteristic. The social network is a platform which can communicate and exchange with each other and participate in interaction, and is expanded from research departments, schools, governments and business application platforms into a tool for human social communication. Because the internet is virtual, people hide their true identities in the network in many ways, which not only brings a lot of false information, but also makes the trust level between people lower and lower, and communication becomes more difficult. The social network adopts real information registration, so that the identity authenticity and the behavior credibility of network users are enhanced, the information safety and the reliability, the regionality and the real-time performance of user interaction in the system are greatly guaranteed, people can communicate with other people more securely and more easily, and brand new user experience is brought. Through social networks, they may actively publish their features and preferences, actively provide and annotate various resources (such as pictures, videos) or share their knowledge. For example, a user may share a book through a bean, perform social networking and share photos through Facebook, send a microblog through Twitter, publish photos through Flickr, upload videos through YouTube, and so on. Increasingly popular social networks silently change people's lifestyle and orientation of value.
Currently, frequently used recommendation methods include the following:
1) the recommendation method based on the association rule generates the association rule according to the transaction data of the user, and proposes suggestions in combination with the current purchasing behavior of the user, wherein shopping cart analysis is the most typical application of the association rule. The recommendation method based on the association rule has stronger universality and can be applied to various fields, but the extraction of the association rule is difficult, the consumed time is long, and the system is difficult to manage as the number of the association rules is increased continuously.
2) The recommendation method based on the content mainly focuses on the content analysis of information resource items and the construction of a user preference model, and the recommendation function is realized by comparing the similarity of resources and user preferences. Although the recommendation technology based on the content has an intuitive result, simple calculation, quick response time and good interpretability, and can solve the problems of cold start and data sparsity. However, there are still some limitations: the content of the items that can be analyzed is limited, only information that can be represented by a series of feature sets, and multimedia information such as sound, pictures, video, and the like cannot be effectively processed; the user can receive items similar to past favorite recommendations, but cannot find new interested commodities for the user, and the recommendation content is single; quality, style or viewpoint cannot be processed.
3) The collaborative filtering recommendation method is the most successful technology in the current recommendation information system, the basic idea of collaborative filtering is to utilize the similarity between users or items to recommend or predict, the method finds out a group of users with the same preference, and then analyzes the common preference of the users to recommend the target users. The collaborative filtering algorithm has the advantages that the collaborative filtering algorithm does not pay attention to the content of the item, resources are recommended mainly according to the similarity of users or items, and the system can reliably recommend the item only by obtaining enough item evaluation. However, the shortcomings of the collaborative filtering algorithm are also very obvious, namely the problem of cold start, the problem of data sparsity, the problem of expandability and the like.
The development of the social network provides a good channel for personalized recommendation, the invention organically combines trust measurement among users, a social network mode and a personalized recommendation technology, and provides an information recommendation method based on the social network to construct a recommendation system with high efficiency and high accuracy.
Disclosure of Invention
In order to solve the technical problem, the invention provides an information recommendation method based on a social network, which adopts the following technical scheme:
an information recommendation method based on a social network comprises the following steps:
step 1: calculating the trust and similarity between users, and constructing a user relationship matrix by using a weighted value;
step 2: clustering the users by using a community discovery algorithm to form a user nearest neighbor set;
and step 3: the prediction scores and generates a recommendation list.
Constructing a user-score matrix Rm×n:
m represents the number of users, n represents the number of items, rijRepresenting the rating of item j by user i.
In the populated user-rating matrix Rm×nOn the basis, the similarity between users is calculated by using Pearson correlation, and a user-user similarity matrix S is constructed:
suvrepresents the degree of similarity between user u and user v, and suv∈[0,1]。
Calculating the trust degree, and then calculating a weighted value combining the similarity and the trust:
h(i,j)=θ×trust(i,j)+(1-θ)×sim(i,j);
θ represents a weighting parameter, trust (i, j) represents the direct confidence of users i and j, sim (i, j) represents the similarity, and h (i, j) represents a weighted value of the two.
And (3) constructing a user relationship matrix H by using the weighted values:
the direct trust is the combination of the interactive trust, the proportion of common friends among users and the evaluation capability of the users, and the calculation formula is as follows:
trust (i, j) represents the direct trust of users i and j, fri (i, j) represents the proportion of common friends between the users, fre represents the evaluation capability of the users, and comm (i, j) represents the interactive trust between the users.
The calculation formula of the interaction trust degree is as follows:
wherein, wi,jRepresenting the number of messages sent by user i to user j, Σ wi(out)The total number of messages sent to surrounding users on behalf of the user i;
the calculation formula of the proportion of common friends among users and the evaluation capability of the users is as follows:
where fri (i, j) represents the proportion of common friends among users, fre represents the evaluation ability of users, and niAnd njRepresenting the numbers of friends of users i and j, ni∩njNumber of common friends on their behalf; k is a radical ofiRepresenting the number of evaluations of the recommended user on the i-type merchandise, Σ kiRepresenting the number of evaluations of all the commodity categories by the user.
The process of the community discovery method is as follows:
step 1: calculating the degree of each user in the network (the number of edges associated with the vertex), and selecting the user i with the highest degree from the degrees as an initial community CiAnd initializing the modularity Q to be 0;
step 2: find all and community CiConnected users and put them into the adjacent user set N;
step 3: calculating each user j in the user set N to the community CiAnd adding the user having the largest contribution degree to the community CiPerforming the following steps;
step 4: compute community CiModularity Q'. If Q' > Q, add user j to community CiSuccessfully marking the user j, updating the modularity Q ═ Q', and returning to Step2 to continue execution; otherwise, go to Step 5;
step 5: the modularity Q has reached a maximum value, i.e. the current community CiAchieving the optimal result of the division;
step 6: if there are no unmarked users and all communities in the network have been detected, the process ends; otherwise, selecting the user with the maximum degree from the users without marks as a new initial community CiReturning to step2 to continue execution.
Contribution q of user to community
Lin: representing the number of connected edges in the community in the unauthorized network; representing an insider of a community in a rights networkThe sum of the weights on the edges.
Lout: representing the number of external connection edges connected with the community in the unauthorized network; representing the sum of the weights on all the external edges connected to the community in a weighted network.
The larger the contribution q of the user to the community is, the more closely the user and the community are connected.
Definition 2: modularity Q
The modularity Q is an important index for judging whether the current community reaches the optimal degree or not in community division, the larger the modularity Q is, the better the community division effect is, the less the connectivity between the community and the community is, thereby realizing the high cohesion inside the module and the low coupling outside the module.
If the network is an unweighted network, the expression of the modularity Q is as follows:
wherein m is the total number of edges of the network; k is a radical ofiAnd kjRespectively representing the number of connecting edges of the user i and the user j; a. theijRepresenting a network adjacency matrix, A when a user i and a user j of a random network connection are connectedijWhen user i and user j are not connected, a is 1ij=0;δ(Ci,Cj) For the kronecker function, if user i and user j belong to the same community, δ (C)i,Cj) 1, if not in the same community, δ (C)i,Cj)=0。
In a weighted network, the modularity Q may be defined as follows:
wherein W represents the sum of the weights of all edges in the network, WiAnd wjRepresenting the sum of the weights of the edges connected to user i and user j, respectively.
And predicting the scoring of the candidate items by the target user according to the scoring information of the candidate items by the N nearest neighbors of the target user, selecting the first items with the highest predicted scores as recommendation results, and actively pushing the recommendation results to the target user, namely generating top-N information resource recommendation.
Wherein, Pu,iRepresents the predicted rating of item i by user u,andrespectively representing the average scores of the user u and the neighbor user v on the project; rv,iRepresents the rating of the user v on the item i, trust (u, v) represents the trust degree of the user u on the neighbor user v, and N represents the neighbor user candidate set of the user u.
The direct trust (u, v) may also be the transitive trustL(A,B)Instead, it is calculated as follows:
trustL(A,B)=trust(A,X1)×trust(X1,X2)×…×trust(Xn,B);
wherein, XiRepresenting users between users A and B on path L, L (A, B) representing an existing trust path between user A and user B, if there are multiple trust paths L (L) between user A and user B in the trust network1,L2,…,Ln) (n is more than or equal to 2), selecting the shortest path in the path L, if k shortest paths exist, calculating the formula as follows:
then, the calculation is continued according to the sequence of the path L from the short to the long, if the calculation result of a certain path jCalculate path j as one of the shortest paths and recalculate trustL(A,B)And when all paths are calculated, a final indirect trust result is obtained.
The information recommendation method based on the social network, provided by the invention, can achieve the following beneficial effects:
(1) the cold start problem is solved. The cold start problem means that when a new user joins the recommendation system, since no record is made on the historical behavior or score of the new user, effective information recommendation cannot be performed on the new user. The method introduces the trust degree, and if enough neighbors cannot be obtained according to the common scoring articles during recommendation, the trusted friends can be used as the starting points of prediction, so that the cold start problem can be relieved, and the user coverage degree can be improved.
(2) The real-time performance is improved. In the method, the community discovery algorithm commonly used in social network analysis is adopted to perform community division on the user network, namely the same user interest clustering is performed, so that the time is greatly shortened when a user neighbor set is searched, and the response real-time performance of information recommendation is improved.
Drawings
FIG. 1 is a flow chart of a social network based recommendation method.
FIG. 2 is a diagram of interaction between users.
FIG. 3 is a graph of computation of transitive belief for multiple paths.
FIG. 4 is a flow diagram of community discovery.
Detailed Description
The invention provides an information recommendation method based on a social network. Firstly, calculating the trust and similarity between users, and constructing a user relationship matrix by using a weighted value; secondly, clustering the users by using a community discovery algorithm to form a user nearest neighbor set; finally, the scores are predicted and a recommendation list is generated.
As shown in fig. 1, collecting related information of users, items, scores, social networks and the like, calculating trust and similarity between the users according to the information, and constructing a user relationship matrix by using weighted values; secondly, dividing the users by using a community discovery algorithm to form a user nearest neighbor set; finally, the scores are predicted and a recommendation list is generated.
1. Direct degree of trust
Direct trust is a quantification of the degree of trust one user has on another user. The trust is introduced into the personalized recommendation system, and the problem of quantification of the trust relationship is solved to enable the trust relationship to become data which can be calculated or subjected to related operations. Combining multiple properties of trust and the relevant characteristics of the actual social network, the computational problem of direct trust is considered herein from the following aspects.
1) Degree of mutual trust
The interaction degree refers to the interaction degree among users in the social network relationship, such as the interaction times within the period time of the users, such as conversation, sending short messages, mails, microblog concerns, SNS messages and the like. An interaction graph among users is shown in fig. 2, wherein each node in the graph represents a user in a social network, edges among the users represent interaction senders to receivers by directional arrows, and weighted values on the edges represent information sum of various interaction types. Through an interaction graph among users, the interaction trust degree among the users can be defined as follows:
wherein, wi,jRepresenting the number of messages sent by user i to user j, Σ wi(out)Representing the total number of messages sent by user i to the surrounding users.
2) Recommending confidence
The recommendation trust degree comprises the proportion of common friends among users and the evaluation capability of the users. The user always trusts the user who bought or used the commodity more, and if the background information of the user, such as profession, interest and the like, has a certain relation with the commodity, the background information of the user enables the user to have certain evaluation capacity for the commodity, and the capacity can also be a reference factor of the credibility of the user for recommending the commodity. Meanwhile, the number of common friends between the users can also reflect the relationship between the users and the friends. fri (i, j) represents the proportion of common friends among users, and fre represents the calculation of the evaluation capability of the users as follows:
wherein n isiAnd njRepresenting the numbers of friends of users i and j, ni∩njNumber of common friends on their behalf; k is a radical ofiRepresenting the number of evaluations of the recommended user on the i-type merchandise, Σ kiRepresenting the number of evaluations of all the commodity categories by the user.
Combining the two trust degrees to obtain the direct trust degree trust (i, j):
2. transitive confidence computation
The principle that direct trust is preferred to indirect trust is followed in the calculation of the degree of trust, and L (A, B) represents the existing trust path between the user A and the user B. If a unique trust path L (A, X) exists between user A and user B in the trust network1,X2,…,XnB), then the transitive confidence between users a and B is the product of all direct trusts on the trust path L, and the expression is:
trustL(A,B)=trust(A,X1)×trust(X1,X2)×…×trust(Xn,B);
wherein, XiRepresenting the users between users a and B on path L.
If there are multiple trust paths L (L) between user A and user B in the trust network1,L2,…,Ln) (n is more than or equal to 2), selecting the shortest path in the path L, if k shortest paths exist, calculating the formula as follows:
then, the calculation is continued according to the sequence of the path L from the short to the long, if the calculation result of a certain path jCalculate path j as one of the shortest paths and recalculate trustL(A,B)And when all paths (if the links are too long and can be ignored) are calculated, a final indirect trust result is obtained. The calculation method effectively avoids misjudgment caused by the fact that the trust degree of the shortest trust path is too low.
As shown in FIG. 3, there are multiple trusted paths from user A to user B, and the shortest path L (A, X) should be calculated first3B) and L (A, X)4Trust of B)L(A,B)The value of the one or more of,but the other path L (A, X)1,X2Degree of transitive Trust of B) <math>
<mrow>
<msub>
<mi>trust</mi>
<mrow>
<mi>L</mi>
<mrow>
<mo>(</mo>
<mi>A</mi>
<mo>,</mo>
<msub>
<mi>X</mi>
<mn>1</mn>
</msub>
<mo>,</mo>
<msub>
<mi>X</mi>
<mn>2</mn>
</msub>
<mo>,</mo>
<mi>B</mi>
<mo>)</mo>
</mrow>
</mrow>
</msub>
<mo>=</mo>
<mn>0.8</mn>
<mo>×</mo>
<mn>0.8</mn>
<mo>×</mo>
<mn>0.9</mn>
<mo>=</mo>
<mn>0.576</mn>
<mo>></mo>
<msub>
<mi>trust</mi>
<mrow>
<mi>L</mi>
<mrow>
<mo>(</mo>
<mtext>A,B</mtext>
<mo>)</mo>
</mrow>
</mrow>
</msub>
<mo>=</mo>
<mn>0.48</mn>
<mo>,</mo>
</mrow>
</math> So path L (A, X)1,X2And B) should also be added to the shortest path set to obtain the final transfer trust degree of
3. Community discovery
In a real network, there are often some users that are very closely related to other users (i.e., the point in the network where the user is very large, we refer to as the "central user"). The central user is taken as a starting point of an initial community, then, the adjacent users with the largest contribution degree to the community are continuously added into the community (if a plurality of users have larger contribution degrees to the community, the users are added into the community), and a stable community is formed when the global contribution degree reaches the maximum.
For a clearer understanding of the clustering process, the degree of contribution and the degree of modularity to the community are defined as follows:
definition 1: contribution q of user to community
Lin: representing the number of connected edges in the community in the unauthorized network; representing the weight sum of all edges inside a community in a weighted networkAnd (c).
Lout: representing the number of external connection edges connected with the community in the unauthorized network; representing the sum of the weights on all the external edges connected to the community in a weighted network.
The non-weighted network means that there is no weight value on the edge, and the weighted network means that there is a weight value on the edge.
The larger the contribution q of the user to the community is, the more closely the user and the community are connected.
Definition 2: modularity Q
The modularity Q is an important index for judging whether the current community reaches the optimal degree or not in community division, the larger the modularity Q is, the better the community division effect is, the less the connectivity between the community and the community is, thereby realizing the high cohesion inside the module and the low coupling outside the module.
If the network is an unweighted network, the expression of the modularity Q is as follows:
wherein m is the total number of edges of the network; k is a radical ofiAnd kjRespectively representing the number of connecting edges of the user i and the user j; a. theijRepresenting a network adjacency matrix, A when a user i and a user j of a random network connection are connectedijWhen user i and user j are not connected, a is 1ij=0;δ(Ci,Cj) For the kronecker function, if user i and user j belong to the same community, δ (C)i,Cj) 1, if not in the same community, δ (C)i,Cj)=0。
In a weighted network, the modularity Q may be defined as follows:
wherein W represents the sum of the weights of all edges in the network, WiAnd wjRepresenting the sum of the weights of the edges connected to user i and user j, respectively.
The community discovery algorithm is shown in fig. 4:
step 1: calculating the degree of each user in the network (the number of edges associated with the vertex), and selecting the user i with the highest degree from the degrees as an initial community CiAnd initializing the modularity Q to be 0;
step 2: find all and community CiConnected users and put them into the adjacent user set N;
step 3: calculating each user j in the user set N to the community CiAnd adding the user having the largest contribution degree to the community CiPerforming the following steps;
step 4: compute community CiModularity Q'. If Q' > Q, add user j to community CiSuccessfully marking the user j, updating the modularity Q ═ Q', and returning to Step2 to continue execution; otherwise, go to Step 5;
step 5: the modularity Q has reached a maximum value, i.e. the current community CiAchieving the optimal result of the division;
step 6: if there are no unmarked users and all communities in the network have been detected, the process ends; otherwise, selecting the user with the maximum degree from the users without marks as a new initial community CiReturning to step2 to continue execution.
4. Implementation of recommendation method
1) Building a user relationship matrix
Firstly, acquiring user information, project information and rating information, and representing the relationship between a user and a project in a matrix mode to form a user-rating matrix Rm×nHere, the item information refers to a product, a movie, or the like recommended to the user. Where m represents the number of users, n represents the number of items, rijRepresenting the rating of item j by user i. To reduce sparsity of the user-scoring matrix, the unscored r may be usedijSet to 0 or the mean of all the users i that have been scored or the mean of the items j that have been scored.
Second, in the populated user-score matrix Rm×nOn the basis, the similarity is calculated by using Pearson correlation, wherein the Pearson correlation is a method for calculating the similarity, if the item set jointly scored by the user I and the user j is set as IijThen the similarity sim (i, j) measured by Pearson correlation is:
wherein R isicAnd RjcRepresents the rating of item c by both users;andrespectively representing users I and j in IijAverage score above.
On the basis of the above, a user-user similarity matrix S is constructed. Wherein s isuvRepresents the degree of similarity between user u and user v, and suv∈[0,1]。
A user-user similarity relationship matrix S:
calculating the trust degree, and then calculating a weighted value combining the similarity and the trust:
h(i,j)=θ×trust(i,j)+(1-θ)×sim(i,j);
θ represents a weighting parameter, trust (i, j) represents the confidence of users i and j, sim (i, j) represents the similarity, and h (i, j) represents a weighting value of the two.
Constructing a user relationship matrix H:
2) clustering users with the same interest to form a neighbor set
Clustering the users according to the user relationship matrix by using the community discovery algorithm described above, and dividing the users into a plurality of communities { C1,C2,…,CnAnd users in each community have the same interest and hobbies, and a neighbor set is formed. If a new user joins, the user can be reclassified by updating the network.
3) Predictive scoring to generate recommendations
And predicting the scoring of the candidate items by the target user according to the scoring information of the candidate items by the N nearest neighbors of the target user, selecting the first items with the highest predicted scores as recommendation results, and actively pushing the recommendation results to the target user, namely generating top-N information resource recommendation.
Wherein,andrespectively representing the average scores of the user u and the neighbor user v on the project; trust (u, v) represents the degree of trust of user u for neighbor user v.
The direct trust (u, v) may also be the transitive trustL(A,B)Instead, the calculation method is as described above.
Claims (8)
1. An information recommendation method based on a social network comprises the following steps:
step 1: calculating the trust and similarity between users, and constructing a user relationship matrix by using a weighted value;
step 2: clustering the users by using a community discovery algorithm to form a user nearest neighbor set;
and step 3: the prediction scores and generates a recommendation list.
2. The information recommendation method based on social network as claimed in claim 1, wherein the user relationship matrix is constructed in step1 by the following method:
constructing a user-score matrix Rm×n:
m represents the number of users, n represents the number of items, rijA score for item j on behalf of user i;
in the populated user-rating matrix Rm×nOn the basis, the similarity between users is calculated by using Pearson correlation, and a user-user similarity matrix S is constructed:
suvrepresents the degree of similarity between user u and user v, and suv∈[0,1];
Calculating the trust degree, and then calculating a weighted value combining the similarity and the trust:
h(i,j)=θ×trust(i,j)+(1-θ)×sim(i,j);
theta represents a weighting parameter, trust (i, j) represents the direct trust of users i and j, sim (i, j) represents similarity, and h (i, j) represents a weighted value of the two;
and (3) constructing a user relationship matrix H by using the weighted values:
3. the information recommendation method based on the social network as claimed in claim 2, wherein the direct trust is a combination of the interactive trust, the proportion of common friends among users, and the evaluation ability of the users, and the calculation formula is as follows:
trust (i, j) represents the direct trust of users i and j, fri (i, j) represents the proportion of common friends between the users, fre represents the evaluation capability of the users, and comm (i, j) represents the interactive trust between the users;
the calculation formula of the interaction trust degree is as follows:
wherein, wi,jRepresenting the number of messages sent by user i to user j, Σ wi(out)The total number of messages sent to surrounding users on behalf of the user i;
the calculation formula of the proportion of common friends among users and the evaluation capability of the users is as follows:
where fri (i, j) represents the proportion of common friends among users, fre represents the evaluation ability of users, and niAnd njRepresenting the numbers of friends of users i and j, ni∩njNumber of common friends on their behalf; k is a radical ofiRepresenting the number of evaluations of the recommended user on the i-type merchandise, Σ kiRepresenting the number of evaluations of all the commodity categories by the user.
4. The method of claim 1, wherein the community discovery method in step2 comprises the following steps:
step 1: calculating the degree of each user in the network (the number of edges associated with the vertex), and selecting the user i with the highest degree from the degrees as an initial community CiAnd initializing the modularity Q to be 0;
step 2: find all and community CiConnected users and put them into the adjacent user set N;
step 3: calculating each user j in the user set N to the community CiAnd adding the user having the largest contribution degree to the community CiPerforming the following steps;
step 4: compute community CiIf Q' is greater than Q, adding user j to community CiSuccessfully marking the user j, updating the modularity Q ═ Q', and returning to Step2 to continue execution; otherwise, go to Step 5;
step 5: the modularity Q has reached a maximum value, i.e. the current community CiAchieving the optimal result of the division;
step 6: if there are no unmarked users and all communities in the network have been detected, the process ends; otherwise, selecting the user with the maximum degree from the users without marks as a new initial community CiReturning to step2 to continue execution.
5. The information recommendation method based on the social network as claimed in claim 4, wherein the contribution q of the user to the community is calculated as follows:
Lin: representing the number of connected edges in the community in the unauthorized network; representing the total weight of all edges in the community in the weighted network;
Lout: representing the number of external connection edges connected with the community in the unauthorized network; representing outside connections to a community in a privileged networkThe sum of the weights of all edges is calculated;
the larger the contribution q of the user to the community is, the more closely the user and the community are connected.
6. The information recommendation method based on social network as claimed in claim 4, wherein the modularity Q is expressed as follows:
if the network is an unweighted network, the expression of the modularity Q is as follows:
wherein m is the total number of edges of the network; k is a radical ofiAnd kjRespectively representing the number of connecting edges of the user i and the user j; a. theijRepresenting a network adjacency matrix, A when a user i and a user j of a random network connection are connectedijWhen user i and user j are not connected, a is 1ij=0;δ(Ci,Cj) For the kronecker function, if user i and user j belong to the same community, δ (C)i,Cj) 1, if not in the same community, δ (C)i,Cj)=0;
In a weighted network, the modularity Q may be defined as follows:
wherein W represents the sum of the weights of all edges in the network, WiAnd wjRepresenting the sum of the weights of the edges connected to user i and user j, respectively.
7. The information recommendation method based on the social network as claimed in claim 1, wherein the scoring recommendation method in step3 is as follows: predicting the scoring of the candidate items by the target user according to the scoring information of the candidate items by the N nearest neighbors of the target user, selecting the first items with the highest predicted scores as recommendation results and actively pushing the recommendation results to the target user, namely generating top-N information resource recommendation:
wherein, Pu,iRepresents the predicted rating of item i by user u,andrespectively representing the average scores of the user u and the neighbor user v on the project; rv,iRepresents the rating of the user v on the item i, trust (u, v) represents the trust degree of the user u on the neighbor user v, and N represents the neighbor user candidate set of the user u.
8. The method of claim 7, wherein the direct trust (u, v) is also the transitive trust (Trust)L(A,B)Instead, it is calculated as follows:
trustL(A,B)=trust(A,X1)×trust(X1,X2)×…×trust(Xn,B);
wherein, XiRepresenting users between users A and B on path L, L (A, B) representing an existing trust path between user A and user B, if there are multiple trust paths L (L) between user A and user B in the trust network1,L2,…,Ln) (n is more than or equal to 2), selecting the shortest path in the path L, if k shortest paths exist, calculating the formula as follows:
then, the calculation is continued according to the sequence of the path L from the short to the long, if the calculation result of a certain path jCalculate path j as one of the shortest paths and recalculate trustL(A,B)And when all paths are calculated, a final indirect trust result is obtained.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410112163.9A CN103995823A (en) | 2014-03-25 | 2014-03-25 | Information recommending method based on social network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410112163.9A CN103995823A (en) | 2014-03-25 | 2014-03-25 | Information recommending method based on social network |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103995823A true CN103995823A (en) | 2014-08-20 |
Family
ID=51309988
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410112163.9A Pending CN103995823A (en) | 2014-03-25 | 2014-03-25 | Information recommending method based on social network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103995823A (en) |
Cited By (61)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104268271A (en) * | 2014-10-13 | 2015-01-07 | 北京建筑大学 | Interest and network structure double-cohesion social network community discovering method |
CN104317959A (en) * | 2014-11-10 | 2015-01-28 | 北京字节跳动网络技术有限公司 | Data mining method and device based on social platform |
CN104408149A (en) * | 2014-12-04 | 2015-03-11 | 威海北洋电气集团股份有限公司 | Criminal suspect mining association method and system based on social network analysis |
CN104834967A (en) * | 2015-04-24 | 2015-08-12 | 南京邮电大学 | User similarity-based business behavior prediction method under ubiquitous network |
CN105025091A (en) * | 2015-06-26 | 2015-11-04 | 南京邮电大学 | Shop recommendation method based on position of mobile user |
CN105045805A (en) * | 2015-06-03 | 2015-11-11 | 安徽师范大学 | Construction method for trust recommendation model based on mobile communications and construction system thereof |
CN105069125A (en) * | 2015-08-13 | 2015-11-18 | 上海斐讯数据通信技术有限公司 | Social network recommending method and social network recommending system |
CN105138684A (en) * | 2015-09-15 | 2015-12-09 | 联想(北京)有限公司 | Information processing method and device |
CN105528395A (en) * | 2015-11-30 | 2016-04-27 | 苏州大学 | Method and system for recommending potential consumers |
CN105528379A (en) * | 2014-10-24 | 2016-04-27 | 杭州师范大学 | Resource recommending method and device |
CN105718551A (en) * | 2016-01-19 | 2016-06-29 | 浙江工业大学 | Hadoop based social recommendation method |
WO2016127331A1 (en) * | 2015-02-11 | 2016-08-18 | 深圳市仁盟互动网络科技有限公司 | Trusted recommendation-based method and system for adding friends on a social network |
CN105956201A (en) * | 2016-06-22 | 2016-09-21 | Tcl集团股份有限公司 | Social network video recommending method and device |
CN106056455A (en) * | 2016-06-02 | 2016-10-26 | 南京邮电大学 | Group and place recommendation method based on location and social relationship |
CN106126586A (en) * | 2016-06-21 | 2016-11-16 | 安徽师范大学 | A kind of social networks recommended models construction method trusted based on overall merit |
CN106126549A (en) * | 2016-06-16 | 2016-11-16 | 传化公路港物流有限公司 | A kind of community's trust recommendation method decomposed based on probability matrix and system thereof |
CN106227792A (en) * | 2016-07-20 | 2016-12-14 | 百度在线网络技术(北京)有限公司 | Method and apparatus for pushed information |
CN106445961A (en) * | 2015-08-10 | 2017-02-22 | 北京奇虎科技有限公司 | News pushing method and device |
CN106528643A (en) * | 2016-10-13 | 2017-03-22 | 上海师范大学 | Social network based multi-dimension comprehensive recommending method |
CN106570090A (en) * | 2016-10-20 | 2017-04-19 | 杭州电子科技大学 | Method for collaborative filtering recommendation based on interest changes and trust relations |
CN106682121A (en) * | 2016-12-09 | 2017-05-17 | 广东工业大学 | Time utility recommendation method based on interest change of user |
CN107123057A (en) * | 2017-03-22 | 2017-09-01 | 阿里巴巴集团控股有限公司 | User recommends method and device |
CN107145541A (en) * | 2017-04-24 | 2017-09-08 | 安徽师范大学 | Social networks recommended models construction method based on hypergraph structure |
CN107230002A (en) * | 2017-06-09 | 2017-10-03 | 天津大学 | Project-based rating matrix prediction algorithm |
CN107301583A (en) * | 2017-05-26 | 2017-10-27 | 重庆邮电大学 | It is a kind of that method is recommended based on user preference and the cold start-up trusted |
CN107330727A (en) * | 2017-06-30 | 2017-11-07 | 重庆邮电大学 | A kind of personalized recommendation method based on hidden semantic model |
CN107358533A (en) * | 2017-06-15 | 2017-11-17 | 桂林理工大学 | A kind of user of Web Community recommends method and system |
CN107368499A (en) * | 2016-05-12 | 2017-11-21 | 中国移动通信集团广东有限公司 | A kind of client's tag modeling and recommendation method and device |
CN107426338A (en) * | 2017-08-28 | 2017-12-01 | 江西博瑞彤芸科技有限公司 | A kind of information management method and system |
CN107506455A (en) * | 2017-08-29 | 2017-12-22 | 重庆邮电大学 | A kind of friend recommendation method for merging user social contact circle similarity |
CN107657347A (en) * | 2017-09-30 | 2018-02-02 | 桂林电子科技大学 | Method is recommended in a kind of tourism towards group |
CN107688901A (en) * | 2017-08-24 | 2018-02-13 | 北京小度信息科技有限公司 | Data adjustment method and device |
CN107862012A (en) * | 2017-10-30 | 2018-03-30 | 江苏大学 | A kind of information resources auto recommending method for group of college students |
CN107870934A (en) * | 2016-09-27 | 2018-04-03 | 武汉安天信息技术有限责任公司 | A kind of app user clusterings method and device |
CN107909428A (en) * | 2017-11-01 | 2018-04-13 | 平安科技(深圳)有限公司 | Electronic device, Products Show method and computer-readable recording medium |
CN108090197A (en) * | 2017-12-22 | 2018-05-29 | 河南科技大学 | A kind of community discovery method of multidimensional social networks |
CN108154425A (en) * | 2018-01-19 | 2018-06-12 | 广州天源信息科技股份有限公司 | Method is recommended by the Xian Xia trade companies of a kind of combination community network and position |
CN108197211A (en) * | 2017-12-28 | 2018-06-22 | 百度在线网络技术(北京)有限公司 | A kind of information recommendation method, device, server and storage medium |
CN108280533A (en) * | 2017-11-24 | 2018-07-13 | 浙江理工大学 | A kind of optimal configuration method for meeting the global external city vehicle community network community for trusting value constraint and recommending |
CN104966125B (en) * | 2015-05-06 | 2018-07-24 | 同济大学 | A kind of article scoring of social networks and recommend method |
CN108599991A (en) * | 2018-03-21 | 2018-09-28 | 安徽大学 | The key node searching method of Trust transitivity is influenced in social Internet of Things |
CN108664484A (en) * | 2017-03-28 | 2018-10-16 | 腾讯科技(北京)有限公司 | Media content recommendations method and device |
CN108846042A (en) * | 2018-05-29 | 2018-11-20 | 昆明理工大学 | A kind of social networks recommended method of combination user feedback mechanisms |
CN109101667A (en) * | 2018-09-29 | 2018-12-28 | 新乡学院 | A kind of personalized recommendation method based on explicit trust and implicit trust |
CN109255073A (en) * | 2018-08-28 | 2019-01-22 | 麒麟合盛网络技术股份有限公司 | A kind of personalized recommendation method, device and electronic equipment |
CN109426985A (en) * | 2017-09-04 | 2019-03-05 | 腾讯科技(深圳)有限公司 | Information processing method, device, computer equipment and storage medium |
CN109712012A (en) * | 2018-09-28 | 2019-05-03 | 上海达家迎信息科技有限公司 | Social networks division methods, device, equipment and storage medium |
CN109800356A (en) * | 2019-01-23 | 2019-05-24 | 国信优易数据有限公司 | A kind of information resources recommended method, device, equipment and storage medium |
CN109918562A (en) * | 2019-01-18 | 2019-06-21 | 重庆邮电大学 | A kind of recommended method based on communities of users and scoring joint community |
CN109948067A (en) * | 2019-02-22 | 2019-06-28 | 哈尔滨工业大学(深圳) | The information-pushing method and system of user's enigmatic language justice LR model are trusted in a kind of fusion |
CN109995663A (en) * | 2019-03-23 | 2019-07-09 | 西安电子科技大学 | Spreading network information method based on length constraint and without duplicate paths |
CN110851701A (en) * | 2019-09-25 | 2020-02-28 | 浙江工业大学 | Probability matrix decomposition recommendation method based on user context coupling similarity |
CN111143670A (en) * | 2019-12-09 | 2020-05-12 | 中国平安财产保险股份有限公司 | Information determination method and related product |
CN111259133A (en) * | 2020-01-17 | 2020-06-09 | 成都信息工程大学 | Personalized recommendation method integrating multiple information |
CN111597428A (en) * | 2019-02-20 | 2020-08-28 | 中国科学院声学研究所 | Recommendation method for splicing user and article with q-separation k sparsity |
CN111639251A (en) * | 2020-06-16 | 2020-09-08 | 李忠耘 | Information retrieval method and device |
US10789377B2 (en) | 2018-10-17 | 2020-09-29 | Alibaba Group Holding Limited | Secret sharing with no trusted initializer |
CN111931035A (en) * | 2019-05-13 | 2020-11-13 | 中国移动通信集团湖北有限公司 | Service recommendation method, device and equipment |
CN112989208A (en) * | 2021-04-30 | 2021-06-18 | 武汉卓尔数字传媒科技有限公司 | Information recommendation method and device, electronic equipment and storage medium |
CN113689305A (en) * | 2021-07-24 | 2021-11-23 | 深圳市思晓信息技术有限公司 | Security management method and system for social network |
CN117876029A (en) * | 2024-03-12 | 2024-04-12 | 南京摆渡人网络信息技术有限公司 | Man-machine interaction optimization system, method and device based on commodity popularization |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090284531A1 (en) * | 2008-05-19 | 2009-11-19 | Takuya Ishioka | Information Processing Apparatus, Information Processing Method and Program |
CN103268332A (en) * | 2013-05-06 | 2013-08-28 | 南京邮电大学 | Credible service selection method based on community structure |
-
2014
- 2014-03-25 CN CN201410112163.9A patent/CN103995823A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090284531A1 (en) * | 2008-05-19 | 2009-11-19 | Takuya Ishioka | Information Processing Apparatus, Information Processing Method and Program |
CN103268332A (en) * | 2013-05-06 | 2013-08-28 | 南京邮电大学 | Credible service selection method based on community structure |
Non-Patent Citations (1)
Title |
---|
朱琳可: "基于社交网络的个性化推荐服务研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (95)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104268271B (en) * | 2014-10-13 | 2017-09-22 | 北京建筑大学 | The myspace of the double cohesions of a kind of interest and network structure finds method |
CN104268271A (en) * | 2014-10-13 | 2015-01-07 | 北京建筑大学 | Interest and network structure double-cohesion social network community discovering method |
CN105528379A (en) * | 2014-10-24 | 2016-04-27 | 杭州师范大学 | Resource recommending method and device |
CN105528379B (en) * | 2014-10-24 | 2020-09-22 | 杭州师范大学 | Resource recommendation method and device |
CN104317959B (en) * | 2014-11-10 | 2018-07-17 | 北京字节跳动网络技术有限公司 | Data digging method based on social platform and device |
CN108197330A (en) * | 2014-11-10 | 2018-06-22 | 北京字节跳动网络技术有限公司 | Data digging method and device based on social platform |
CN104317959A (en) * | 2014-11-10 | 2015-01-28 | 北京字节跳动网络技术有限公司 | Data mining method and device based on social platform |
CN108197330B (en) * | 2014-11-10 | 2019-10-29 | 北京字节跳动网络技术有限公司 | Data digging method and device based on social platform |
US10360230B2 (en) | 2014-11-10 | 2019-07-23 | Beijing Bytedance Network Technology Co., Ltd. | Method and device for social platform-based data mining |
CN104408149A (en) * | 2014-12-04 | 2015-03-11 | 威海北洋电气集团股份有限公司 | Criminal suspect mining association method and system based on social network analysis |
CN104408149B (en) * | 2014-12-04 | 2017-12-12 | 威海北洋电气集团股份有限公司 | Suspect based on social network analysis excavates correlating method and system |
WO2016127331A1 (en) * | 2015-02-11 | 2016-08-18 | 深圳市仁盟互动网络科技有限公司 | Trusted recommendation-based method and system for adding friends on a social network |
CN104834967A (en) * | 2015-04-24 | 2015-08-12 | 南京邮电大学 | User similarity-based business behavior prediction method under ubiquitous network |
CN104966125B (en) * | 2015-05-06 | 2018-07-24 | 同济大学 | A kind of article scoring of social networks and recommend method |
CN105045805A (en) * | 2015-06-03 | 2015-11-11 | 安徽师范大学 | Construction method for trust recommendation model based on mobile communications and construction system thereof |
CN105045805B (en) * | 2015-06-03 | 2018-07-24 | 安徽师范大学 | The construction method and its structure system of trust recommendation model based on mobile communication |
CN105025091A (en) * | 2015-06-26 | 2015-11-04 | 南京邮电大学 | Shop recommendation method based on position of mobile user |
CN106445961A (en) * | 2015-08-10 | 2017-02-22 | 北京奇虎科技有限公司 | News pushing method and device |
CN106445961B (en) * | 2015-08-10 | 2021-02-23 | 北京奇虎科技有限公司 | News pushing method and device |
CN105069125A (en) * | 2015-08-13 | 2015-11-18 | 上海斐讯数据通信技术有限公司 | Social network recommending method and social network recommending system |
CN105138684B (en) * | 2015-09-15 | 2018-12-14 | 联想(北京)有限公司 | A kind of information processing method and information processing unit |
CN105138684A (en) * | 2015-09-15 | 2015-12-09 | 联想(北京)有限公司 | Information processing method and device |
CN105528395A (en) * | 2015-11-30 | 2016-04-27 | 苏州大学 | Method and system for recommending potential consumers |
CN105718551A (en) * | 2016-01-19 | 2016-06-29 | 浙江工业大学 | Hadoop based social recommendation method |
CN107368499A (en) * | 2016-05-12 | 2017-11-21 | 中国移动通信集团广东有限公司 | A kind of client's tag modeling and recommendation method and device |
CN107368499B (en) * | 2016-05-12 | 2020-12-01 | 中国移动通信集团广东有限公司 | Client label modeling and recommending method and device |
CN106056455A (en) * | 2016-06-02 | 2016-10-26 | 南京邮电大学 | Group and place recommendation method based on location and social relationship |
CN106126549A (en) * | 2016-06-16 | 2016-11-16 | 传化公路港物流有限公司 | A kind of community's trust recommendation method decomposed based on probability matrix and system thereof |
CN106126586A (en) * | 2016-06-21 | 2016-11-16 | 安徽师范大学 | A kind of social networks recommended models construction method trusted based on overall merit |
CN105956201A (en) * | 2016-06-22 | 2016-09-21 | Tcl集团股份有限公司 | Social network video recommending method and device |
CN106227792B (en) * | 2016-07-20 | 2019-10-15 | 百度在线网络技术(北京)有限公司 | Method and apparatus for pushed information |
CN106227792A (en) * | 2016-07-20 | 2016-12-14 | 百度在线网络技术(北京)有限公司 | Method and apparatus for pushed information |
CN107870934A (en) * | 2016-09-27 | 2018-04-03 | 武汉安天信息技术有限责任公司 | A kind of app user clusterings method and device |
CN107870934B (en) * | 2016-09-27 | 2021-07-20 | 武汉安天信息技术有限责任公司 | App user clustering method and device |
CN106528643A (en) * | 2016-10-13 | 2017-03-22 | 上海师范大学 | Social network based multi-dimension comprehensive recommending method |
CN106570090A (en) * | 2016-10-20 | 2017-04-19 | 杭州电子科技大学 | Method for collaborative filtering recommendation based on interest changes and trust relations |
CN106682121A (en) * | 2016-12-09 | 2017-05-17 | 广东工业大学 | Time utility recommendation method based on interest change of user |
CN107123057A (en) * | 2017-03-22 | 2017-09-01 | 阿里巴巴集团控股有限公司 | User recommends method and device |
CN108664484A (en) * | 2017-03-28 | 2018-10-16 | 腾讯科技(北京)有限公司 | Media content recommendations method and device |
US11182418B2 (en) | 2017-03-28 | 2021-11-23 | Tencent Technology (Shenzhen) Company Limited | Media content recommendation method and apparatus and storage medium |
CN107145541B (en) * | 2017-04-24 | 2020-07-28 | 安徽师范大学 | Social network recommendation model construction method based on hypergraph structure |
CN107145541A (en) * | 2017-04-24 | 2017-09-08 | 安徽师范大学 | Social networks recommended models construction method based on hypergraph structure |
CN107301583A (en) * | 2017-05-26 | 2017-10-27 | 重庆邮电大学 | It is a kind of that method is recommended based on user preference and the cold start-up trusted |
CN107301583B (en) * | 2017-05-26 | 2020-11-17 | 重庆邮电大学 | Cold start recommendation method based on user preference and trust |
CN107230002A (en) * | 2017-06-09 | 2017-10-03 | 天津大学 | Project-based rating matrix prediction algorithm |
CN107358533A (en) * | 2017-06-15 | 2017-11-17 | 桂林理工大学 | A kind of user of Web Community recommends method and system |
CN107330727A (en) * | 2017-06-30 | 2017-11-07 | 重庆邮电大学 | A kind of personalized recommendation method based on hidden semantic model |
CN107688901A (en) * | 2017-08-24 | 2018-02-13 | 北京小度信息科技有限公司 | Data adjustment method and device |
CN107688901B (en) * | 2017-08-24 | 2021-05-11 | 北京星选科技有限公司 | Data adjusting method and device |
CN107426338A (en) * | 2017-08-28 | 2017-12-01 | 江西博瑞彤芸科技有限公司 | A kind of information management method and system |
CN107506455A (en) * | 2017-08-29 | 2017-12-22 | 重庆邮电大学 | A kind of friend recommendation method for merging user social contact circle similarity |
CN109426985A (en) * | 2017-09-04 | 2019-03-05 | 腾讯科技(深圳)有限公司 | Information processing method, device, computer equipment and storage medium |
CN107657347B (en) * | 2017-09-30 | 2020-10-23 | 桂林电子科技大学 | Group-oriented travel recommendation method |
CN107657347A (en) * | 2017-09-30 | 2018-02-02 | 桂林电子科技大学 | Method is recommended in a kind of tourism towards group |
CN107862012A (en) * | 2017-10-30 | 2018-03-30 | 江苏大学 | A kind of information resources auto recommending method for group of college students |
WO2019085327A1 (en) * | 2017-11-01 | 2019-05-09 | 平安科技(深圳)有限公司 | Electronic device, product recommendation method and system, and computer readable storage medium |
CN107909428A (en) * | 2017-11-01 | 2018-04-13 | 平安科技(深圳)有限公司 | Electronic device, Products Show method and computer-readable recording medium |
CN108280533A (en) * | 2017-11-24 | 2018-07-13 | 浙江理工大学 | A kind of optimal configuration method for meeting the global external city vehicle community network community for trusting value constraint and recommending |
CN108090197B (en) * | 2017-12-22 | 2021-06-04 | 河南科技大学 | Community discovery method of multidimensional social network |
CN108090197A (en) * | 2017-12-22 | 2018-05-29 | 河南科技大学 | A kind of community discovery method of multidimensional social networks |
CN108197211A (en) * | 2017-12-28 | 2018-06-22 | 百度在线网络技术(北京)有限公司 | A kind of information recommendation method, device, server and storage medium |
CN108154425B (en) * | 2018-01-19 | 2021-03-26 | 广州天源信息科技股份有限公司 | Offline merchant recommendation method combining social network and location |
CN108154425A (en) * | 2018-01-19 | 2018-06-12 | 广州天源信息科技股份有限公司 | Method is recommended by the Xian Xia trade companies of a kind of combination community network and position |
CN108599991A (en) * | 2018-03-21 | 2018-09-28 | 安徽大学 | The key node searching method of Trust transitivity is influenced in social Internet of Things |
CN108599991B (en) * | 2018-03-21 | 2020-12-29 | 安徽大学 | Method for searching key nodes influencing trust transfer in social Internet of things |
CN108846042B (en) * | 2018-05-29 | 2021-09-14 | 昆明理工大学 | Social network recommendation method combined with user feedback mechanism |
CN108846042A (en) * | 2018-05-29 | 2018-11-20 | 昆明理工大学 | A kind of social networks recommended method of combination user feedback mechanisms |
CN109255073B (en) * | 2018-08-28 | 2022-03-29 | 麒麟合盛网络技术股份有限公司 | Personalized recommendation method and device and electronic equipment |
CN109255073A (en) * | 2018-08-28 | 2019-01-22 | 麒麟合盛网络技术股份有限公司 | A kind of personalized recommendation method, device and electronic equipment |
CN109712012B (en) * | 2018-09-28 | 2024-01-30 | 上海达家迎信息科技有限公司 | Social network partitioning method, device, equipment and storage medium |
CN109712012A (en) * | 2018-09-28 | 2019-05-03 | 上海达家迎信息科技有限公司 | Social networks division methods, device, equipment and storage medium |
CN109101667A (en) * | 2018-09-29 | 2018-12-28 | 新乡学院 | A kind of personalized recommendation method based on explicit trust and implicit trust |
CN109101667B (en) * | 2018-09-29 | 2021-07-09 | 新乡学院 | Personalized recommendation method based on explicit trust and implicit trust |
US11386212B2 (en) | 2018-10-17 | 2022-07-12 | Advanced New Technologies Co., Ltd. | Secure multi-party computation with no trusted initializer |
US10789377B2 (en) | 2018-10-17 | 2020-09-29 | Alibaba Group Holding Limited | Secret sharing with no trusted initializer |
CN109918562A (en) * | 2019-01-18 | 2019-06-21 | 重庆邮电大学 | A kind of recommended method based on communities of users and scoring joint community |
CN109918562B (en) * | 2019-01-18 | 2022-10-18 | 重庆邮电大学 | Recommendation method based on user community and scoring combined community |
CN109800356A (en) * | 2019-01-23 | 2019-05-24 | 国信优易数据有限公司 | A kind of information resources recommended method, device, equipment and storage medium |
CN111597428A (en) * | 2019-02-20 | 2020-08-28 | 中国科学院声学研究所 | Recommendation method for splicing user and article with q-separation k sparsity |
CN111597428B (en) * | 2019-02-20 | 2023-10-27 | 郑州芯兰德网络科技有限公司 | Recommendation method for splicing user and article with q separation k sparseness |
CN109948067A (en) * | 2019-02-22 | 2019-06-28 | 哈尔滨工业大学(深圳) | The information-pushing method and system of user's enigmatic language justice LR model are trusted in a kind of fusion |
CN109995663B (en) * | 2019-03-23 | 2020-04-07 | 西安电子科技大学 | Network information propagation method based on length constraint and no repeated path |
CN109995663A (en) * | 2019-03-23 | 2019-07-09 | 西安电子科技大学 | Spreading network information method based on length constraint and without duplicate paths |
CN111931035A (en) * | 2019-05-13 | 2020-11-13 | 中国移动通信集团湖北有限公司 | Service recommendation method, device and equipment |
CN111931035B (en) * | 2019-05-13 | 2023-11-24 | 中国移动通信集团湖北有限公司 | Service recommendation method, device and equipment |
CN110851701A (en) * | 2019-09-25 | 2020-02-28 | 浙江工业大学 | Probability matrix decomposition recommendation method based on user context coupling similarity |
CN111143670A (en) * | 2019-12-09 | 2020-05-12 | 中国平安财产保险股份有限公司 | Information determination method and related product |
CN111259133A (en) * | 2020-01-17 | 2020-06-09 | 成都信息工程大学 | Personalized recommendation method integrating multiple information |
CN111639251B (en) * | 2020-06-16 | 2023-09-29 | 李忠耘 | Information retrieval method and device |
CN111639251A (en) * | 2020-06-16 | 2020-09-08 | 李忠耘 | Information retrieval method and device |
CN112989208B (en) * | 2021-04-30 | 2021-08-06 | 武汉卓尔数字传媒科技有限公司 | Information recommendation method and device, electronic equipment and storage medium |
CN112989208A (en) * | 2021-04-30 | 2021-06-18 | 武汉卓尔数字传媒科技有限公司 | Information recommendation method and device, electronic equipment and storage medium |
CN113689305A (en) * | 2021-07-24 | 2021-11-23 | 深圳市思晓信息技术有限公司 | Security management method and system for social network |
CN117876029A (en) * | 2024-03-12 | 2024-04-12 | 南京摆渡人网络信息技术有限公司 | Man-machine interaction optimization system, method and device based on commodity popularization |
CN117876029B (en) * | 2024-03-12 | 2024-05-07 | 南京摆渡人网络信息技术有限公司 | Man-machine interaction optimization system, method and device based on commodity popularization |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103995823A (en) | Information recommending method based on social network | |
CN111881350B (en) | Recommendation method and system based on mixed graph structured modeling | |
CN112861967B (en) | Social network abnormal user detection method and device based on heterogeneous graph neural network | |
CN104966125B (en) | A kind of article scoring of social networks and recommend method | |
CN110955829B (en) | Point-of-interest recommendation method and system integrating trust and metric factor matrix decomposition | |
CN108920503A (en) | A kind of micro- video personalized recommendation algorithm based on social networks degree of belief | |
CN106649540B (en) | Video recommendation method and system | |
Roy et al. | Development of trust scores in social media (TSM) algorithm and application to advertising practice and research | |
Xu et al. | Integrated collaborative filtering recommendation in social cyber-physical systems | |
CN101916256A (en) | Community discovery method for synthesizing actor interests and network topology | |
CN107346333B (en) | Online social network friend recommendation method and system based on link prediction | |
KR101356948B1 (en) | User interest inference method and system in sns using topics on social activities with neighbors | |
CN102135999A (en) | User credibility and item nearest neighbor combination Internet recommendation method | |
Agarwal et al. | Trust-enhanced recommendation of friends in web based social networks using genetic algorithms to learn user preferences | |
CN105913159A (en) | Social network event based user's influence prediction method | |
Meng et al. | A method to solve cold-start problem in recommendation system based on social network sub-community and ontology decision model | |
KR101953802B1 (en) | Method and apparatus for recommending item using implicit and explicit signed trust relationships | |
Prando et al. | Content-based Recommender System using Social Networks for Cold-start Users. | |
Lee et al. | Trustor clustering with an improved recommender system based on social relationships | |
CN107145541A (en) | Social networks recommended models construction method based on hypergraph structure | |
Neve et al. | Hybrid reciprocal recommender systems: Integrating item-to-user principles in reciprocal recommendation | |
CN113342994B (en) | Recommendation system based on non-sampling cooperative knowledge graph network | |
CN103942298A (en) | Recommendation method and system based on linear regression | |
Bahari Sojahrood et al. | Behavior‐based POI recommendation for small groups in location‐based social networks | |
CN104394162B (en) | Service quality credibility considered network service selection method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140820 |
|
RJ01 | Rejection of invention patent application after publication |