Industrial training briefing for Bachelor of applied science in data analytics with honors

FEBRUARY 3, 2023, UMP PAYA BESAR - An industrial training briefing was held at Block Z, UMP Paya Besar

A review on machine learning techniques used for students’ performance prediction

Research on predictive models has been widely used in higher educational institutions, especially in predicting students’ performance. Results that were obtained through predictive models can help lecturers in ensuring students’ achievement so that students’ failure rates can be reduced. Higher failure rates have a negative impact not only on students but also on institutions and shareholders. In this paper, thirty journals and case studies have been reviewed where the most important part highlighted is machine learning techniques that have been used in developing predictive models to predict students’ performance from the previous six years. Although the main objective of this paper is to provide an overview of machine learning techniques in predicting students’ performance, it is also important for researchers to identify the target variable used in those techniques as these two objectives are related to each other. In conclusion, a student’s final grade is the most widely used as a target variable, and the Decision Tree method is the most frequently used machine learning technique by the authors in the previous studies

The development of a predictive model for students’ final grades using machine learning techniques

As per research, utilizing predictive analytics in education can be very beneficial. It can help educators improve students' performance by analyzing historical data through various approaches such as data mining and machine learning. However, there is a scarcity of studies on using machine learning and predictive analytics to enhance student performance in Malaysian higher education. This study used the records of 450 students enrolled in the Business Statistics course at Universiti Islam Pahang Sultan Ahmad Shah (UnIPSAS) from 2013, obtained from UnIPSAS's Learning Management System. The aim was to develop the best predictive model for forecasting students' final grades based on their performance levels, using machine learning techniques such as Decision Tree, k-Nearest Neighbor, and Naïve Bayes. The final model was developed using Python software. The results showed a strong negative correlation between the students' carry marks and their final grades, with an r-value of -0.8. Naïve Bayes was found to be the best model, with an AUC score of 0.79

Some properties of compatible action graph

In this paper, the compatible action graph for the finite cyclic groups of p-power order has been considered. The purpose of this study is to introduce some properties of the compatible action graph for finite p-groups

Assessing the Level of Competence in Automated Trading Among Malaysian Traders

 In today's technology world, financial trading instrument such as stock, currencies, futures, and acts is now done electronically via the internet due to technological improvements. Financial market trading traders apply technical and fundamental analyses to forecast the best price when buying or selling the finance instrument, and they develop their trading tactics and strategies with technical analysis tools. The objective of this research is to figure out the level of competence that Malaysian retail traders have in Automated or Algorithmic Trading (AT) focusing on currency trading. The searches were conducted on a sample of Malaysian retail traders. The viewpoints of retail traders were investigated using a questionnaire designed specifically for this purpose. The data was analyzed using statistical software (SPSS). The findings of this study reveal that Malaysian traders have an excellent comprehension of AT. This study is useful for traders and researchers who want to design their own AT systems in the future

Behaviour of DNA Splicing Language Predictor

Recombinant DNA technology, joining two DNA molecules together to produce new genetic combinations is of value to medicine, agriculture and science industry. This new invention of software programming has been developed using Visual Basic in order to predict the number pattern of resulted molecules after the cut and paste phenomenon of two double-stranded DNA, based on the theorems that have been formulated by using Y-G splicing system. In addtion, the characteristics of restriction enzymes in terms of palindromic and inverse complement properties are also determined. Also, the software programming can be utilized for scientists to determine the behaviour of resulted molecules such as whether a molecule can participate in further splicing or disappeared after the experiment has run through completio

Compatible pairs of actions for finite cyclic 2-groups and the associated compatible action graphs

The nonabelian tensor product is defined for a pair of groups which act on each other provided the actions satisfying the compatibility conditions. Different pairs of compatible actions will give different nonabelian tensor products. Thus, in this research, the maximum number of different nonabelian tensor products between two groups is found by determining the exact number of compatible pairs of actions and focusing only on the finite cyclic 2-groups. This research starts with determination of the exact number of compatible pairs of actions by using the necessary and sufficient conditions of finite cyclic 2-groups to act compatibly on each other. In order to find the number of compatible pairs of actions of finite cyclic 2-groups, the compatible action graph is introduced. Then, some properties of he compatible action graph and a subgraph of the compatible action graph are determined

Number of Compatible Pair of Actions For Finite Cyclic Groups of 3-Power Order

Compatible actions are important in determining the non-abelian tensor product. Different compatible pair of actions gives a different tensor product even for the same group. The purpose of this paper is to determine the exact number of compatible pair of actions for the finite cyclic groups of 3-power order. By using some properties of number theory, the number of the compatible pair of actions for finite cyclic groups of 3-power order with a specific order of actions is determined and given as a main result in this paper

The Number of Compatible Pair of Actions for Cyclic Groups of 2-Power Order

The non-abelian tensor product of groups has its origins in the algebraic K-theory and homotopy theory. The nonabelian tensor product for a pair of groups is defined when the actions act compatibly on each other. This research is to determine the maximum number of a compatible pair of actions that can be identified between two cyclic groups of 2-power order for nonabelian tensor product. The compatible pair of actions between two cyclic groups of 2-power order can be found by using the necessary and sufficient conditions of two cyclic groups of 2-power order acting compatibly on each other. Hence, the number of the compatible pair of actions between two cyclic groups of the 2-power order is determined

Compatible Pair of Nontrivial Actions for Some Cyclic Groups of 2-Power Order

Compatible action played a very important verification before the nonabelian tensor product can be computed. This paper gives the some exact number of compatible pairs of actions for some cyclic groups of 2-power order. Some necessary and sufficient number theoretical conditions for a pair of cyclic groups of 2-power order with nontrivial actions act compatibly on each other are used to investigate some properties to find the exact number of compatible pairs of actions. Algorithms in Groups, Algorithms and Programming (GAP) software are constructed to create more examples on selected case. New results on compatible pair of nontrivial actions of order two and four are given