Search Results - (( process location selection algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- selection algorithm »
- location selection »
- application mining »
- process location »
- java application »
- mining algorithm »
-
1
Direct approach for mining association rules from structured XML data
Published 2012Get full text
Get full text
Thesis -
2
-
3
Study and Implementation of Data Mining in Urban Gardening
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 -
4
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 -
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
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
7
Kernel and multi-class classifiers for multi-floor wlan localisation
Published 2016“…For fingerprint database optimisation, novel access point (AP) selection algorithms which are based on variant AP selection are investigated to improve computational accuracy compared to existing AP selection algorithms such as Max-Mean and InfoGain. …”
Get full text
Get full text
Thesis -
8
Static and self-scalable filter range selection algorithms for peer-to-peer networks
Published 2011“…Two multiple selection algorithm, which are known as “static filter range selection algorithm” and “self-scalable selection algorithm” are proposed. …”
Get full text
Get full text
Thesis -
9
Linear-PSO with binary search algorithm for DNA Motif Discovery / Hazaruddin Harun
Published 2015“…Therefore, this study addresses these problems by introducing a hybrid algorithm for MD. In this study, the MD is a process to discover all possible motifs that existed in DNA sequences whereas Motif Identification (MI) is a process to identify the correct motif that can represent a selected species. …”
Get full text
Get full text
Book Section -
10
Agreement options for negotiation on material location decision of housing development
Published 2020“…Application of coalition formation for agreement options is used to select the best fit material location. It is based on satisficing game theory rather than optimization. …”
Get full text
Get full text
Article -
11
Edge Detection Algorithm For Image Processing Of Search And Rescue Robot
Published 2016“…This project entitled “ Edge Detection Algorithm for Image Processing of Search and Rescue Robot ” has its primary purpose to identify an optimum edge detection algorithm for image processing of search and rescue robot. …”
Get full text
Get full text
Final Year Project -
12
Harmony search algorithm for curriculum-based course timetabling problem
Published 2013“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
Get full text
Get full text
Get full text
Article -
13
Harmony search algorithm for curriculum-based course timetabling problem
Published 2013“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution.Each course scheduled out of memory consideration is examined as to whether it should be pitch adjusted with probability of eight procedures. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Features selection for intrusion detection system using hybridize PSO-SVM
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 -
15
PLANNING OF MULTIPLE FEEDERS ELECTRICAL DISTRIBUTION SYSTEM
Published 2011“…In this project, several algorithms are implemented to design an electrical distribution system which are (1) Optimal Feeder Path Algorithm, (2) Modified Load Flow Algorithm, (3) Optimal Branch Conductor Selection Algorithm, and ( 4) Optimal Location of Substation Algorithm. …”
Get full text
Get full text
Final Year Project -
16
Averaged kernel floor localization algorithm for multi-floor WLAN positioning
Published 2017“…Additionally, the proposed algorithm has very low processing time of about 29 times lower compared to previous floor localization algorithms.…”
Get full text
Get full text
Conference or Workshop Item -
17
Multi-Hop Selective Constructive Interference Flooding Protocol For Wireless Sensor Networks
Published 2019“…MSCIF integrates three main algorithms: clustering algorithm, selection algorithm, and a synchronized flooding. …”
Get full text
Get full text
Thesis -
18
Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun
Published 2015“…Therefore, this study addresses these problems by introducing a hybrid algorithm for MD. In this study, the MD is a process to discover all possible motifs that existed in DNA sequences whereas Motif Identification (MI) is a process to identify the correct motif that can represent a selected species. …”
Get full text
Get full text
Thesis -
19
Depth Image Layers Separation (DILS) algorithm of image view synthesis based on stereo vision
Published 2013“…Each layer is extracted using inter-view interpolation to create objects based on location and depth. DILS is a new paradigm in selecting interesting image locations based on depth, but also in producing new image representations that allow objects or parts of an image to be described without the need of segmentation and identification. …”
Get full text
Get full text
Get full text
Article -
20
Optimizing palm oil biomass collection: genetic algorithm approaches in solving location-routing problem
Published 2025“…To achieve these objectives, the research employs genetic algorithm (GA) approaches, incorporating innovative strategies, namely automated mutation operator selection (AMOS) and elite child population (ECP). …”
Get full text
Get full text
Get full text
Article
