Neural Information Processing: 29th International Conference, ICONIP 2022, Virtual Event, November 22–26, 2022, Proceedings, Part IV: Communications in Computer and Information Science, cartea 1791
Editat de Mohammad Tanveer, Sonali Agarwal, Seiichi Ozawa, Asif Ekbal, Adam Jatowten Limba Engleză Paperback – 15 apr 2023
The four-volume set CCIS 1791, 1792, 1793 and 1794 constitutes the refereed proceedings of the 29th International Conference on Neural Information Processing, ICONIP 2022, held as a virtual event, November 22–26, 2022.
The 213 papers presented in the proceedings set were carefully reviewed and selected from 810 submissions. They were organized in topical sections as follows: Theory and Algorithms; Cognitive Neurosciences; Human Centered Computing; and Applications.
The ICONIP conference aims to provide a leading international forum for researchers, scientists, and industry professionals who are working in neuroscience, neural networks, deep learning, and related fields to share their new ideas, progress, and achievements.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (7) | 519.69 lei 6-8 săpt. | |
| Springer International Publishing – 13 apr 2023 | 519.69 lei 6-8 săpt. | |
| Springer Nature Singapore – 15 apr 2023 | 635.26 lei 6-8 săpt. | |
| Springer Nature Singapore – 15 apr 2023 | 637.18 lei 6-8 săpt. | |
| Springer International Publishing – 13 apr 2023 | 637.96 lei 6-8 săpt. | |
| Springer Nature Singapore – 15 apr 2023 | 696.46 lei 6-8 săpt. | |
| Springer International Publishing – 13 apr 2023 | 697.08 lei 6-8 săpt. | |
| Springer Nature Singapore – 15 apr 2023 | 751.45 lei 6-8 săpt. |
Din seria Communications in Computer and Information Science
- 20%
Preț: 460.54 lei - 20%
Preț: 313.10 lei - 20%
Preț: 643.20 lei - 20%
Preț: 312.30 lei - 20%
Preț: 324.99 lei - 20%
Preț: 630.84 lei - 20%
Preț: 634.45 lei - 20%
Preț: 321.17 lei - 20%
Preț: 324.68 lei - 20%
Preț: 631.00 lei - 20%
Preț: 631.31 lei - 20%
Preț: 633.83 lei -
Preț: 377.68 lei - 20%
Preț: 388.30 lei - 20%
Preț: 317.05 lei -
Preț: 371.37 lei - 20%
Preț: 323.23 lei - 20%
Preț: 423.73 lei - 20%
Preț: 321.81 lei - 20%
Preț: 319.13 lei - 20%
Preț: 630.51 lei - 20%
Preț: 325.61 lei - 20%
Preț: 321.17 lei - 20%
Preț: 321.81 lei - 20%
Preț: 325.79 lei - 20%
Preț: 640.83 lei - 20%
Preț: 323.23 lei - 20%
Preț: 325.79 lei - 20%
Preț: 317.68 lei - 20%
Preț: 635.26 lei - 15%
Preț: 623.39 lei - 20%
Preț: 628.32 lei - 20%
Preț: 319.42 lei - 20%
Preț: 324.99 lei - 20%
Preț: 1014.25 lei - 20%
Preț: 804.07 lei - 20%
Preț: 529.54 lei - 20%
Preț: 631.31 lei - 20%
Preț: 1183.08 lei - 20%
Preț: 494.98 lei - 20%
Preț: 388.26 lei - 20%
Preț: 318.67 lei - 20%
Preț: 389.14 lei - 20%
Preț: 323.23 lei - 20%
Preț: 458.73 lei - 20%
Preț: 530.40 lei - 20%
Preț: 388.00 lei - 20%
Preț: 632.09 lei - 20%
Preț: 388.91 lei - 20%
Preț: 310.73 lei
Preț: 696.46 lei
Preț vechi: 870.57 lei
-20% Nou
Puncte Express: 1045
Preț estimativ în valută:
123.22€ • 143.77$ • 107.73£
123.22€ • 143.77$ • 107.73£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789819916382
ISBN-10: 9819916380
Pagini: 707
Ilustrații: XXXV, 707 p. 203 illus., 176 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.03 kg
Ediția:1st ed. 2023
Editura: Springer Nature Singapore
Colecția Springer
Seria Communications in Computer and Information Science
Locul publicării:Singapore, Singapore
ISBN-10: 9819916380
Pagini: 707
Ilustrații: XXXV, 707 p. 203 illus., 176 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.03 kg
Ediția:1st ed. 2023
Editura: Springer Nature Singapore
Colecția Springer
Seria Communications in Computer and Information Science
Locul publicării:Singapore, Singapore
Cuprins
Theory and Algorithms.- Knowledge Transfer from Situation Evaluation to Multi-agent Reinforcement Learning.- Sequential three-way rules class-overlap under-sampling based on fuzzy hierarchical subspace for imbalanced data.- Two-stage Multilayer Perceptron Hawkes Process.- The Context Hierarchical Contrastive Learning for Time Series in Frequency Domain.- Hawkes Process via Graph Contrastive Discriminant representation Learning and Transformer capturing long-term dependencies.- A Temporal Consistency Enhancement Algorithm Based On Pixel Flicker Correction.- Data representation and clustering with double low-rank constraints.- RoMA: a Method for Neural Network Robustness Measurement and Assessment.- Independent Relationship Detection for Real-Time Scene Graph Generation.- A multi-label feature selection method based on feature graph with ridge regression and eigenvector centrality.- O3GPT: A Guidance-Oriented Periodic Testing Framework with Online Learning, Online Testing,and Online Feedback.- AFFSRN: Attention-Based Feature Fusion Super-Resolution Network.- Temporal-Sequential Learning with Columnar-Structured Spiking Neural Networks.- Graph Attention Transformer Network for Robust Visual Tracking.- GCL-KGE:Graph Contrastive Learning for Knowledge Graph Embedding.- Towards a Unified Benchmark for Reinforcement Learning in Sparse Reward Environments.- Effect of Logistic Activation Function and Multiplicative Input Noise on DNN-kWTA model.- A High-Speed SSVEP-Based Speller Using Continuous Spelling Method.- AAT: Non-Local Networks for Sim-to-Real Adversarial Augmentation Transfer.- Aggregating Intra-class and Inter-class information for Multi-label Text Classification.- Fast estimation of multidimensional regression functions by the Parzen kernel-based method.- ReGAE: Graph autoencoder based on recursive neural networks.- Efficient Uncertainty Quantification for Under-constraint Prediction following Learning using MCMC.- SMART: A Robustness Evaluation Framework for Neural Networks.- Time-aware Quaternion Convolutional Network for Temporal Knowledge Graph Reasoning.- SumBART - An improved BART model for abstractive text summarization.- Saliency-Guided Learned Image Compression for Object Detection.- Multi-Label Learning with Data Self-Augmentation.- MnRec: A News Recommendation Fusion Model Combining Multi-granularity Information.- Infinite Label Selection Method for Mutil-label Classification.- Simultaneous Perturbation Method for Multi-Task Weight Optimization in One-Shot Meta-Learning.- Searching for Textual Adversarial Examples with Learned Strategy.- Multivariate Time Series Retrieval with Binary Coding from Transformer. -Learning TSP Combinatorial Search and Optimization with Heuristic Search.- A Joint Learning Model for Open Set Recognition with Post-processing.- Cross-Layer Fusion for Feature Distillation.- MCHPT: A Weakly Supervise Based Merchant Pre-trained Model.- Progressive Latent Replay for efficient Generative Rehearsal.- Generalization Bounds for Set-to-Set Matching with Negative Sampling.- ADA: An Attention-Based Data Augmentation Approach to Handle Imbalanced Textual Datasets.- Countering the Anti-detection Adversarial Attacks.- Evolving Temporal Knowledge Graphs by Iterative Spatio-Temporal Walks.- Improving Knowledge Graph Embedding Using Dynamic Aggregation of Neighbor Information.- Generative Generalized Zero-Shot Learning based on Auxiliary-Features.- Learning Stable Representations with Progressive Autoencoder (PAE).- Effect of Image Down-sampling on Detection of Adversarial Examples .- Boosting the Robustness of Neural Networks with M-PGD.- StatMix: Data augmentation method that relies on image statistics in federated learning.- Classification by Components Including Chow's Reject Option. -Community discovery algorithm based on improved deep sparse autoencoder.- Fairly Constricted Multi-Objective Particle Swarm Optimization.- Argument Classification with BERT plus Contextual, Structural andSyntactic Features as Text.- Variance Reduction for Deep Q-Learning using Stochastic Recursive Gradient.- Optimizing Knowledge Distillation Via Shallow Texture Knowledge Transfer.- Unsupervised Domain Adaptation Supplemented with Generated Images.- MAR2MIX: A Novel Model for Dynamic Problem in Multi-Agent Reinforcement Learning.- Adversarial Training with Knowledge Distillation Considering Intermediate Representations in CNNs.- Deep Contrastive Multi-view Subspace Clustering.