Data mining for player modeling in videogames

PCI 2009 - 13th Panhellenic Conference on Informatics

Volumn , Issue , 2009, Pages 30-34

  Anagnostou, Kostas ^a   Maragoudakis, Manolis ^b  

^a Ionian University   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING METHODS; GAME PLAYERS; PLAYER MODELING; VIDEO GAME;

CURING; INTERFACES (COMPUTER);

COMPUTER PERIPHERAL EQUIPMENT;

EID: 70849107680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCI.2009.28     Document Type: Conference Paper

References (17)

1. Ernest Adams, The Designer's Notebook: Difficulty Modes and Dynamic Difficulty Adjustment, Gamasutra, May 14,2008, http://www.gamasutra.com/view/ feature/3660/the designers noteboo k.php?page=1
2. B. Cowley, D. Charles, M. Black, and R. Hickey, "User-System- Experience Model for User Centered Design in Computer Games," Adaptive Hypermedia and Adaptive Web-Based Systems, 2006, pp. 419-424.
3. M. Csikszentmihalyi, Flow: The Psychology of Optimal Experience. Harper & Row Publishers Inc., New York, NY, USA, 1990.
4. B. Cowley, D. Charles, M. Black, and R. Hickey, "Toward an understanding of flow in video games," Comput. Entertain., vol. 6, 2008, pp. 1-27.
5. G.N. Yannakakis and M. Maragoudakis, "Player Modeling Impact on Player's Entertainment in Computer Games," User Modeling 2005, 2005, pp. 74-78
6. D. Charles and M. Black: Dynamic player modelling: A framework for player-centric digital games. In Proceedings of the International Conference on Computer Games: Artificial Intelligence, Design and Education (2004) 29-35
7. R. Houlette, Player Modeling for Adaptive Games. AI Game Programming Wisdom II, Charles River Media, Inc (2004) 557-566
8. C M Bateman and R Boon, 21st Century Game Design, Charles River Media, 2005.
9. Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, New Jersey, 1988.
10. Raymond T. Ng and Jiawei Han. Efficient and effective clustering methods for spatial data mining. In Proc. of the VLDB Conference, Santiago, Chile, September 1994.
11. Tian Zhang, Raghu Ramakrishnan, and Miron Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 103-114, Montreal, Canada, June 1996.
12. Hartigan, J. A.; Wong, M. A. (1979). "Algorithm AS 136: A KMeans Clustering Algorithm". Applied Statistics 28 (1): 100-108.
13. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 73--84, New York, 1998.
14. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. 2nd edition, McGraw-Hill Book Company, Boston, MA, 2001.
15. T. Sellis, N. Roussopoulos, and C. Faioutsos. The R+ tree: a dynamic index for multi-dimensional objects. In Proc. 13th Int'l Conference on VLDB, pages 507-518, England, 1987.
16. N. Beckmann, H.-P. Kriegei, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. of ACM SIGMOD, pages 322-331, Atlantic City, NJ, May 1990.
17. Hanan Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Company, Inc., New York, 1990