Search Results - (( developing greedy method algorithm ) OR ( java implementation mining algorithm ))
Search alternatives:
- implementation mining »
- java implementation »
- developing greedy »
- method algorithm »
- mining algorithm »
-
1
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text
Thesis -
2
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 -
3
Scalable approach for mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
4
Mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
5
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 -
6
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
Published 2018“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Multi-base number representation in application to scalar multiplication and pairing computation
Published 2011“…In this work, an extension of Greedy algorithm called xGreedy, is proposed. It finds the best approximated powers of each base to be used to convert large integers to new addition chains. …”
Get full text
Get full text
Thesis -
9
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Information Theoretic-based Feature Selection for Machine Learning
Published 2018“…Besides, this thesis developed a hybrid filter method to enhance the performance of the IFS. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
Image clustering comparison of two color segmentation techniques
Published 2010“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
-
13
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
14
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“…Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner
Published 2019“…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
Get full text
Get full text
Research Reports -
16
Influence maximisation towards target users and minimal diffusion of information based on information needs
Published 2020“…IDTU was developed on greedy approach by using graph sketches to improve the selection of influencers that maximize influence spread to a set of target users. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
Get full text
Get full text
Get full text
Thesis -
18
Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities
Published 2008“…Fire stations in Jakarta Selatan were chosen for simulation. Two algorithms, Greedy Adding (Add) and Greedy Adding with Travel Time Evaluation (GAT), were applied to solve the optimization problem of the MSAP. …”
Get full text
Get full text
Thesis -
19
Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers
Published 2016“…Hence, Robust-LARS (RLARS-RFCH) based on √ consistent multivariate (RFCH) correlation matrix is developed. The proposed method is computationally efficient and its performance outperformed the RLARS-Winsor The algorithm of all possible subsets is greedy and it is inefficient and unstable in the presence of autocorrelated errors and outliers. …”
Get full text
Get full text
Thesis -
20
Using artificial intelligence search in solving the camera placement problem
Published 2022“…Due to the impact of optimal camera placement on the efficiency and the cost of surveillance systems as well as the rapid development in sensor technologies and the pressing security needs, the last two decades witnessed an increasing interest in developing and introducing efficient methods for solving what is known as the camera placement problem. …”
Get full text
Get full text
Book
