Browsing by Author "Tsai, Hsiao-Ping"

Now showing 1 - 2 of 2

An Expected Win Rate-Based Real Time Bidding Strategy for Branding Campaign by the Model-Free Reinforcement Learning Model
(2020-01-01)
Shih, Wen-Yueh
;
Lu, Yi-Shu
;
Tsai, Hsiao-Ping
;
Huang, Jiun-Long
;
資訊工程學系
The bidding strategy plays the most important role to help the Demand Side Platforms (DSPs) making bidding decisions on a large number of bid requests in Real Time Bidding (RTB) to satisfy the different objectives of campaigns under the lifetime and budget constraints. In this paper, we focus on branding campaign whose objective is to obtain as many impressions as possible under the lifetime and budget constraints. To achieve the objectives of branding campaigns, we propose a novel expected win rate-based bidding strategy for branding campaign under the lifetime and budget constraints by utilizing a model-free reinforcement learning model. Specifically, to prevent missing good opportunities resulting from submitting extremely low bid prices, the concept of the base winning price is introduced to determine the lower bound of expected winning price. In addition, to obtain more impressions, the concept of the DSP-specified budget spending plan is proposed to determine the proper winning prices. The base expected win rate is then calculated based on the base winning price and the winning price determined by the DSP-specified budget spending plan. Since RTB is a dynamic environment, we propose a novel expected win rate-based bidding strategy named EWDQN which utilizes Deep Q Network (DQN) to dynamically determine the expected win rate according to the base expected win rate and the current status of the RTB market, and then determines the bid price according to the expected win rate. To the best of our knowledge, this is the first research applying the reinforcement learning technique on the bidding strategies for branding campaign. To measure the performance of EWDQN, several experiments are conducted on two real datasets. Experimental results show that EWDQN outperforms the-state-of-the-art bidding strategies for branding campaign in terms of the number of obtained impressions and CPM (cost per thousand impressions).
Exploring group moving pattern for an energy-constrained object tracking sensor network
(2007)
Tsai, Hsiao-Ping
;
Yang, De-Nian
;
Peng, Wen-Chih
;
Chen, Ming-Syan
;
交大名義發表
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object tracking sensor network (OTSN). We propose a novel mining algorithm that consists of a global mining and a local mining to leverage the group moving pattern. We use the VMM model together with Probabilistic Suffix Tree (PST) in learning the moving patterns, as well as Highly Connected Component (HCS) that is a clustering algorithm based on graph connectivity for moving pattern clustering in our mining algorithm. Based on the mined out group relationship and the group moving patterns, a hierarchically predict ion-based query algorithm and a group data aggregation algorithm are proposed. Our experiment results show that the energy consumption in terms of the communication cost for our system is better than that of the conventional query/update based OTSN, especially in the case that on-tracking objects have the group moving characteristics.