Search Results - (( variable iteration _ algorithm ) OR ( java application mining algorithm ))

Search alternatives:

Refine Results
  1. 1
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    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
    Save to List
    Saved in:
  4. 4
    An efficient method for determining all the extreme points of function with one variable

    An efficient method for determining all the extreme points of function with one variable by Pandiya, Ridwan

    Published 2014
    “…The algorithm is the combination of the filled function's algorithm and Inner Iteration algorithm, called IRH's algorithm, in which Inner Iteration algorithm works at the domain which is usually ignored by filled function's algorithm.…”
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…Whereas, the validation from the real-world of the two datasets showed that the new augmentation algorithm steadily producing lesser iteration number compared to the conventional Simplex, QSM and BLSA algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Mining Sequential Patterns Using I-PrefixSpan

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    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
    Save to List
    Saved in:
  7. 7
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    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
    Save to List
    Saved in:
  8. 8
    Mining Sequential Patterns using I-PrefixSpan

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  9. 9
    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation

    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

    Published 2018
    “…The proposed variant-greedy algorithm employed the elitism mechanism alongside the iteration in order to improve its’ efficiency. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Partial Newton methods for a system of equations

    Partial Newton methods for a system of equations by Goh, Bean San, Leong, Wah June, Siri, Zailan

    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
    Save to List
    Saved in:
  11. 11
    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly

    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

    Published 2023
    “…The binary integer programming (BIP) issue is a rare form of integer programming problem in which the value of variable xi is only 0 or 1. In this case, condition xi is also known as a "Binary" or "0 - 1"variable. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    EMS decoding algorithm that introduced shuffled strategy and improved variable node update

    EMS decoding algorithm that introduced shuffled strategy and improved variable node update by Cao, Xiawei, Ji, Yuanfa, Sun, Xiyan, Liang, Weibin, Kamarul Hawari, Ghazali

    Published 2022
    “…This algorithm updates by column, so that the latest variable node information of the last column can be used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm

    Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm by Nur Azulia, Kamarudin

    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
    Save to List
    Saved in:
  14. 14
    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak

    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

    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
    Save to List
    Saved in:
  15. 15
    Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin

    Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin by Mohamad Husnin, Shahirah Atikah

    Published 2018
    “…This indicated that the new scaled mBFGS algorithm performance is better than mBFGS algorithms.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms

    Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms by Haiour M., Bencheikh Le Hocine M.E.A., Jan R., Himadan A., Boulaaras S.

    Published 2025
    “…We establish a pivotal connection between a fixed-point mapping and the discrete EQVIs system, utilizing it to formulate a discrete algorithm featuring a semi-implicit time scheme. Furthermore, we introduce a monotone iterative scheme inspired by Bensoussan's algorithm and rigorously confirm several of its properties through mathematical proofs. …”
    Article
    Save to List
    Saved in:
  17. 17
    Features selection for intrusion detection system using hybridize PSO-SVM

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. The proposed model will be tested and evaluated on both NSL-KDD and KDD-CUP 99 using several performance metrics.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Model selection approaches of water quality index data

    Model selection approaches of water quality index data by Kamarudin, Nur Azulia, Ismail, Suzilah

    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
    Save to List
    Saved in:
  19. 19
    Enhanced Flipping Technique to Reduce Variability in Image Steganography

    Enhanced Flipping Technique to Reduce Variability in Image Steganography by Kamil S., Abdullah S.N.H.S., Hasan M.K., Bohani F.A.

    Published 2023
    Article
    Save to List
    Saved in:
  20. 20
    FPGA implementation of variable precision Euclid’s GCD algorithm

    FPGA implementation of variable precision Euclid’s GCD algorithm by Al-Haija, Qasem Abu, Syed Ahmad Abdul Rahman, Sharifah Mumtazah, Alfarran, Islam

    Published 2017
    “…Introduction: Euclid's algorithm is well-known for its efficiency and simple iterative to compute the greatest common divisor (GCD) of two non-negative integers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: