Search Results - (( variable iteration method algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- variable iteration »
- application mining »
- iteration method »
- method algorithm »
- java application »
- mining algorithm »
-
1
Direct approach for mining association rules from structured XML data
Published 2012Get full text
Get full text
Thesis -
2
-
3
-
4
Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance
Published 2021“…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Partial Newton methods for a system of equations
Published 2013“…This is because it uses only one or two variables instead of all the search variables in each iteration.…”
Get full text
Get full text
Get full text
Article -
6
Study and Implementation of Data Mining in Urban Gardening
Published 2019“…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
Get full text
Get full text
Get full text
Article -
7
Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly
Published 2023“…The next method is simplex method. The simplex method is a conceptual model approach for analysing linear programming problems with any number of variables. …”
Get full text
Get full text
Thesis -
8
Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin
Published 2018“…Broyden-Fletcher-Goldfarb-Shanno (BFGS) is one of a well-known Quasi-Newton update formula. This method is generally considered as the most efficient method among other variable metric methods for solving unconstrained optimization problems. …”
Get full text
Get full text
Thesis -
9
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
-
11
A web-based implementation of k-means algorithms
Published 2022“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
12
-
13
Model selection approaches of water quality index data
Published 2016“…Automatic model selection by using algorithm can avoid huge variability in model specification process compared to manual selection.With the employment of algorithm, the right model selected is then also used for forecasting purposes. …”
Get full text
Get full text
Get full text
Article -
14
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
15
Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak
Published 2025“…The model employs a two-level structure, where the first level uses standard soft constraints as the objective function to evaluate solution quality, while the second level dynamically adapts to faculty-specific preferences. A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
16
The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin
Published 2019“…Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
Get full text
Get full text
Thesis -
17
-
18
Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms
Published 2025“…Our approach unfolds through a four-step methodology, leveraging distinctive features of a discrete iterative technique. This methodology integrates semi-implicit techniques with respect to the variable t and employs spatial approximation via finite element methods. …”
Article -
19
Towards large scale unconstrained optimization
Published 2007“…This method computes a Newton-type direction by truncating the conjugate Gradient method iterates (inner iterations) whenever a required accuracy is nobtained, thereby the superlinear convergence is guaranteed. …”
Get full text
Get full text
Get full text
Inaugural Lecture -
20
Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm
Published 2019“…Therefore, in this study SUREAutometrics is improvised using two MLE methods, which are iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm, named as SURE(IFGLS)-Autometrics and SURE(EM)-Autometrics algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis
