Search Results - (( developing new method algorithm ) OR ( java application tree algorithm ))
Search alternatives:
- method algorithm »
- java application »
- application tree »
- developing new »
- tree algorithm »
-
1
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 -
2
-
3
Study and Implementation of Data Mining in Urban Gardening
Published 2019“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
Get full text
Get full text
Get full text
Article -
4
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
5
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde
Published 2022“…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
Get full text
Get full text
Get full text
Thesis -
6
New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations
Published 2018“…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
Get full text
Get full text
Get full text
Article -
7
Generalized Triad Design Algorithms
Published 2012“…Previous studies on TD(v) reported its existence when v≡1 or 5 (mod 6) and TD(7) was developed by using a brute-force method. In this study, generalized and new algorithms for developing TD(v) for any v = 6n + 1 or v = 6n + 5 were developed. …”
Get full text
Get full text
Thesis -
8
Semiparametric inference procedure for the accelarated failure time model with interval-censored data
Published 2019“…The main contribution of this research is developing statistical approaches, and introducing new algorithms and resampling methods for analysing interval-censored data through AFT models.…”
Get full text
Get full text
Get full text
Thesis -
9
Development of a new method of crack modeling and prediction algorithm
Published 2008Get full text
Get full text
Proceeding Paper -
10
New Quasi-Newton Equation And Method Via Higher Order Tensor Models
Published 2010“…The comparison between this new method with that of the method developed by Xiao et al. (2008) shows better performance in numerical results for the new method. …”
Get full text
Get full text
Thesis -
11
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Published 2013“…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
Get full text
Get full text
Get full text
Article -
12
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text
Thesis -
13
Development of a new algorithm for segmentation of flotation froth images
Published 2014Get full text
Get full text
Article -
14
-
15
New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique
Published 2016“…These 6 algorithms are divided into 3 main methods namely Method A, Method B, and Method C depending on their search patterns and strategies. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
16
Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system
Published 2010“…These developed algorithms are tested on 14, 118 and 300 IEEE bus systems. …”
Get full text
Get full text
Thesis -
17
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
Thesis -
18
AI powered asthma prediction towards treatment formulation: an android app approach
Published 2022“…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
Get full text
Get full text
Get full text
Article -
19
Developing triad design algorithms based on compatible factorization
Published 2011“…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
Get full text
Get full text
Get full text
Monograph -
20
