UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Anomaly detection in dynamic attributed networks

Neural computing & applications, 2021-03, Vol.33 (6), p.2125-2136

2021

Volltextzugriff (PDF)

Nonparallel Support Vector Ordinal Regression

IEEE transactions on cybernetics, 2017-10, Vol.47 (10), p.3306-3317

2017

Volltextzugriff (PDF)

A Survey on Feature Selection

Procedia computer science, 2016, Vol.91, p.919-926

2016

Volltextzugriff (PDF)

Learning With Label Proportions via NPSVM

IEEE transactions on cybernetics, 2017-10, Vol.47 (10), p.3293-3305

2017

Volltextzugriff (PDF)

Learning Robust Auto-Encoders With Regularizer for Linearity and Sparsity

IEEE access, 2019, Vol.7, p.17195-17206

2019

Volltextzugriff (PDF)

Graph-Based Clustering via Group Sparsity and Manifold Regularization

IEEE access, 2019, Vol.7, p.172123-172135

2019

Volltextzugriff (PDF)

Transformed ℓ1 regularization for learning sparse deep neural networks

Neural networks, 2019-11, Vol.119, p.286-298

2019

Volltextzugriff (PDF)

Two-level adversarial attacks for graph neural networks

Information sciences, 2024-01, Vol.654, p.119877, Article 119877

2024

Volltextzugriff (PDF)

Support vector machine classifier with truncated pinball loss

Pattern recognition, 2017-08, Vol.68, p.199-210

2017

Volltextzugriff (PDF)

Sparse CapsNet with explicit regularizer

Pattern recognition, 2022-04, Vol.124, p.108486, Article 108486

2022

Volltextzugriff (PDF)

Training the max-margin sequence model with the relaxed slack variables

Neural networks, 2012-09, Vol.33, p.228-235

2012

Volltextzugriff (PDF)

Graph regularized locally linear embedding for unsupervised feature selection

Pattern recognition, 2022-02, Vol.122, p.108299, Article 108299

2022

Volltextzugriff (PDF)

Unsupervised feature selection for attributed graphs

Expert systems with applications, 2021-04, Vol.168, p.114402, Article 114402

2021

Volltextzugriff (PDF)

Wasserstein distance regularized graph neural networks

Information sciences, 2024-06, Vol.670, p.120608, Article 120608

2024

Volltextzugriff (PDF)

Training Compact DNNs with ℓ1/2 Regularization

Pattern recognition, 2023-04, Vol.136, Article 109206

2023

Volltextzugriff (PDF)

Diluted binary neural network

Pattern recognition, 2023-08, Vol.140, p.109556, Article 109556

2023

Volltextzugriff (PDF)

Sparse optimization guided pruning for neural networks

Neurocomputing (Amsterdam), 2024-03, Vol.574, p.127280, Article 127280

2024

Volltextzugriff (PDF)

Feature Selection of Network Data VIA ℓ2,p Regularization

Cognitive computation, 2020-11, Vol.12 (6), p.1217-1232

2020

Volltextzugriff (PDF)

Diffusion network embedding

Pattern recognition, 2019-04, Vol.88, p.518-531

2019

Volltextzugriff (PDF)

Two New Decomposition Algorithms for Training Bound-Constrained Support Vector Machines

Foundations of computing and decision sciences, 2015-03, Vol.40 (1), p.67-86

2015

Volltextzugriff (PDF)

Unsupervised feature selection by non-convex regularized self-representation

Expert systems with applications, 2021-07, Vol.173, p.114643, Article 114643

2021

Volltextzugriff (PDF)

Knowledge Graph Embedding by Double Limit Scoring Loss

IEEE transactions on knowledge and data engineering, 2022-12, Vol.34 (12), p.5825-5839

2022

Volltextzugriff (PDF)

Distant Supervision Relation Extraction via adaptive dependency-path and additional knowledge graph supervision

Neural networks, 2021-02, Vol.134, p.42-53

2021

Volltextzugriff (PDF)

DigGCN: Learning Compact Graph Convolutional Networks via Diffusion Aggregation

IEEE transactions on cybernetics, 2022-02, Vol.52 (2), p.912-924

2022

Volltextzugriff (PDF)

A brief survey on Computational Gromov-Wasserstein distance

Procedia computer science, 2022, Vol.199, p.697-702

2022

Volltextzugriff (PDF)

1 – 25 von 70

Menü

Weitere Dienste

Einstellungen

Anomaly detection in dynamic attributed networks

Nonparallel Support Vector Ordinal Regression

A Survey on Feature Selection

Learning With Label Proportions via NPSVM

Learning Robust Auto-Encoders With Regularizer for Linearity and Sparsity

Graph-Based Clustering via Group Sparsity and Manifold Regularization

Transformed ℓ1 regularization for learning sparse deep neural networks

Two-level adversarial attacks for graph neural networks

Support vector machine classifier with truncated pinball loss

Sparse CapsNet with explicit regularizer

Training the max-margin sequence model with the relaxed slack variables

Graph regularized locally linear embedding for unsupervised feature selection

Unsupervised feature selection for attributed graphs

Wasserstein distance regularized graph neural networks

Training Compact DNNs with ℓ1/2 Regularization

Diluted binary neural network

Sparse optimization guided pruning for neural networks

Feature Selection of Network Data VIA ℓ2,p Regularization

Diffusion network embedding

Two New Decomposition Algorithms for Training Bound-Constrained Support Vector Machines

Unsupervised feature selection by non-convex regularized self-representation

Knowledge Graph Embedding by Double Limit Scoring Loss

Distant Supervision Relation Extraction via adaptive dependency-path and additional knowledge graph supervision

DigGCN: Learning Compact Graph Convolutional Networks via Diffusion Aggregation

A brief survey on Computational Gromov-Wasserstein distance

Aktive Filter

Suchergebnisse filtern