Large scale modeling of genetic networks using gene knockout data
- Authors: Youseph, Ahammed , Chetty, Madhu , Karmakar, Gour
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 Australasian Computer Science Week Multiconference, ACSW 2018; Brisbane, Australia; 29th January-2nd February 2018; published in ACM International Conference Proceedings Series
- Full Text: false
- Reviewed:
- Description: Gene regulatory network (GRN) represents a set of genes and their regulatory interactions. The inference of the regulatory interactions between genes is usually carried out as an optimization problem using an appropriate mathematical model and the time-series gene expression data. Among the various models proposed for GRN inference, our recently proposed Michaelis-Menten kinetics based ODE model provides a good trade-off between the computational complexity and biological relevance. This model, like other known GRN models, also uses an evolutionary algorithm for parameter estimation. Since the search space for large networks is huge, leading to a low accuracy of inference, it is important to reduce the search region for improved performance of the optimization algorithm. In this paper, we propose a classification method using gene knockout data to eliminate a large infeasible region from the optimization search area. We also propose a method for partial inference of regulations when all the regulators of a given regulated gene are unregulated genes. The proposed method is evaluated by reconstructing in silico networks of large sizes. © 2018 ACM.
Analytics service oriented architecture for enterprise information systems
- Authors: Sun, Zhaohao , Strang, Kenneth , Yearwood, John
- Date: 2014
- Type: Text , Conference paper
- Relation: 16th International Conference on Information Integration and Web-based Applications & Services
- Full Text: false
- Reviewed:
- Description: Big data analytics and business analytics are disruptive technology and innovative solution for enterprise development. However, what is the relationship between big data analytics and business analytics? What is the relationship between business analytics and enterprise information systems (EIS)? How can business analytics enhance the development of EIS? These are still big issues for EIS development. This paper addresses these three issues by proposing an ontology of business analytics, presenting an analytics service-oriented architecture (ASOA) and applying ASOA to EIS, where our surveyed data analysis showed that the proposed ASOA can enhance to develop EIS. This paper also discusses the interrelationship between data analysis and business analytics, and between data analytics and big data analytics. The proposed approaches in this paper will facilitate research and development of EIS, business analytics, big data analytics, and business intelligence.
Using e-learning to engage unemployed rural women in aquaculture in Bangladesh to reduce poverty
- Authors: Rupok, Quazi , Chowdhury, Abdullahi
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 1st International Conference on Data Science, E-Learning and Information Systems, DATA 2018; Madrid, Spain; 1st-2nd October 2018; published in ACM International Conference Proceeding Series p. 1-6
- Full Text: false
- Reviewed:
- Description: Even though half of the population of Bangladesh is women, most of them are not working as paid employee or working as business owner. The main reason is that most of them are in rural area and unable to get proper education. This paper aims to develop a model that can assist different government organizations to assist those unemployed rural women to get involved in fisheries industries. This will help them to get proper information to get some income from whatever resources they have nearby for generate income from aquaculture.
- Description: ACM International Conference Proceeding Series
Cybersecurity indexes for eHealth
- Authors: Burke, Wendy , Oseni, Taiwo , Jolfaei, Alireza , Gondal, Iqbal
- Date: 2019
- Type: Text , Conference proceedings
- Relation: 2019 Australasian Computer Science Week Multiconference, ACSW 2019; Sydney, Australia; 29th-31st January 2019 p. 1-8
- Full Text: false
- Reviewed:
- Description: This study aimed to explore the cybersecurity landscape to identify cybersecurity indexes that may be relevant to the health industry. While the healthcare sector poses security concerns regarding patients' records, cybersecurity in the healthcare sector has not been given much consideration. Cybersecurity indexes are a survey that measures security preparedness and capabilities of a country or organisation. An index is made up of a series of questions, often broken into categories. These categories target areas such as law, technical responses, organisational threats, capacity building and social context. Some indexes provide ranking capabilities against other countries, while others directly evaluate what it means to be cyber-ready. In this paper, cybersecurity indexes were reviewed regarding the level of assessment (country level/organisation level), and their consideration of the wider community, the health sector, and their appearance in academic literature. Results from this study found that there was no consistency between the indexes investigated, with each index having a diverse number of categories and indicators. Some indexes resulted in a score; others did not rank their results in league tables. Evidence to calculate the level of adherence was often obtained from secondary sources, with four of the country indexes using both primary and secondary sources. Eight (out of fourteen) indexes measured wider community indicators and only one index specifically measured eHealth services. Findings from the initial systematic review suggest that hardly any peer-reviewed journal articles exist on the topic of cybersecurity indexes. The paper concludes that most of the indexes studied are broad and do not consider the eHealth sector specifically. Each index relies on a different process to gauge cybersecurity, with little to no academic rigour. It is expected that this research will contribute to the current (limited) literature addressing cybersecurity indexes.
- Description: ACM International Conference Proceeding Series
Isolation kernel and its effect on SVM
- Authors: Ting, Kaiming , Zhu, Yue , Zhou, Zhi-Hua
- Date: 2018
- Type: Text , Conference proceedings , Conference paper
- Relation: 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2018; London, United Kingdom; 19th-23th August 2018 p. 2329-2337
- Full Text: false
- Reviewed:
- Description: This paper investigates data dependent kernels that are derived directly from data. This has been an outstanding issue for about two decades which hampered the development of kernel-based methods. We introduce Isolation Kernel which is solely dependent on data distribution, requiring neither class information nor explicit learning to be a classifier. In contrast, existing data dependent kernels rely heavily on class information and explicit learning to produce a classifier. We show that Isolation Kernel approximates well to a data independent kernel function called Laplacian kernel under uniform density distribution. With this revelation, Isolation Kernel can be viewed as a data dependent kernel that adapts a data independent kernel to the structure of a dataset. We also provide a reason why the proposed new data dependent kernel enables SVM (which employs a kernel through other means) to improve its predictive accuracy. The key differences between Random Forest kernel and Isolation Kernel are discussed to examine the reasons why the latter is a more successful tree-based kernel.
Efficient HEVC scheme using motion type categorization
- Authors: Podder, Pallab , Paul, Manoranjan , Murshed, Manzur
- Date: 2014
- Type: Text , Conference proceedings
- Relation: 10th International Conference on emerging Networking EXperiments and Technologies (CoNEXT); Sydney, Australia; 2nd-5th December 2014; published in Proceedings of the 2014 Workshop on Design, Quality and Deployment of Adaptive Video Streaming p. 41-42
- Relation: http://purl.org/au-research/grants/arc/DP130103670
- Full Text:
- Reviewed:
- Description: High Efficiency Video Coding (HEVC) standard introduces a number of innovative tools which can reduce approximately 50% bit-rate compared to its predecessor H.264/AVC at the same perceptual video quality whereas the computational time has increased multiple times. To reduce the encoding time while preserving the expected video quality has become a real challenge today for video transmission and streaming especially using low-powered devices. Motion estimation (ME) and motion compensation (MC) using variable-size blocks (i.e., intermodes) require 60-80% of total computational time. In this paper we propose a new efficient intermode selection technique based on phase correlation and incorporate into HEVC framework to predict ME and MC modes and perform faster intermode selection based on three dissimilar motion types in different videos. Instead of exploring all the modes exhaustively we select a subset of modes using motion type and the final mode is selected based on the Lagrangian cost function. The experimental results show that compared to HEVC the average computational time can be downscaled by 34% while providing the similar rate-distortion (RD) performance.
Experimental analysis of task-based energy consumption in cloud computing systems
- Authors: Chen, Feifei , Grundy, John , Yang, Yun , Schneider, Jean-Guy , He, Qiang
- Date: 2013
- Type: Text , Conference paper
- Relation: 4th ACM/SPEC International Conference on Performance Engineering p. 295-306
- Full Text: false
- Reviewed:
- Description: Cloud computing delivers IT solutions as a utility to users. One consequence of this model is that large cloud data centres consume large amounts of energy and produce significant carbon footprints. A common objective of cloud providers is to develop resource provisioning and management solutions that minimise energy consumption while guaranteeing Service Level Agreements (SLAs). In order to achieve this objective, a thorough understanding of energy consumption patterns in complex cloud systems is imperative. We have developed an energy consumption model for cloud computing systems. To operationalise this model, we have conducted extensive experiments to profile the energy consumption in cloud computing systems based on three types of tasks: computation-intensive, data-intensive and communication-intensive tasks. We collected fine-grained energy consumption and performance data with varying system configurations and workloads. Our experimental results show the correlation coefficients of energy consumption, system configuration and workload, as well as system performance in cloud systems. These results can be used for designing energy consumption monitors, and static or dynamic system-level energy consumption optimisation strategies for green cloud computing systems.
Automatic Extraction of Buildings in an Urban Region
- Authors: Siddiqui, Fasahat , Teng, Shyh , Lu, Guojun , Awrangjeb, Mohammad
- Date: 2014
- Type: Text , Conference proceedings
- Relation: 29th International Conference on Image and Vision Computing New Zealand, IVCNZ 2014; Hamilton; New Zealand; 19th-21st November 2014; published in ACM International Conference Proceeding Series p. 178-183
- Full Text:
- Reviewed:
- Description: There are currently several automatic building extraction methods introduced in the literature, but none of them are capable to completely extract portions of a building that are below a pre-defined building minimum height threshold. This paper proposes a systematic method which analyzes the height differences between the extracted adjacent planes above and below the height threshold as well as the planes' connectivity, thereby, extracting all portions belonging to buildings more completely. In general, the height difference between the edges of the adjacent planes above and below the height threshold that belong to the same building is more uniform. In addition, the extracted planes below the height threshold that belong to a building and their adjacent ground planes also have a clear height difference. The proposed method incorporates such information to achieve better performance in building extraction. We have compared our proposed method to a current state-of-the-art building extraction method qualitatively and quantitatively. Our experimental results show that our proposed method successfully recovers portions of a building below the height threshold, thereby achieving relatively higher average completeness (an improvement of 1.14%) and quality (an improvement of 0.93%).
A3Graph : adversarial attributed autoencoder for graph representation learning
- Authors: Hou, Mingliang , Wang, Lei , Liu, Jiaying , Kong, Xiangjie , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 36th Annual ACM Symposium on Applied Computing, SAC 2021 p. 1697-1704
- Full Text:
- Reviewed:
- Description: Recent years have witnessed a proliferation of graph representation techniques in social network analysis. Graph representation aims to map nodes in the graph into low-dimensional vector space while preserving as much information as possible. However, most existing methods ignore the robustness of learned latent vectors, which leads to inferior representation results due to sparse and noisy data in graphs. In this paper, we propose a novel framework, named A3Graph, which aims to improve the robustness and stability of graph representations. Specifically, we first construct an aggregation matrix by the combining positive point-wise mutual information matrix with the attribute matrix. Then, we enforce the autoencoder to reconstruct the aggregation matrix instead of the input attribute matrix. The enhancement autoencoder can incorporate structural and attributed information in a joint learning way to improve the noise-resilient during the learning process. Furthermore, an adversarial learning component is leveraged in our framework to impose a prior distribution on learned representations has been demonstrated as an effective mechanism in improving the robustness and stability in representation learning. Experimental studies on real-world datasets have demonstrated the effectiveness of the proposed A3Graph. © 2021 ACM.
Scholar2vec : vector representation of scholars for lifetime collaborator prediction
- Authors: Wang, Wei , Xia, Feng , Wu, Jian , Gong, Zhiguo , Tong, Hanghang , Davison, Brian
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 15, no. 3 (2021), p.
- Full Text:
- Reviewed:
- Description: While scientific collaboration is critical for a scholar, some collaborators can be more significant than others, e.g., lifetime collaborators. It has been shown that lifetime collaborators are more influential on a scholar's academic performance. However, little research has been done on investigating predicting such special relationships in academic networks. To this end, we propose Scholar2vec, a novel neural network embedding for representing scholar profiles. First, our approach creates scholars' research interest vector from textual information, such as demographics, research, and influence. After bridging research interests with a collaboration network, vector representations of scholars can be gained with graph learning. Meanwhile, since scholars are occupied with various attributes, we propose to incorporate four types of scholar attributes for learning scholar vectors. Finally, the early-stage similarity sequence based on Scholar2vec is used to predict lifetime collaborators with machine learning methods. Extensive experiments on two real-world datasets show that Scholar2vec outperforms state-of-the-art methods in lifetime collaborator prediction. Our work presents a new way to measure the similarity between two scholars by vector representation, which tackles the knowledge between network embedding and academic relationship mining. © 2021 Association for Computing Machinery.
Venue topic model-enhanced joint graph modelling for citation recommendation in scholarly big data
- Authors: Wang, Wei , Gong, Zhiguo , Ren, Jing , Xia, Feng , Lv, Zhihan , Wei, Wei
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Asian and Low-Resource Language Information Processing Vol. 20, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Natural language processing technologies, such as topic models, have been proven to be effective for scholarly recommendation tasks with the ability to deal with content information. Recently, venue recommendation is becoming an increasingly important research task due to the unprecedented number of publication venues. However, traditional methods focus on either the author's local network or author-venue similarity, where the multiple relationships between scholars and venues are overlooked, especially the venue-venue interaction. To solve this problem, we propose an author topic model-enhanced joint graph modeling approach that consists of venue topic modeling, venue-specific topic influence modeling, and scholar preference modeling. We first model the venue topic with Latent Dirichlet Allocation. Then, we model the venue-specific topic influence in an asymmetric and low-dimensional way by considering the topic similarity between venues, the top-influence of venues, and the top-susceptibility of venues. The top-influence characterizes venues' capacity of exerting topic influence on other venues. The top-susceptibility captures venues' propensity of being topically influenced by other venues. Extensive experiments on two real-world datasets show that our proposed joint graph modeling approach outperforms the state-of-The-Art methods. © 2020 ACM.
Deep Reinforcement Learning for Vehicular Edge Computing: An Intelligent Offloading System
- Authors: Ning, Zhaolong , Dong, Peiran , Wang, Xiaojie , Rodrigues, Joel , Xia, Feng
- Date: 2019
- Type: Text , Journal article
- Relation: ACM Transactions on Intelligent Systems and Technology Vol. 10, no. 6 (Dec 2019), p. 24
- Full Text:
- Reviewed:
- Description: The development of smart vehicles brings drivers and passengers a comfortable and safe environment. Various emerging applications are promising to enrich users' traveling experiences and daily life. However, how to execute computing-intensive applications on resource-constrained vehicles still faces huge challenges. In this article, we construct an intelligent offloading system for vehicular edge computing by leveraging deep reinforcement learning. First, both the communication and computation states are modelled by finite Markov chains. Moreover, the task scheduling and resource allocation strategy is formulated as a joint optimization problem to maximize users' Quality of Experience (QoE). Due to its complexity, the original problem is further divided into two sub-optimization problems. A two-sided matching scheme and a deep reinforcement learning approach are developed to schedule offloading requests and allocate network resources, respectively. Performance evaluations illustrate the effectiveness and superiority of our constructed system.
Data analytics to select markers and cut-off values for clinical scoring
- Authors: Stranieri, Andrew , Yatsko, Andrew , Venkatraman, Sitalakshmi , Jelinek, Herbert
- Date: 2018
- Type: Text , Conference proceedings
- Relation: ACSW '18: Proceedings of the Australasian Computer Science Week Multiconference; Brisbane; 29th January -2nd February 2018 p. 1-6
- Full Text: false
- Reviewed:
- Description: Scoring systems such as the Glasgow-Coma scale used to assess consciousness AusDrisk to assess the risk of diabetes, are prevalent in clinical practice. Scoring systems typically include relevant variables with ordinal values where each value is assigned a weight. Weights for selected values are summed and compared to thresholds for health care professionals to rapidly generate a score. Scoring systems are prevalent in clinical practice because they are easy and quick to use. However, most scoring systems comprise many variables and require some time to calculate an final score. Further, expensive population-wide studies are required to validate a scoring system. In this article, we present a new approach for the generation of a scoring system. The approach uses a search procedure invoking iterative decision tree induction to identify a suite of scoring rules, each of which requires values on only two variables. Twelve scoring rules were discovered using the approach, from an Australian screening program for the assessment of Type 2 Diabetes risk. However, classifications from the 12 rules can conflict. In this paper we argue that a simple rule preference relation is sufficient for the resolution of rule conflicts.
An Agile group aware process beyond CRISP-DM: A hospital data mining case study
- Authors: Sharma, Vishakha , Stranieri, Andrew , Ugon, Julien , Martin, Laura
- Date: 2017
- Type: Text , Conference proceedings
- Relation: ICCDA '17: Proceedings of the International Conference on Computer and Data Analysis May 2017 p. 109-113
- Full Text: false
- Reviewed:
- Description: The CRISP-DM methodology is commonly used in data analytics exercises within an organisation to provide system and structure to data mining processes. However, in providing a rigorous framework, CRISP-DM overlooks two facets of data analytics in organisational contexts; data mining exercises are far more agile and subject to change than presumed in CRISP-DM and central decisions regarding the interpretation of patterns discovered and the direction of analytics exercises are typically not made by individuals but by committees or groups within an organisation. The current study provides a case study of data mining in a hospital setting and suggests how the agile nature of an analytics exercise and the group reasoning inherent in key decisions can be accommodated within a CRISP-DM methodology.
Dynamically recommending repositories for health data : a machine learning model
- Authors: Uddin, Md Ashraf , Stranieri, Andrew , Gondal, Iqbal , Balasubramanian, Venki
- Date: 2020
- Type: Text , Conference proceedings
- Relation: 2020 Australasian Computer Science Week Multiconference, ACSW 2020
- Full Text: false
- Reviewed:
- Description: Recently, a wide range of digital health record repositories has emerged. These include Electronic Health record managed by the government, Electronic Medical Record (EMR) managed by healthcare providers, Personal Health Record (PHR) managed directly by the patient and new Blockchain-based systems mainly managed by technologies. Health record repositories differ from one another on the level of security, privacy, and quality of services (QoS) they provide. Health data stored in these repositories also varies from patient to patient in sensitivity, and significance depending on medical, personal preference, and other factors. Decisions regarding which digital record repository is most appropriate for the storage of each data item at every point in time are complex and nuanced. The challenges are exacerbated with health data continuously streamed from wearable sensors. In this paper, we propose a recommendation model for health data storage that can accommodate patient preferences and make storage decisions rapidly, in real-time, even with streamed data. The model maps health data to be stored in the repositories. The mapping between health data features and characteristics of each repository is learned using a machine learning-based classifier mediated through clinical rules. Evaluation results demonstrate the model's feasibility. © 2020 ACM.
- Description: E1
OFFER: A Motif Dimensional Framework for Network Representation Learning
- Authors: Yu, Shuo , Xia, Feng , Xu, Jin , Chen, Zhikui , Lee, Ivan
- Date: 2020
- Type: Text , Conference proceedings
- Relation: 29th ACM International Conference on Information and Knowledge Management, CIKM 2020 p. 3349-3352
- Full Text:
- Reviewed:
- Description: Aiming at better representing multivariate relationships, this paper investigates a motif dimensional framework for higher-order graph learning. The graph learning effectiveness can be improved through OFFER. The proposed framework mainly aims at accelerating and improving higher-order graph learning results. We apply the acceleration procedure from the dimensional of network motifs. Specifically, the refined degree for nodes and edges are conducted in two stages: (1) employ motif degree of nodes to refine the adjacency matrix of the network; and (2) employ motif degree of edges to refine the transition probability matrix in the learning process. In order to assess the efficiency of the proposed framework, four popular network representation algorithms are modified and examined. By evaluating the performance of OFFER, both link prediction results and clustering results demonstrate that the graph representation learning algorithms enhanced with OFFER consistently outperform the original algorithms with higher efficiency. © 2020 ACM.
Partial undersampling of imbalanced data for cyber threats detection
- Authors: Moniruzzaman, Md , Bagirov, Adil , Gondal, Iqbal
- Date: 2020
- Type: Text , Conference proceedings , Conference paper
- Relation: 2020 Australasian Computer Science Week Multiconference, ACSW 2020
- Full Text:
- Reviewed:
- Description: Real-time detection of cyber threats is a challenging task in cyber security. With the advancement of technology and ease of access to the internet, more and more individuals and organizations are becoming the target for various cyber attacks such as malware, ransomware, spyware. The target of these attacks is to steal money or valuable information from the victims. Signature-based detection methods fail to keep up with the constantly evolving new threats. Machine learning based detection has drawn more attention of researchers due to its capability of detecting new and modified attacks based on previous attack's behaviour. The number of malicious activities in a certain domain is significantly low compared to the number of normal activities. Therefore, cyber threats detection data sets are imbalanced. In this paper, we proposed a partial undersampling method to deal with imbalanced data for detecting cyber threats. © 2020 ACM.
- Description: E1
The gene of scientific success
- Authors: Kong, Xiangjie , Zhang, Jun , Zhang, Da , Bu, Yi , Ding, Ying , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 14, no. 4 (2020), p.
- Full Text:
- Reviewed:
- Description: This article elaborates how to identify and evaluate causal factors to improve scientific impact. Currently, analyzing scientific impact can be beneficial to various academic activities including funding application, mentor recommendation, discovering potential cooperators, and the like. It is universally acknowledged that high-impact scholars often have more opportunities to receive awards as an encouragement for their hard work. Therefore, scholars spend great efforts in making scientific achievements and improving scientific impact during their academic life. However, what are the determinate factors that control scholars' academic success? The answer to this question can help scholars conduct their research more efficiently. Under this consideration, our article presents and analyzes the causal factors that are crucial for scholars' academic success. We first propose five major factors including article-centered factors, author-centered factors, venue-centered factors, institution-centered factors, and temporal factors. Then, we apply recent advanced machine learning algorithms and jackknife method to assess the importance of each causal factor. Our empirical results show that author-centered and article-centered factors have the highest relevancy to scholars' future success in the computer science area. Additionally, we discover an interesting phenomenon that the h-index of scholars within the same institution or university are actually very close to each other. © 2020 ACM.
A comparative study of unsupervised classification algorithms in multi-sized data sets
- Authors: Quddus, Syed , Bagirov, Adil
- Date: 2019
- Type: Text , Conference paper
- Relation: 2nd Artificial Intelligence and Cloud Computing Conference, AICCC 2019, Kobe, 21-23 December 2019 p. 26-32
- Full Text: false
- Reviewed:
- Description: The ability to mine and extract useful information automatically, from large data sets, is a common concern for organizations, for the last few decades. Over the internet, data is vastly increasing gradually and consequently the capacity to collect and store very large data is significantly increasing. Existing clustering algorithms are not always efficient and accurate in solving clustering problems for large data sets. However, the development of accurate and fast data classification algorithms for very large scale data sets is still a challenge. In this paper, we present an overview of various algorithms and approaches which are recently being used for Clustering of large data and E-document. In this paper, a comparative study of the performance of various algorithms: the global kmeans algorithm (GKM), the multi-start modified global kmeans algorithm (MS-MGKM), the multi-start kmeans algorithm (MS-KM), the difference of convex clustering algorithm (DCA), the clustering algorithm based on the difference of convex representation of the cluster function and non-smooth optimization (DC-L2), is carried out using C++. © 2019 ACM.
Melanoma classification using efficientnets and ensemble of models with different input resolution
- Authors: Karki, Sagar , Kulkarni, Pradnya , Stranieri, Andrew
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 Australasian Computer Science Week Multiconference, ACSW 2021, Virtual, Online, 1-5 February 2021, ACM International Conference Proceeding Series
- Full Text:
- Reviewed:
- Description: Early and accurate detection of melanoma with data analytics can make treatment more effective. This paper proposes a method to classify melanoma cases using deep learning on dermoscopic images. The method demonstrates that heavy augmentation during training and testing produces promising results and warrants further research. The proposed method has been evaluated on the SIIM-ISIC Melanoma Classification 2020 dataset and the best ensemble model achieved 0.9411 area under the ROC curve on hold out test data. © 2021 ACM.