• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel & pussel

Upp till 25% på utvalda nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Informationsteknik: allmänt

    Knowledge Science, Engineering and Management

    17th International Conference, KSEM 2024, Birmingham, UK, August 16–18, 2024, Proceedings, Part II

    AvCungeng Cao,Huajun Chen

    Häftad, Engelska, 2024

    Del 14885 i serien Lecture Notes in Computer Science

    806 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    The five-volume set LNCS 14884, 14885, 14886, 14887 & 14888 constitutes the refereed deadline proceedings of the 17th International Conference on Knowledge Science, Engineering and Management, KSEM 2024, held in Birmingham, UK, during August 16–18, 2024.The 160 full papers presented in these proceedings were carefully reviewed and selected from 495 submissions. The papers are organized in the following topical sections:Volume I: Knowledge Science with Learning and AI (KSLA)Volume II: Knowledge Engineering Research and Applications (KERA)Volume III: Knowledge Management with Optimization and Security (KMOS)Volume IV: Emerging TechnologyVolume V: Special Tracks

    Produktinformation

    • Utgivningsdatum:2024-07-26
    • Mått:155 x 235 x 26 mm
    • Vikt:721 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:464
    • Förlag:Springer Verlag, Singapore
    • ISBN:9789819754946

    Utforska kategorier

    • Informationsteknik: allmänt inom Data och IT
    • Artificiell intelligens inom Data och IT
    • Hårdvara inom Data och IT

    Innehållsförteckning

    • .- Knowledge Engineering Research and Applications (KERA)..- Research on Node Cluster Analysis in Brain Connection Data..- A New Emotion Classification Method Based on JAN-VMD..- Neuro-Genetic System: A Hybrid System of CNN-BiLSTM Optimized by Genetic Algorithm for Road Accident Severity Prediction..- MoveFormer: Spatial Graph Periodic Injection Network for Next POI Recommendation..- Bio-Inspired Feature Selection via An Improved Binary Golden Jackal Optimization Algorithm..- Dynamic Reliability-optimised and Energy-efficient Scheduling Algorithms in Heterogeneous Multi-core Systems..- A Human-Computer Negotiation Model Based on Sentiment Analysis and Big Data..- A novel online sequential learning algorithm for ELM based on optimal control..- DICES: Diffusion-Based Contrastive Learning with Knowledge Graphs for Recommendation..- Variational Loss of Random Sampling for Searching Cluster Number..- DVDNER: Dual-view Learning Named Entity Recognition via Diffusion..- Achieving Universal Fairness in Machine Learning: A Multi-objective Optimization Perspective..- SSNF: Optimizing Entity Alignment with a Novel Structural and Semantic Neighbor Filtering..- Visual Analytics of Learning Behavior Based on the Dendritic Neuron Model..- Feature Matching Based Heterogeneous Transfer Learn-ing for Student Performance Prediction..- Weighted Multiple Source-Free Domain Adaptation Ensemble Network in Intelligent Machinery Fault Diagnosis..- Logarithm of Maximum Posterior Evidence: Advanced Model Selection for Text Classification..- A Hybrid Method Combing Reinforcement Learning and Heuristics in Solving Two-Echelon Vehicle Routing Problem with Backhauls..- AgriBERT: A Joint Entity Relation Extraction Model Based on Agricultural Text..- Research on Key Node Cluster Identification Algorithm based on Louvain and Cycle Ratio..- Uncertain $k$ center Clustering, Revisited: Point Assignment..- DPSPC: A Density Peak-based Statistical Parallel Clustering Algorithm for Big Data..- Insert Commonsense Knowledge through Semantics for Dialogue Generation..- Entity Set Expansion based on Category Prompts in MOOCs..- ViT Hybrid Channel Fit Pruning Algorithm for Co-Optimization of Hardware and Software for Edge Device..- Collaborative Adversarial Learning for Unsupervised Federated Domain Adaptation..- Improving Image Captioning with Image Concepts of Words..- M HGN: Multi information Enhanced Heterogeneous Graph Network for Multi-party Dialogue Reading Comprehension..- A Student Performance Prediction Model Based on Feature Factor Transfer..- A Binary Multi-objective Grey Wolf Optimization for Feature Selection..- CS Net: A Coarse-to-fine-grained Summarization Network for Community-based Question Answering Summarization..- AutoIE: An Automated Framework for Information Extraction from Scientific Literature..- Adaptive Density Peak Clustering with Optimized Border-peeling..- Efficient Affinity Propagation Clustering Based on Szemer´edi’s Regularity Lemma.