Search alternatives:
orientation » presentation (Expand Search)
augmentation » fragmentation (Expand Search)
orientation » presentation (Expand Search)
augmentation » fragmentation (Expand Search)
-
1
-
2
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. …”
-
3
K Nearest Neighbor OveRsampling approach: An open source python package for data augmentation
Published 2022“…This paper introduces K Nearest Neighbor OveRsampling (KNNOR) Algorithm — a novel data augmentation technique that considers the distribution of data and takes into account the k nearest neighbors while generating artificial data points. …”
-
4
Oversampling techniques for imbalanced data in regression
Published 2024“…For tabular data we conducted a comprehensive experiment using various models trained on both augmented and non-augmented datasets, followed by performance comparisons on test data. …”
-
5
Data Embedding in HEVC Video by Modifying the Partitioning of Coding Units
Published 2019Subjects: Get full text
article -
6
Detecting latent classes in tourism data through response-based unit segmentation (REBUS) in Pls-Sem
Published 2016“…This research note describes Response-Based Unit Segmentation (REBUS), a “latent class detection” technique used in partial least squares–structural equation modeling (PLS-SEM) to examine data heterogeneity. …”
Get full text
Get full text
Get full text
Get full text
article -
7
KNNOR: An oversampling technique for imbalanced datasets
Published 2021“…The proposed technique called K-Nearest Neighbor OveRsampling approach (KNNOR) performs a three step process to identify the critical and safe areas for augmentation and generate synthetic data points of the minority class. …”
-
8
-
9
Efficient Approximate Conformance Checking Using Trie Data Structures
Published 2021“…We show how our algorithm supports the definition of a budget for alignment computation and also augment it with strategies for meta-heuristic optimization and pruning of the search space. …”
Get full text
Get full text
Get full text
-
10
A multi-pretraining U-Net architecture for semantic segmentation
Published 2025“…Particularly, we present a novel non-sequential multi-pretraining U-Net architecture and demonstrate that employing a number of persistent parallel models can boost the effectiveness of the segmentation procedures. The proposed approach makes advantage of data augmentation to generate newly synthesized images, which are subsequently processed using a watershed mask. …”
-
11
-
12
-
13
VEGAWES: variational segmentation on whole exome sequencing for copy number detection
Published 2015“…In this work, we developed VEGAWES for accurate and robust detection of copy number variations on WES data. VEGAWES is an extension to a variational based segmentation algorithm, VEGA: Variational estimator for genomic aberrations, which has previously outperformed several algorithms on segmenting array comparative genomic hybridization data. …”
-
14
-
15
-
16
-
17
Mapping realistic data sets on parallel computers
Published 1993“…The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
18
Graph Contraction for Mapping Data on Parallel Computers
Published 1994“…Then we present a mapping-oriented parallel graph contraction (PGC) heuristic algorithm that yields a smaller representation of the problem to which mapping is then applied. …”
Get full text
Get full text
Get full text
article -
19
-
20