Abstract: A resource processing method and apparatus. The method is achieved by a computer configured to execute the following steps: generating a resource allocation chart based on a resource allocation request; processing the resource allocation chart and generating an access entrance of the resource allocation chart; opening the access entrance to enable at least one third party resource supplier to respond to the resource allocation request via the access entrance. The method further comprises: when the resources are not available or not suitable for allocation, receiving a resource allocation chart, wherein the resource allocation chart is based on the resource allocation request; generating an access entrance of the resource allocation chart; opening the access entrance to at least one third party resource supplier; and receiving the allocated resources from the at least one third party resource supplier by responding to the resource allocation request through the access entrance.

Abstract: The method includes: collecting historical operations of sample users for M items, and predicting a preference value of a target user for each of the M items according to historical operations of the sample users for each of the M items, collecting classification data of N to-be-recommended items, and classifying the N to-be-recommended items according to the classification data of the N to-be-recommended items, to obtain X themes, where each of the X themes includes at least one of the N to-be-recommended items, and the N to-be-recommended items are some or all of the M items; calculating a preference value of the target user for each of the X themes according to a preference value of the target user for a to-be-recommended item included in each of the X themes; and pushing a target theme to the target user.

Abstract: The method includes: collecting historical operations of sample users for M items, and predicting a preference value of a target user for each of the M items according to historical operations of the sample users for each of the M items, collecting classification data of N to-be-recommended items, and classifying the N to-be-recommended items according to the classification data of the N to-be-recommended items, to obtain X themes, where each of the X themes includes at least one of the N to-be-recommended items, and the N to-be-recommended items are some or all of the M items; calculating a preference value of the target user for each of the X themes according to a preference value of the target user for a to-be-recommended item included in each of the X themes; and pushing a target theme to the target user.

Abstract: An application sorting method and apparatus are provided. The method includes: obtaining, a positive operation probability and positive operation feedback information of each of at least two data samples; calculating an uncertainty parameter of a positive operation probability of a first data sample based on the positive operation probabilities and the positive operation feedback information of the at least two data samples and feature indication information of at least one same feature in a plurality of features in the at least two data samples; and correcting the positive operation probability of the first data sample by using the uncertainty parameter of the positive operation probability; and sorting, based on corrected positive operation probabilities, application programs corresponding to the at least two data samples.

Abstract: A route planning method includes obtaining exercise capability information of a wearer and one or more candidate routes, where the candidate routes include attribute features that comprise historical exercise capability information, where the historical exercise capability information is information calculated according to a first preset rule and based on obtained exercise capability information of a plurality of users having exercised along the candidate routes; determining a target route based on the attribute features of the candidate routes and the exercise capability information of the wearer; and outputting the target route information.

Abstract: A route planning method includes obtaining exercise capability information of a wearer and one or more candidate routes, where the candidate routes include attribute features that comprise historical exercise capability information, where the historical exercise capability information is information calculated according to a first preset rule and based on obtained exercise capability information of a plurality of users having exercised along the candidate routes; determining a target route based on the attribute features of the candidate routes and the exercise capability information of the wearer; and outputting the target route information.

Abstract: An application sorting method and apparatus are provided. The method includes: obtaining, a positive operation probability and positive operation feedback information of each of at least two data samples; calculating an uncertainty parameter of a positive operation probability of a first data sample based on the positive operation probabilities and the positive operation feedback information of the at least two data samples and feature indication information of at least one same feature in a plurality of features in the at least two data samples; and correcting the positive operation probability of the first data sample by using the uncertainty parameter of the positive operation probability; and sorting, based on corrected positive operation probabilities, application programs corresponding to the at least two data samples.

Abstract: The method includes: collecting historical operations of sample users for M items, and predicting a preference value of a target user for each of the M items according to historical operations of the sample users for each of the M items, collecting classification data of N to-be-recommended items, and classifying the N to-be-recommended items according to the classification data of the N to-be-recommended items, to obtain X themes, where each of the X themes includes at least one of the N to-be-recommended items, and the N to-be-recommended items are some or all of the M items; calculating a preference value of the target user for each of the X themes according to a preference value of the target user for a to-be-recommended item included in each of the X themes; and pushing a target theme to the target user.

Abstract: An advertisement management server in a communication system receives information of advertisements, determines an advertising value calculation policy, estimates a value of an advertising value element according to the information of each advertisement, calculates a value of each advertisement using the value of the advertising value element and the advertising value calculation policy as reference factors. The server instructs the communication system to broadcast the advertisements for displaying on the user terminals according to the calculated value of each advertisement.

Abstract: An address book ranking method and apparatus are provided, which relate to the field of communications technologies and are convenient for a user to quickly find a desired contact when a capacity of an address book is large. The address book ranking method includes acquiring profile information and communication information of contacts in an address book; and ranking the contact according to the profile information and the communication information. The present invention may be applied to an address book.

Abstract: Embodiments of the present invention apply to the field of social networks, and provide a method and a system for mining a topic core circle in a social network, where the method includes: creating a social network diagram; selecting a node from the social network diagram as a first node of a core circle, adding a second node that has most connections with the first node to the core circle, adding a third node to the core circle, and performing similar operations until an Nth node outside the core circle is added to the core circle, where the N is a preset number of nodes included in the core circle; and performing topic clustering for the core circle including N nodes. By adopting the embodiments of the present invention, core circles with a similar topic and a close relationship in the social network can be effectively mined.