Computerized Interactive Gaming via Supporting Vector Machines

  • Jiang Y
  • Jiang J
  • Palmer I
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Computerized interactive gaming requires automatic processing of large volume of random data produced by players on spot, such as shooting, football kicking, and boxing. This paper describes a supporting vector machine‐based artificial intelligence algorithm as one of the possible solutions to the problem of random data processing and the provision of interactive indication for further actions. In comparison with existing techniques, such as rule‐based and neural networks, and so forth, our SVM‐based interactive gaming algorithm has the features of (i) high‐speed processing, providing instant response to the players, (ii) winner selection and control by one parameter, which can be predesigned and adjusted according to the needs of interaction and game design or specific level of difficulties, and (iii) detection of interaction points is adaptive to the input changes, and no labelled training data is required. Experiments on numerical simulation support that the proposed algorithm is robust to random noise, accurate in picking up winning data, and convenient for all interactive gaming designs.

Cite

CITATION STYLE

APA

Jiang, Y., Jiang, J., & Palmer, I. J. (2008). Computerized Interactive Gaming via Supporting Vector Machines. International Journal of Computer Games Technology, 2008(1). https://doi.org/10.1155/2008/186941

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free