Search Results - (( parametric classification learning algorithm ) OR ( initial solution method algorithm ))

Balancing Exploitation And Exploration Search Behavior On Nature-Inspired Clustering Algorithms by Alswaitti, Mohammed Y. T.

“…In the OGC framework, the exhibited explorative search behavior of the Gravitational Clustering (GC) algorithm has been addressed by (i) eliminating the agent velocity accumulation, and (ii) integrating an initialization method of agents using variance and median to subrogate the exploration process. …”
Get full text
Get full text

Grid-Based Classifier as a Replacement for Multiclass Classifier in a Supervised Non-Parametric Approach by Moheb Pour, Majid Reza

Get full text
Get full text

Application of Decision Trees in Athlete Selection: A Cart Algorithm Approach by Riska Wahyu, Romadhonia, A'yunin, Sofro, Danang, Ariyanto, Dimas Avian, Maulana, Junaidi Budi, Prihanto

“…This study investigates the application of Decision Trees (DTs), a non-parametric supervised learning method, renowned for its simplicity, interpretability, and wide applicability in various domains, including machine learning for classification and regression tasks. …”
Get full text
Get full text
Get full text

An optimized variant of machine learning algorithm for datadriven electrical energy efficiency management (D2EEM) by Shamim, Akhtar

“…The scope of this study is tri folded, First, an exhaustive and parametric comparative study on a wide variety of machine learning algorithms is presented to evaluate the performance of machine learning algorithms in energy load prediction. …”
Get full text
Get full text

Data Analysis and Rating Prediction on Google Play Store Using Data-Mining Techniques by Kayalvily, Tabianan, Denis, Arputharaj, Mohd Norshahriel, Abd Rani, Sarasvathi, Nahalingham

“…This study aims to predict the ratings of Google Play Store apps using decision trees for classification in machine learning algorithms. The goal of using a Decision Tree is to create a training model that can use to predict the class or value of the target variable by learning simple decision rules inferred from prior data. …”
Get full text
Get full text
Get full text

Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

“…In addition, experiments prove that incremental genetic-based clustering ensemble algorithm speed up to converge into an optimal clustering solution, where pattern ensemble learning method and the cluster partitions produced by the threshold fuzzy c-means clustering algorithm are employed as recombination operator and initial population, respectively.…”
Get full text
Get full text

Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

“…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
Get full text
Get full text
Get full text

Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

“…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
Get full text
Get full text

Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation by Tan , Khang Siang

“…Due to its capability in providing a particularly promising solution to clustering problems, the conventional Fuzzy C-Mean (FCM) algorithm is widely used as a segmentation method. …”
Get full text
Get full text

Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

“…Newton's Method also called the Newton-Raphson method is a recursive algorithm for approximating the root of a differentiable function. …”
Get full text
Get full text

Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

“…This method involves guessing initial conditions and iteratively adjusting them until the solution satisfies the boundary conditions at the other end of the domain. …”
Get full text
Get full text

Enhancing the RC4 algorithm by eliminating the Initiative Vector (IV) transmission by Waleed Abdelrahman Yousif Mohammed, Salmah Fattah, Khalid Mohammed Osman Saeed, Ashraf Osman Ibrahim Elsayed, Safaa Eltahier

“…This paper introduces an innovative approach to address the vulnerabilities of the RC4 encryption algorithm by employing an Initiative Vector (IV). The proposed method incorporates a lengthy random text without transmitting an initialization vector. …”
Get full text
Get full text
Get full text

Image Splicing Detection With Constrained Convolutional Neural Network by Lee, Yang Yang

“…The constrained layer enables the CNN model to learn the required features directly from ubiquitous image input and then performs classification. …”
Get full text
Get full text

Oil palm mapping over Peninsular Malaysia using Google Earth Engine and machine learning algorithms by Shaharum, Nur Shafira Nisa, Mohd Shafri, Helmi Zulhaidi, Wan Ab. Karim Ghani, Wan Azlina, Samsatli, Sheila, Al-Habshi, Mohammed Mustafa, Yusuf, Badronnisa

“…In this study, 30 m Landsat 8 data were processed using a cloud computing platform of Google Earth Engine (GEE) in order to classify oil palm land cover using non-parametric machine learning algorithms such as Support Vector Machine (SVM), Classification and Regression Tree (CART) and Random Forest (RF) for the first time over Peninsular Malaysia. …”
Get full text
Get full text
Get full text

Automatic selection of initial points for exploratory vessel tracing in fluoroscopic images by Boroujeni, Farsad Zamani, O. K. Rahmat, Rahmita Wirza, Mustapha, Norwati, Affendey, Lilly Suriani, Maskon, Oteh

“…This paper presents a new method for efficient selection of initial points for exploratory tracing algorithms. …”
Get full text
Get full text
Get full text

Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

“…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
Get full text
Get full text
Get full text

Approximating Non Linear Higher Order ODEs By A Three Point Block Algorithm by Nurullah Rasedee, Ahmad Fadly, Abdul Sathar, Mohammad Hasan, Othman, Khairil Iskandar, Hamzah, Siti Raihana, Ishak, Norizarina

Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

“…Then, the validation of proposed genetic algorithm with reinforced initial population (GA2) has been checked with random keys genetic algorithm (RKGA). …”
Get full text
Get full text

Parameter estimation of tapioca starch hydrolysis process: Application of least squares and genetic algorithm by Roslina, Rashid, Hishamuddin, Jamaluddin, Nor Aishah, Saidina Amin

Get full text

Direct solutions of N-th order initial value problems in decomposition series by Yahaya F., Hashim I., Ismail E.S., Zulkifle A.K.

“…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”