Applying RkNN query approach for target recommendation on role-playing on-line games

• Main Authors: Chih-chung Wang, 王致中
• Other Authors: Yu-Lung Lo
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/99382129902986715862

碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 96 === The industry of the on-line games has vast business opportunity which makes the on-line game products on the market to be in great demand in recent years. In the on-line game, there over one half of all on-line games are role acting types. The disputes may occur that the players do not know each others and they may choose the same target to attack. Nearest Neighbor (NN) queries is used to find the object which is the nearest one. By this way of NN query, a lot of on-line games offer players to choose or recommend players to carry on the attack action to the monsters. However, the conflicts of attacking the same target by players are always happen by applying NN query. Reverse k-Nearest Neighbor (RkNN) query is used to find the objects which the query object is the k-nearest neighbor to them. In this research, we propose the RkNN query approaches to address the problem of attacking the same target by players in on-line games. Our experimental results show that our approaches are more efficiency to help players to gain the better game scores.