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 Books > 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 I(16597 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 I(16597 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 I(16597 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


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:

.- Estimating Subgraph Importance with Structural Prior Domain Knowledge.
.- A hierarchy tree data structure for behavior-based user segment representation.
.- S2tory: Story Spine Distillation for Movie Script Summarization.
.- Spatio-temporal Context-aware Web Service QoS Prediction via Contrastive Learning.
.- ShipTraj-R1: Reinforcing Ship Trajectory Prediction in Large Language Models via Group Relative Policy Optimization.
.- Enhancing Graph Neural Networks with Adaptive Relation Learning via Variational Inference.
.- ABK: Autonomous Bee Keeper – Beyond Monitoring and Onto Control.
.- Cross-domain Aspect Sentiment Triplet Extraction Based on Generative Data Augmentation and Pseudo-label Optimization.
.- TARP: An Effective and Efficient Route Prediction Method via Uncertainty-aware Traffic Imputation and Divide-and-Conquer Inference.
.- Boosting Black-box Graph Reconstruction Attacks via Adjacency Relationship Recovery of Representative Nodes.
.- Unified Local and Global Structure Learning for Feature Selection.
.- When SpikeKANFormer meets Angular contrastive learning.
.- NANSDE-Net: A NEURAL SDE FRAMEWORK FOR GENERATING TIME SERIES WITH MEMORY.
.- Dual-Modality Latent Gloss Alignment for Gloss-free Sign Language Translation.
.- Subject Information Extraction for Novelty Detection with Domain Shifts.
.- A VMD-Prior-guided Adaptive Learning Method for Multi-step Industrial Time Series Forecasting.
.- SGTRec: Integrating Spectral Encoding with Graph Neural Networks and Transformers for Recommendation.
.- PAED: Physics-Anchored and Emotion Disentangled Memory Diffusion for Talking Face Generation.
.- CeeDet: A Class-Incremental Learning Method with Early-Exit Mechanism for Malicious Traffic Detection in IIoT.
.- MUNet: A Multi-Outcome Uplift Network for Modeling Multi-Dimensional Treatment Effects.
.- ProvGrapher: A Top-K Approximate Tuple-Level Data Provenance Framework via Graph Neural Network.
.- SDMC-Mamba: Steel Surface Defect Detection Based on DDIM Enhanced Mamba with Multi-Module Collaboration.
.- TabTokWak: Token(less)-Value Watermarking for Tabular Foundational Models.
.- DENI: A Density-Enhanced Hybrid Sampling Framework with Neighborhood Information for Noisy Imbalanced Classification.
.- Probabilistic-Gap-Driven Relabeling Method for Positive-Negative-Unlabeled Learning with Label Selection Bias.
.- HERGC: Heterogeneous Experts Representation and Generative Completion for Multimodal Knowledge Graphs.
.- EXCODER: EXplainable Classification Of DiscretE time series Representations.
.- Neural-Symbolic Logic Query Answering in Non-Euclidean Space.
.- LAPTG: Length-Aligned Attentive Prefix-Target Graph for Sequential Recommendation.
.- Dual Nonlinear Sparse Feature Selection Method.
.- HEIR-Nets: Hierarchical Ensemble with Inheritance-based Refinement Networks for Sperm Target Detection with Noisy Labels.
.- SEEDS: Curriculum-Driven Adaptive Regression Contrastive Learning for Robust Evidence-based Depression Severity Classification.
.- Dual Self-Expression Subspace Clustering with Multi-Scale Features and Structural Consistency Alignment.
.- AnomalyFilter: Selective Denoising Diffusion Model for Time Series Anomaly Detection.
.- Nonlinear Characteristic-Driven Partial Multi-Label Learning.
.- Partial Multi-Label Learning via Label Anchor Graph.
.- Empowering Contactless Sleep Health Monitoring with Multi-task Learning.
.- Triangle Counting under Edge Relationship Local Differential Privacy: The Case of Restricted Extended Local Views.
.- Leveraging Variational Information Bottleneck for Fine-grained Urban Traffic Flow Inference.
.- Self-Weighted Contrastive Fusion for Deep Multi-View scRNA-seq Clustering.
.- When +1% Is Not Enough: A Paired Bootstrap Protocol for Evaluating Small Improvements.
.- DDCG : Dual-granularity Dual-domain Collaborative Graph Neural Networks for Time Series Forecasting.
.- A Transductive Model-Agnostic Contrastive Learning Framework for Few-Shot Learning.
.- IAMRec: Intent-Adaptive Multimodal Recommendation with Collaborative–Modality Disentanglement.
.- MPRL: Multi-Perspective Reinforcement Learning for Enhancing Format Adherence Capability of Large Language Models.
.- SegPPMTS: Unsupervised Segmentation for Pseudo-Periodic Medical Time Series.
.- Prototype Fusion: A Training-Free Multi-Layer Approach to OOD Detection.

       


Best Sellers


Product Details
  • ISBN-13: 9789819212996
  • Publisher: Springer Verlag, Singapore
  • Publisher Imprint: Springer Nature
  • Height: 235 mm
  • No of Pages: 615
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Series Title: 16597 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 9819212995
  • Publisher Date: 07 Jun 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 I


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 I(16597 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 I(16597 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 I(16597 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!