Cantitate/Preț
Produs
Total produse
Vezi coșul
Analysis of Images, Social Networks and Texts: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers de Dmitry I. Ignatov

Analysis of Images, Social Networks and Texts: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers: Lecture Notes in Computer Science, cartea 14486

Editat de Dmitry I. Ignatov, Michael Khachay, Andrey Kutuzov, Habet Madoyan, Ilya Makarov, Irina Nikishina, Alexander Panchenko, Maxim Panov, Panos M. Pardalos, Andrey V. Savchenko, Evgenii Tsymbalov, Elena Tutubalina, Sergey Zagoruyko
en Limba Engleză Paperback – 20 mar 2024
This book constitutes revised selected papers from the thoroughly refereed proceedings of the 11th International Conference on Analysis of Images, Social Networks and Texts, AIST 2023, held in Yerevan, Armenia, during September 28-30, 2023. 
 
The 24 full papers included in this book were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows: natural language processing; computer vision; data analysis and machine learning; network analysis; and theoretical machine learning and optimization. The book also contains one invited talk in full paper length. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 44193 lei

Preț vechi: 55242 lei
-20% Nou

Puncte Express: 663
Preț estimativ în valută:
8458€ • 8792$ • 7007£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031545337
ISBN-10: 3031545338
Ilustrații: XXVII, 364 p. 117 illus., 74 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

​Invited Paper: Threatening Expression and Target Identification in under-resource languages using NLP Techniques.- Natural Language Processing: Benchmarking Multi-Label Topic Classification in Kyrgyz Language.- Transformers compression: A study of matrix decomposition methods using Fisher information.- Leveraging Lexical Taxonomy Data in Large Language Models for Hyponymy Prediction.- Content selection in abstractive summarization with biased encoder mixtures.- RuCAM: Comparative Argumentative Machine for the Russian Language.- Paraphrasers and Classifiers: Controllable Text Generation for Text Style Transfer.- Less than Necessary or More than Sufficient: Validating Probing Dataset Size.- Unsupervised Ultra-Fine Entity Typing with Distributionally Induced Word Senses.- Static, dynamic, or contextualized: what is the best approach for discovering semantic shifts in Russian media?.- Controllable Story Generation Based on Perplexity Minimization.- Automatic Detection of Dialectal Features of Pskov Dialects in the Speech of Native Speakers.- Needle in a Haystack: Finding Suitable Idioms Based on Text Descriptions.- Computer Vision: DeepLOC: Deep Learning-based Bone Pathology Localization and Classification in Wrist X-ray Images.- MiVOLO: Multi-input Transformer for Age and Gender Estimation.- Handwritten Text Recognition and Browsing in Archive of Prisoners’ Letters from Smolensk Convict Prison.- Greedy Algorithm for Fast Finding Curvilinear Symmetry of Binary Raster Images.-Data Analysis and Machine Learning: Ensemble Clustering with Heterogeneous Transfer Learning.- Detecting design patterns in Android applications with CodeBERT embeddings and CK metrics.- Metamorphic testing for recommender systems.- Application of Dynamic Graph CNN* and FICP for Detection and Research Archaeology Sites.- Network Analysis: Visualization-Driven Graph Sampling Strategy for Exploring Large-Scale Networks.- Limit Distributions of Friendship Index in Scale-Free Networks.- Theoretical Machine Learning and Optimization: The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph.- Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalitie.