-
41
Road crash injury severity prediction using a graph neural network framework
Published 2024“…The current study extends existing knowledge by leveraging Graph Neural Networks (GNN) and comparing their performance to popular ensemble-based models, which include Extreme Gradient Boosting (XGBoost), Random Forest (RF), and Artificial Neural Networks (ANNs). …”
Get full text
Article -
42
Instructional efficiency of utilization of autograph technology Vs handheld graphing calculator for learning algebra.
Published 2008“…On the other hand, graphing calculator is a handy device that can be use for teaching mathematics which is able to create geometric figures, graph functions, inequalities or transformations of functions. …”
Get full text
Article -
43
A direct proof of improved biased random walk with gastric cancer dataset
Published 2018“…To be completely biased to the random walk, references data is implement as directed graph. …”
Get full text
Conference or Workshop Item -
44
Hybrid sampling and random forest machine learning approach for software detect prediction
Published 2019“…Matplotlib, and PyPlot are used for graph and data visualization respectively. The hybrid sampling method and Random Forest (RF) algorithms achieved the highest prediction accuracy about 93.26% by showing its superiority.…”
Get full text
Get full text
Conference or Workshop Item -
45
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…There are several existing path planning methods such as Visibility Graph (VG), Voronoi Diagram (VD), Potential Fields (PF) and Rapidly-Exploring Random Tree (RRT). …”
Get full text
Get full text
Get full text
Thesis -
46
Learning mathematics through utilization of technology : use of autograph technology vs handheld graphing calculator.
Published 2008“…On the other hand, graphing calculator is a handy device that can be use for teaching mathematics which is able to create geometric figures, graph functions, inequalities or transformations of functions. …”
Get full text
Conference or Workshop Item -
47
Capsule neural tensor networks with multi-aspect information for Few-shot Knowledge Graph Completion
Published 2023“…Few-shot Knowledge Graph Completion (FKGC) has recently attracted significant research interest due to its ability to expand few-shot relation coverage in Knowledge Graphs. …”
Get full text
Journal Article -
48
Parrondo's paradox in network communication: a routing strategy
Published 2024Get full text
Journal Article -
49
An improved directed random walk framework for cancer classification using gene expression data
Published 2020“…Besides that, SDW also incorporated four directed graphs to study the usability of the directed graph. …”
Get full text
Get full text
Get full text
Thesis -
50
Randomized gradient-free distributed online optimization via a dynamic regret analysis
Published 2023Get full text
Journal Article -
51
Distributed Algorithms on Exact Personalized PageRank
Published 2017Get full text
Get full text
Conference Paper -
52
Optimal medicinal cupping points selection for asthma disease via graph colouring: A preliminary study
Published 2019“…Thus, in this paper, a graph model is proposed on finding the optimal number of cupping points for asthma disease via graph colouring approach. …”
Get full text
Conference or Workshop Item -
53
An Enhanced Topologically Significant Directed Random Walk in Cancer Classification using Gene Expression Datasets
Published 2017“…Gene expression dataset is used as the input datasets while pathway data- set is used to build a directed graph, as reference datasets, to complete the bias process in random walk approach. …”
Get full text
Article -
54
Mean Monte Carlo Finite Difference Method for Random Sampling of a Nonlinear Epidemic System
Published 2019“…In this article, a numerical method integrated with statistical data simulation technique is introduced to solve a nonlinear system of ordinary differential equations with multiple random variable coefficients. The utilization of Monte Carlo simulation with central divided difference formula of finite difference (FD) method is repeated n times to simulate values of the variable coefficients as random sampling instead being limited as real values with respect to time. …”
Article -
55
Instructional efficiency of mathematical learning using Geometer's Sketchpad and graphing calculator: technology tools versus traditional chalk and talk
Published 2008“…In this study, two technological tools in teaching and learning mathematics namely Geometer’s Sketchpad and graphing calculator were investigated. The purpose of this research was to compare instructional efficiency of utilizing Geometer’s Sketchpad and graphing calculator versus traditional approach for a secondary level topic ‘Quadratic Function’. …”
Get full text
Article -
56
A non-conventional hybrid numerical approach with multi-dimensional random sampling for cocaine abuse in Spain
Published 2018“…This paper introduces a non-conventional approach with multi-dimensional random sampling to solve a cocaine abuse model with statistical probability. …”
Article -
57
Modeling a simulation for sociotechnical resilience
Published 2021“…Our model aims to capture the complex interactions within a sociotechnical system during a recovery process by incorporating these core attributes in the operational units embedded in a multilevel directed acyclic graph, information networks, and recovery strategies. …”
Get full text
Journal Article -
58
Two new zero-dimensional qubit codes from bordered metacirculant construction
Published 2022“…We use symplectic self-dual additive codes over F4 built by modifying the adjacency matrices of suitable metacirculant graphs found by a randomized search procedure.…”
Get full text
Journal Article -
59
Crack characterisation of community structured elements for hydrogel fracture simulation
Published 2023Get full text
Final Year Project (FYP) -
60
The maximum number of minimal codewords in long codes
Published 2013“…Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provides lower bounds. In this paper, we compare these bounds with analogous bounds for the cycle code of graphs. …”
Get full text
Get full text
Journal Article