摘要:
Described herein are various techniques for automatically generating recommendations for a user based upon a social network of the user. A user can request a recommendation for a particular context, and a social network of the user can be automatically pared to create a subnetwork, wherein individuals in the subnetwork have provided ratings for the particular context and/or contexts that are in some way related to the particular context. The knowledge/ratings of individuals in the subnetwork may then be leveraged to automatically generate the recommendation for the particular context.
摘要:
Systems and methods that analyze aggregated item evaluation behavior of users, to suggest a recommendation for the item. An analysis component forms a collective opinion by taking as input votes of users and trusted relationships established therebetween, to output an evaluation and/or recommendation for the item. Accordingly, within a linked structure of nodes, personalized recommendations to users (e.g., agents) are supplied about an item(s) based upon the opinions/reviews of other users, and in conjunction with the declared trust between the users.
摘要:
Systems and methods that analyze aggregated item evaluation behavior of users, to suggest a recommendation for the item. An analysis component forms a collective opinion by taking as input votes of users and trusted relationships established therebetween, to output an evaluation and/or recommendation for the item. Accordingly, within a linked structure of nodes, personalized recommendations to users (e.g., agents) are supplied about an item(s) based upon the opinions/reviews of other users, and in conjunction with the declared trust between the users.
摘要:
The subject disclosure is directed towards ranking electronic documents in sub-linear time complexity. An advertising provider may perform such a ranking in order to identify one or more electronic document to advertise a product or service. A ranking mechanism may execute a number of random walks around the Internet by navigating the electronic documents via embedded links from a starting document and an ending document that are within a pre-determined distance. After finishing the random walks, an estimate of rank contribution information associated with each electronic document is provided. The estimated rank contribution information is used to determine an exposure level with respect to a network for one or more of the electronic documents. The exposure value of an example electronic document may correspond to a ranking value that may be computed using a sample of the rank contribution information related to that document.
摘要:
A system and/or methodology that exploits user interaction within a social network in order to derive profits. The invention provides for increased flow of money through a social network, and simultaneously allows advertisers and merchants to focus their advertising spending within the social network. Additionally, the invention provides for quantitative measurement of the effects of relational proximity marketing /advertising (RPM), and creates incentives for users to purchase goods through the social network.
摘要:
The claimed subject matter provides a system and/or a method that facilitates reducing spam in search results. An interface can obtain web graph information that represents a web of pages. A spam detection component can determines one or more features based at least in part on the web graph information. The one or more features can provide indications that a particular page of the web graph is spam. In addition, a robust rank component is provided that limits amount of contribution a single page can provide to the target page.
摘要:
Systems and methods for generating models of directed scale-free object relationships are described. In one aspect, a sequence of random numbers is generated. Individual ones of these random numbers are then selected over time to generate the directed scale-free object relationships as a graph based on sequences of in-degrees and out-degrees.
摘要:
The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.
摘要:
The claimed subject matter provides a unified platform system and/or a method that facilitates optimizing an online transaction. The unified platform system can include a secured transaction component that can secure a portion of transactional data related to an online transaction between at least one buyer and at least one merchant utilizing a secure transaction technique. The unified platform system can include a reputation assessment component that can receive a portion of reputation data related to at least one of the buyer or the merchant based at least in part upon verifying completion of the online transaction between such buyer and merchant. The unified platform system can publish the portion of reputation data coupled with a portion of non-private transactional data to provide context for the reputation data.
摘要:
The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.