Muutke küpsiste eelistusi

E-raamat: Analysis of Images, Social Networks and Texts: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28-30, 2023, Revised Selected Papers

Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by
  • Formaat - EPUB+DRM
  • Hind: 74,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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. 
Invited Paper: Threatening Expression and Target Identication in
under-resource languages using NLP Techniques.- Natural Language
Processing: Benchmarking Multi-Label Topic Classication 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 Classiers: Controllable
Text Generation for Text Style Transfer.- Less than Necessary or More than
Sucient: 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 Classication 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 Caneld Right? On the Asymptotic Coecients
for the Maximum Antichain of Partitions and Related Counting Inequalitie.