Search Results - (( java improving tree algorithm ) OR ( java implementation bees algorithm ))
Search alternatives:
- java implementation »
- implementation bees »
- improving tree »
- tree algorithm »
- bees algorithm »
-
1
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
Get full text
Thesis -
2
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…In the present work, Separator Database is proposed to improve PrefixSpan with pseudoprojection through early removal of uneconomical in-memory sequenced database, whilst SPM-Tree framework is proposed to build the intermediated databases. …”
Get full text
Get full text
Thesis -
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 2008“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
Get full text
Get full text
Citation Index Journal -
5
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…The proposed embedded system has achieved positive outcomes in comparison to the current system and the traditional algorithm with regards to the shortest path. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
7
Landslide Susceptibility Mapping with Stacking Ensemble Machine Learning
Published 2024“…In this paper, the stacking ensemble method is used to increase the accuracy of the machine learning model for LSM where the base (first-level) learners use five ML algorithms namely decision tree (DT), k-nearest neighbor (KNN), AdaBoost, extreme gradient boosting (XGB) and random forest (RF). …”
Conference Paper -
8
A cluster-based hybrid replica control protocol for high availability in data grid
Published 2019“…A clustering algorithm has been proposed to group the large nodes into clusters and organize these clusters into a tree structure. …”
Get full text
Get full text
Thesis
