Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
model algorithm » mould algorithm (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
model algorithm » mould algorithm (Expand Search)
element » elements (Expand Search)
-
21
-
22
-
23
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
Published 2022“…Moreover, the image pixels in different and more similar areas of the image are located next to one another in a group and classified using the specified thresholds. As a result, the embedding capacity in each class can increase by reducing the value of the difference between two consecutive pixels, and the distortion of the marked image can decrease after inserting the personal data using the DE method. …”
Get full text
-
24
-
25
-
26
Using Machine Learning Algorithms to Forecast Solar Energy Power Output
Published 2025“…We focused on the first 30-min, 3-h, 6-h, 12-h, and 24-h windows to gain an appreciation of the impact of forecasting duration on the accuracy of prediction using the selected machine learning algorithms. The study results show that Random Forest outperformed all other tested algorithms. …”
-
27
Limiting the Collection of Ground Truth Data for Land Use and Land Cover Maps with Machine Learning Algorithms
Published 2022“…This was accomplished by (1) extracting reliable LULC information from Sentinel-2 and Landsat-8 s images, (2) generating remote sensing indices used to train ML algorithms, and (3) comparing the results with ground truth data. …”
-
28
Improvement of Kernel Principal Component Analysis-Based Approach for Nonlinear Process Monitoring by Data Set Size Reduction Using Class Interval
Published 2024“…<p dir="ltr">Fault detection and diagnosis (FDD) systems play a crucial role in maintaining the adequate execution of the monitored process. One of the widely used data-driven FDD methods is the Principal Component Analysis (PCA). …”
-
29
A genetic algorithm for testable data path synthesis
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
30
A neural networks algorithm for data path synthesis
Published 2003“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
31
Data reductions and combinatorial bounds for improved approximation algorithms
Published 2016“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text
article -
32
Distributed dimension reduction algorithms for widely dispersed data
Published 2002Get full text
Get full text
Get full text
conferenceObject -
33
-
34
Gas Metal Arc Welding (GMAW) Process Optimization Using Machine Learning Models
Published 2023Get full text
doctoralThesis -
35
Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering
Published 2022“…This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. …”
-
36
-
37
-
38
Variable Selection in Data Analysis: A Synthetic Data Toolkit
Published 2024“…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
Get full text
article -
39
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…The proposed method, named Eye-means, emulates the natural ocular process of estimating initial centroids. To achieve this goal, supervised machine learning was employed to train models on graphs with labeled data points, where each graph contains a set of points and a label indicating the centroid determined by K-means. …”
Get full text
Get full text
Get full text
masterThesis -
40