Motivational factors of Australian mobile gamers
- Authors: Greenwood, Jordan , Achterbosch, Leigh , Meredith, Grant , Vamplew, Peter
- Date: 2020
- Type: Text , Conference proceedings , Conference paper
- Relation: Proceedings of the Australasian Computer Science Week Multiconference (ACSW 2020); Melbourne, Australia; 4th-6th February 2020 p. 6
- Full Text:
- Reviewed:
- Description: Mobile games are a fast growing industry, overtaking all other video game platforms with year on year increases in revenue. Many studies have been conducted to explore the motivations of why video games players play their selected games. However very little research has focused on mobile gamers. In addition, Australian studies on the topic are sparse. This paper aimed to discover what motivates a mobile gamer from the perspective of the initial motivational factors attracting them to a mobile game, and the motivational factors that provide interest to continue playing and thereby increase game longevity. A survey was conducted online for Australian participants, which attracted 123 respondents. The survey was formulated by focusing on the 12 key subcomponents as motivational factors of the Gamer Motivational Profile v2 model devised by Quantic Foundry. It was discovered that mobile gamers are a completely different breed of gamer in contrast to the general video gamer. Strategy and challenge which are subcomponents of mastery proved popular among all mobile gamers, while destruction and excitement, subcomponents of action, were often the least motivating factors of all. With the newly discovered data, perhaps mobile game developers can pursue the correct avenues of game design when catering to their target audience.
Categorical features transformation with compact one-hot encoder for fraud detection in distributed environment
- Authors: Ul Haq, Ikram , Gondal, Iqbal , Vamplew, Peter , Brown, Simon
- Date: 2019
- Type: Text , Conference proceedings , Conference paper
- Relation: 2019 16th Australasian Conference on Data Mining, AusDM 2018; Bathurst, NSW; 28 November 2018 through 30 November 2018 Vol. 996, p. 69-80
- Full Text: false
- Reviewed:
- Description: Fraud detection for online banking is an important research area, but one of the challenges is the heterogeneous nature of transactions data i.e. a combination of numeric as well as mixed attributes. Usually, numeric format data gives better performance for classification, regression and clustering algorithms. However, many machine learning problems have categorical, or nominal features, rather than numeric features only. In addition, some machine learning platforms such as Apache Spark accept numeric data only. One-hot Encoding (OHE) is a widely used approach for transforming categorical features to numerical features in traditional data mining tasks. The one-hot approach has some challenges as well: the sparseness of the transformed data and that the distinct values of an attribute are not always known in advance. Other than the model accuracy, compactness of machine learning models is equally important due to growing memory and storage needs. This paper presents an innovative technique to transform categorical features to numeric features by compacting sparse data even if all the distinct values are not known. The transformed data can be used for the development of fraud detection systems. The accuracy of the results has been validated on synthetic and real bank fraud data and a publicly available anomaly detection (KDD-99) dataset on a multi-node data cluster. © Springer Nature Singapore Pte Ltd. 2019.
Evolved similarity techniques in malware analysis
- Authors: Black, Paul , Gondal, Iqbal , Vamplew, Peter , Lakhotia, Arun
- Date: 2019
- Type: Text , Conference proceedings
- Relation: 2019 18th IEEE International Conference On Trust, Security And Privacy; published in In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE), 5-8th Aug, 2019 p. 404-410
- Full Text: false
- Reviewed:
- Description: Malware authors are known to reuse existing code, this development process results in software evolution and a sequence of versions of a malware family containing functions that show a divergence from the initial version. This paper proposes the term evolved similarity to account for this gradual divergence of similarity across the version history of a malware family. While existing techniques are able to match functions in different versions of malware, these techniques work best when the version changes are relatively small. This paper introduces the concept of evolved similarity and presents automated Evolved Similarity Techniques (EST). EST differs from existing malware function similarity techniques by focusing on the identification of significantly modified functions in adjacent malware versions and may also be used to identify function similarity in malware samples that differ by several versions. The challenge in identifying evolved malware function pairs lies in identifying features that are relatively invariant across evolved code. The research in this paper makes use of the function call graph to establish these features and then demonstrates the use of these techniques using Zeus malware.
Integrating biological heuristics and gene expression data for gene regulatory network inference
- Authors: Zarnegar, Armita , Jelinek, Herbert , Vamplew, Peter , Stranieri, Andrew
- Date: 2019
- Type: Text , Conference proceedings , Conference paper
- Relation: 2019 Australasian Computer Science Week Multiconference, ACSW 2019; Sydney, Australia; 29th-31st January 2019 p. 1-10
- Full Text: false
- Reviewed:
- Description: Gene Regulatory Networks (GRNs) offer enhanced insight into the biological functions and biochemical pathways of cells associated with gene regulatory mechanisms. However, obtaining accurate GRNs that explain gene expressions and functional associations remains a difficult task. Only a few studies have incorporated heuristics into a GRN discovery process. Doing so has the potential to improve accuracy and reduce the search space and computational time. A technique for GRN discovery that integrates heuristic information into the discovery process is advanced. The approach incorporates three elements: 1) a novel 2D visualized coexpression function that measures the association between genes; 2) a post-processing step that improves detection of up, down and self-regulation and 3) the application of heuristics to generate a Hub network as the backbone of the GRN. Using available microarray and next generation sequencing data from Escherichia coli, six synthetic benchmark GRN datasets were generated with the neighborhood addition and cluster addition methods available in SynTReN. Results of the novel 2D-visualization co-expression function were compared with results obtained using Pearson's correlation and mutual information. The performance of the biological genetics-based heuristics consisting of the 2D-Visualized Co-expression function, post-processing and Hub network was then evaluated by comparing the performance to the GRNs obtained by ARACNe and CLR. The 2D-Visualized Co-expression function significantly improved gene-gene association matching compared to Pearson's correlation coefficient (t = 3.46, df = 5, p = 0.02) and Mutual Information (t = 4.42, df = 5, p = 0.007). The heuristics model gave a 60% improvement against ARACNe (p = 0.02) and CLR (p = 0.019). Analysis of Escherichia coli data suggests that the GRN discovery technique proposed is capable of identifying significant transcriptional regulatory interactions and the corresponding regulatory networks.
An anomaly intrusion detection system using C5 decision tree classifier
- Authors: Khraisat, Ansam , Gondal, Iqbal , Vamplew, Peter
- Date: 2018
- Type: Text , Conference proceedings , Conference paper
- Relation: 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2018; Melbourne, Australia; 3rd June 2018; published in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11154 LNAI, p. 149-155
- Full Text: false
- Reviewed:
- Description: Due to increase in intrusion activities over internet, many intrusion detection systems are proposed to detect abnormal activities, but most of these detection systems suffer a common problem which is producing a high number of alerts and a huge number of false positives. As a result, normal activities could be classified as intrusion activities. This paper examines different data mining techniques that could minimize both the number of false negatives and false positives. C5 classifier’s effectiveness is examined and compared with other classifiers. Results should that false negatives are reduced and intrusion detection has been improved significantly. A consequence of minimizing the false positives has resulted in reduction in the amount of the false alerts as well. In this study, multiple classifiers have been compared with C5 decision tree classifier using NSL_KDD dataset and results have shown that C5 has achieved high accuracy and low false alarms as an intrusion detection system.
- Description: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Rapid anomaly detection using integrated prudence analysis (IPA)
- Authors: Maruatona, Omaru , Vamplew, Peter , Dazeley, Richard , Watters, Paul
- Date: 2018
- Type: Text , Conference proceedings
- Relation: PAKDD 2018.Trends and Applications in Knowledge Discovery and Data Mining. p. 137-141
- Full Text: false
- Reviewed:
- Description: Integrated Prudence Analysis has been proposed as a method to maximize the accuracy of rule based systems. The paper presents evaluation results of the three Prudence methods on public datasets which demonstrate that combining attribute-based and structural Prudence produces a net improvement in Prudence Accuracy.
A heuristic gene regulatory networks model for cardiac function and pathology
- Authors: Zarnegar, Armita , Vamplew, Peter , Stranieri, Andrew , Jelinek, Herbert
- Date: 2016
- Type: Text , Conference proceedings
- Relation: 2016 Computing in Cardiology Conference (CinC); Vancouver; 11-14th Sept, 2016
- Full Text: false
- Reviewed:
- Description: Genome-wide association studies (GWAS) and next-generation sequencing (NGS) has led to an increase in information about the human genome and cardiovascular disease. Understanding the role of genes in cardiac function and pathology requires modeling gene interactions and identification of regulatory genes as part of a gene regulatory network (GRN). Feature selection and data reduction not sufficient and require domain knowledge to deal with large data. We propose three novel innovations in constructing a GRN based on heuristics. A 2D Visualised Co-regulation function. Post-processing to identify gene-gene interactions. Finally a threshold algorithm is applied to identify the hub genes that provide the backbone of the GRN. The 2D Visualized Co-regulation function performed significantly better compared to the Pearson's correlation for measuring pairwise associations (t=3.46, df=5, p=0.018). The F-measure, improved from 0.11 to 0.12. The hub network provided a 60% improvement to that reported in the literature. The performance of the hub network was then also compared against ARACNe and performed significantly better (p=0.024). We conclude that a heuristics approach in developing GRNs has potential to improve our understanding of gene regulation and interaction in diverse biological function and disease.
Prudent fraud detection in internet banking
- Authors: Maruatona, Omaru , Vamplew, Peter , Dazeley, Richard
- Date: 2012
- Type: Text , Conference proceedings
- Full Text:
- Description: Most commercial Fraud Detection components of Internet banking systems use some kind of hybrid setup usually comprising a Rule-Base and an Artificial Neural Network. Such rule bases have been criticised for a lack of innovation in their approach to Knowledge Acquisition and maintenance. Furthermore, the systems are brittle; they have no way of knowing when a previously unseen set of fraud patterns is beyond their current knowledge. This limitation may have far reaching consequences in an online banking system. This paper presents a viable alternative to brittleness in Knowledge Based Systems; a potential milestone in the rapid detection of unique and novel fraud patterns in Internet banking. The experiments conducted with real online banking transaction log files suggest that Prudent based fraud detection may be a worthy alternative in online banking. © 2012 IEEE.
- Description: 2003010883
Reinforcement learning approach to AIBO robot's decision making process in Robosoccer's goal keeper problem
- Authors: Mukherjee, Subhasis , Yearwood, John , Vamplew, Peter , Huda, Shamsul
- Date: 2011
- Type: Text , Conference proceedings
- Full Text: false
- Description: Robocup is a popular test bed for AI programs around the world. Robosoccer is one of the two major parts of Robocup, in which AIBO entertainment robots take part in the middle sized soccer event. The three key challenges that robots need to face in this event are manoeuvrability, image recognition and decision making skills. This paper focuses on the decision making problem in Robosoccer - The goal keeper problem. We investigate whether reinforcement learning (RL) as a form of semi-supervised learning can effectively contribute to the goal keeper's decision making process when penalty shot and two attacker problem are considered. Currently, the decision making process in Robosoccer is carried out using rule-base system. RL also is used for quadruped locomotion and navigation purpose in Robosoccer using AIBO. In this paper, we propose a reinforcement learning based approach that uses a dynamic state-action mapping using back propagation of reward and space quantized Q-learning (SQQL) for the choice of high level functions in order to save the goal. The novelty of our approach is that the agent learns while playing and can take independent decision which overcomes the limitations of rule-base system due to fixed and limited predefined decision rules. Performance of the proposed method has been verified against the bench mark data set made with Upenn'03 code logic. It was found that the efficiency of our SQQL approach in goalkeeping was better than the rule based approach. The SQQL develops a semi-supervised learning process over the rule-base system's input-output mapping process, given in the Upenn'03 code. © 2011 IEEE.
Automatic sleep stage identification: difficulties and possible solutions
- Authors: Sukhorukova, Nadezda , Stranieri, Andrew , Ofoghi, Bahadorreza , Vamplew, Peter , Saleem, Muhammad Saad , Ma, Liping , Ugon, Adrien , Ugon, Julien , Muecke, Nial , Amiel, Hélène , Philippe, Carole , Bani-Mustafa, Ahmed , Huda, Shamsul , Bertoli, Marcello , Levy, P , Ganascia, J.G
- Date: 2010
- Type: Text , Conference proceedings
- Full Text:
- Description: The diagnosis of many sleep disorders is a labour intensive task that involves the specialised interpretation of numerous signals including brain wave, breath and heart rate captured in overnight polysomnogram sessions. The automation of diagnoses is challenging for data mining algorithms because the data sets are extremely large and noisy, the signals are complex and specialist's analyses vary. This work reports on the adaptation of approaches from four fields; neural networks, mathematical optimisation, financial forecasting and frequency domain analysis to the problem of automatically determing a patient's stage of sleep. Results, though preliminary, are promising and indicate that combined approaches may prove more fruitful than the reliance on a approach.