Advances in Knowledge Discovery and Data Mining
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology Books > Computer science > Artificial intelligence > Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)
Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)

Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

The four-volume set, LNAI 16597-16600 constitutes the proceedings of the 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, held in Hong Kong, China, during June 9–12, 2026.

The 184 full papers presented in this book were carefully selected and reviewed from 728 submissions. 

This program featured three tracks, the Main Track, the Survey Track, and the Special Track on LLMs for Data Science. 

The Main Track continued its tradition of being the premier forum for the presentation of research results and experience reports on knowledge discovery, data science, and machine learning.

The Survey Track was introduced in 2025 for the first time, to promote the dissemination of insightful survey papers: survey papers are intended to provide a structured synthesis of a particular topic in the area of data mining, including but not limited to theoretical foundations of mining, inference, and learning, big data technologies, as well as security, privacy, and integrity, for the perusal of junior researchers and of experts from other research fields.

As the rapid advancements in Large Language Models (LLMs) have opened new avenues for innovation and research across various domains, particularly in the field of data science, we introduced the Special Track on LLMs, which aimed to explore the transformative potential of LLMs for data science, bringing together researchers, practitioners, and industry experts to discuss the latest developments, challenges, and opportunities in this rapidly growing area.



Table of Contents:

.- AVER:Adversarial Variational Enhanced Representation Architecture for Abstractive Multi-Document Summarization.
.- TheSelective: Dual Affinity–Guided Diffusion for Selective Molecular Generation.
.- A Novel Hierarchical Multi-Agent System for Payments Using LLMs.
.- Rethinking Unlearnable Examples in the Context of the Right to be Forgotten.
.- Divergence-Based Similarity Function for Multi-View Contrastive Learning.
.- RectiCast: Rectifying Distribution Shift in Cascaded Precipitation Nowcasting.
.- DeltaAug: A Directional Semantic Data Augmentation Framework Guided by Differential Reasoning.
.- Counteracting Popularity Bias Amplification in Bundle Recommendations with Latent Factor Constraints.
.- Neuro-Symbolic Learning for Predictive Process Monitoring via Two-Stage Logic Tensor Networks with Rule Pruning.
.- EmbryoCST: A Stage-Aware ResNet with Layered CNN-3D Swin Transformer for Embryo Stage Classification.
.- PMME: Spatio-Temporal Few-shot Learning via Pattern Matching with Memory Enhancement.
.- Semantic Steer Chain: Efficient and Precise Black-Box Jailbreaking through Adaptive Approximation.
.- AutoPrep-MM: Reinforcement Learning for Multimodal Data Preprocessing with Graph-based Interaction Modeling.
.- Meta-RL with Shared Representations Enables Fast Adaptation in Energy Systems.
.- EarlyShield: Early-Stage Screening for Robust Personalized Federated Learning.
.- R^2R: A Route-to-Rerank Post-Training Framework for Multi-Domain Decoder-Only Rerankers.
.- HIGR: Hierarchical Iterative Graph Reasoner for Document-Level Event Causality Identification.
.- Robust Volume Ratio: A Metric for Fine-Grained Evaluation of Tree Ensemble Robustness.
.- MJOS: A Multi-Stage Joint Optimization Strategy for Convolutional Neural Network Compression.
.- FIGDA: Feature Importance Guided Learning Model for Domain-Adaptive Anomaly Detection.
.- Unified Loss-Level Regularization for Spike-Aware and Anti-Lag Time Series Forecasting.
.- BatterySurAD: A Dataset for Anomaly Detection on Cylindrical Battery Surfaces with Spatial Zone Annotations.
.- MITS: Enhanced Tree Search Reasoning for LLMs via Pointwise Mutual Information.
.- Mosaic: an Accurate and Efficient Kernel-based Multivariate Time Series Classifier.
.- Schema-Agnostic Feature Extractor using LLM and Transformer for RUL Prediction.
.- Recommending under-represented influential researchers using geographically aware contrastive learning.
.- TS-Unlearn: A Dual-Objective Unlearning Framework for Time Series Forecasting.
.- Subgraph Plug-in Boosts up Graph Neural Networks.
.- FedCKD: A Knowledge Distillation Approach to Cross-client Learning in Federated Learning with Label-exclusive Datasets.
.- Distillation-based Scenario-Adaptive Mixture-of-Experts for the Matching Stage of Multi-scenario Recommendation.
.- Tri-ABL: Enhancing ABL Using Three Learners.
.- Unsupervised Symbolic Anomaly Detection.
.- Diverse and Task-Specific Data Selection For Instruction Tuning.
.- Noise-Aware Multi-inference Self-regulation for Self-supervised denoising.
.- DrIM: Context-Driven Nearest Neighbor Imputation using Language Representation.
.- LLM-Guided Role Assignment and Coordination in Multi-Agent Reinforcement Learning.
.- ContinualCropBank: Object-Level Replay for Semi-Supervised Online Continual Object Detection.
.- Unlearning Spurious Concepts Enhances the Robustness of Concept-based Explainable Models in Skin Cancer Diagnosis.
.- ELC U-Mamba: Efficient Linear-Chunked Mamba for Coal Microscopic Image Segmentation.
.- SGF-Net: Fusing SMILES, Graph, and Fingerprints for Molecular Property Prediction.
.- HiMoE-CCTC: A Hierarchical Mixture-of-Experts Framework for Citizen Complaint Text Classification.
.- SAM-3D-MSF: Parameter-Efficient Adaptation of Segment Anything Model for 3D Tooth CBCT Segmentation.
.- Relation Prototype Driven Multimodal Knowledge Graph Completion.
.- Anomaly Edge Detection in Dynamic Graphs Based on Hyperbolic Graph Neural Networks.
.- Risk-aware Skill-coverage Hybrid Workforce Configuration on Social Networks.
.- Channel Dependence, Limited Lookback Windows, and the Simplicity of Datasets: How Biased is Time Series Forecasting?.
.- MultiADC: Advanced Antibody-Drug Conjugate Activity Prediction through Multi-scale Feature Fusion.


Best Sellers


Product Details
  • ISBN-13: 9789819214617
  • Publisher: Springer Verlag, Singapore
  • Publisher Imprint: Springer Nature
  • Height: 235 mm
  • No of Pages: 559
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Series Title: 16598 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 9819214610
  • Publisher Date: 11 Jul 2026
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Sub Title: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)
Springer Verlag, Singapore -
Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advances in Knowledge Discovery and Data Mining: 30th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2026, Hong Kong, China, June 9–12, 2026, Proceedings, Part II(16598 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!