Abstract: A system and method for customized advertisement selection and delivery on the World Wide Web (WWW) upon the Internet. The advertising system has a database server which stores advertisements and their campaign information, and an advertisement server which generates electronic advertisements available to a client system. In the system, a customization process which customized the electronic advertisements to be delivered to each client system is performed. A user connects to a web site and is presented with an editorial page or a list of search results. The system inserts a customized advertisement into the page that matches the page content or search topic. No identifiable data is collected during the interaction with the user. Advertisers can specify display constraints for each advertisement. The system will adapt all unrestricted parameters in order to maximize the user's click-through probability.

Abstract: A banner advertisement selecting method is disclosed comprising the steps of (a) estimating the input probability of each attribute and the click rate of each advertisement for each attribute corresponding to an input attribute distribution of the banner advertisement and a click history of which the banner advertisement was clicked, (b) obtaining a display probability of each banner advertisement for each attribute so that the total click rate becomes maximum with conditions such as the desired number of display times of each banner advertisement being satisfied, (c) selecting a banner advertisement according to the display probability, and (d) transforming a restricted objective function maximizing problem obtained at step (b) to a transportation problem and solving the transportation problem.

Abstract: A broadcast program storing system, in which a combination of programs to be stored is optimized, and a program set that makes the degree of satisfaction of a user optimal can be stored, is provided. The broadcast program storing system provides a preference learning means that learns the preferences of a user for programs by viewing behavior of the user, a degree of preference predicting means for predicting the degree of preference of the user for each program from information of the program, and a storing planning means, which chooses a combination of programs by solving a temporally expanded knapsack problem that obtains a solution that the sum of the predicted degree of satisfaction in a planned schedule becomes maximal in a storing capacity having a bound when programs to be stored and programs to be deleted are decided.