Search Results - (( using mean problem algorithm ) OR ( java application tree algorithm ))
Search alternatives:
- problem algorithm »
- java application »
- application tree »
- tree algorithm »
- mean problem »
-
1
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text
Get full text
Thesis -
2
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
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
Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm
Published 2018“…It is attained successfully by combining the mean in K-Means algorithm, minimum and maximum in K-Midranges algorithm and compute their average as mean cluster of Hybrid mean. …”
Get full text
Get full text
Get full text
Thesis -
5
Improved clustering using robust and classical principal component
Published 2017“…To remedy this problem, we propose to integrate Principal Component analysis (PCA) which is useful for dimensionality reduction of a dataset with the k-means clustering algorithm. …”
Get full text
Get full text
Thesis -
6
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
7
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text
Thesis -
8
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 -
9
An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem
Published 2021“…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
Get full text
Get full text
Get full text
Article -
10
Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems
Published 2023“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text
Article -
11
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
Get full text
Get full text
Thesis -
12
Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network
Published 2023“…To address these problems, a novel method combining a covering rough set and a K-Means clustering algorithm (RK-Means) was proposed in this paper. …”
Article -
13
Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid
Published 2006“…In this paper, we combine Fuzzy C-Mean and Genetic Algorithms which are popular algorithms, the Grid can be used for scheduling. …”
Get full text
Get full text
Article -
14
Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem
Published 2005“…This means that it is highly unlikely to find a polynomial algorithm to solve the problem. …”
Get full text
Get full text
Get full text
Thesis -
15
Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems
Published 2014“…Genetic algorithm has recorded of huge success in solving NP-Complete optimization problems with similar nature to this problem. …”
Get full text
Get full text
Thesis -
16
Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model
Published 2018“…EM and K-means clustering algorithms are used to cluster the multi-class classification attribute according to its relevance criteria and afterward, the clustered attributes are classified using an ensemble random forest classifier model. …”
Get full text
Get full text
Get full text
Article -
17
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Optimized clustering with modified K-means algorithm
Published 2021“…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
-
20