Advances in Knowledge Discovery and Data Mining by Jaideep Srivastava
Home > General > Advances in Knowledge Discovery and Data Mining
Advances in Knowledge Discovery and Data Mining

Advances in Knowledge Discovery and Data Mining


     0     
5
4
3
2
1



International Edition


About the Book

Classical Data Mining, . Mining Frequent Patterns from Hypergraph Databases.- Discriminating Frequent Pattern based Supervised Graph Embedding for Classification.- Mining Sequential Patterns in Uncertain Databases Using Hierarchical Index Structure.- Similarity Forest Revisited: a Swiss Army Knife for Machine Learning.- Discriminative Representation Learning for Cross-domain Sentiment Classification.- SAGCN: Towards Structure-Aware Deep Graph Convolutional Networks on Node Classification.- Hierarchical Learning of Dependent Concepts for Human Activity Recognition.- Improving Short Text Classification Using Context-Sensitive Representations and Content-Aware Extended Topic Knowledge.- A Novel Method for Offline Handwritten Chinese Character Recognition under the Guidance of Print.- Upgraded Attention-based Local FeatureLearning Block for speech emotion recognition.- Memorization in Deep Neural Networks: Does the Loss Function matter.- Gaussian Soft Decision Trees for Interpretable Feature-Based Classification.- Efficient Nodes Representation Learning with Residual Feature Propagation.- Progressive AutoSpeech: An efficient and general framework for automatic speech classification.- CrowdTeacher: Robust Co-teaching with Noisy Answers & Sample-specific Perturbations for Tabular Data.- Effective and Adaptive Multi-metric Refined Similarity Graph Fusion for Multi-view Clustering.- aHCQ: Adaptive Hierarchical Clustering based Quantization Framework for Deep Neural Networks.- Maintaining Consistency with Constraints: a Constrained Deep Clustering method.- Data Mining Theory and Principles.- Towards multi-label Feature selection by Instance and Label Selections.- FARF: A Fair and Adaptive Random Forests Classifier.- Sparse Spectrum Gaussian Process for Bayesian Optimization.- Densely Connected Graph Attention Network based on Iterative Path Reasoning for Document-level Relation Extraction.- Causal Inference Using Global Forecasting Models for Counterfactual Prediction. -CED-BGFN: Chinese Event Detection via Bidirectional Glyph-aware Dynamic Fusion Network.- Learning Finite Automata with Shuffle.- Active Learning based Similarity Filtering for Efficient and Effective Record Linkage.- Stratified Sampling for Extreme Multi-Label Data.- Vertical Federated Learning for Higher-order Factorization Machines.- dK-Projection: Publishing Graph Joint degree distribution with Node Differential Privacy.- Recommender Systems.- Improving Sequential Recommendation with Attribute-augmented Graph Neural Networks.- Exploring Implicit Relationships in Social Network for Recommendation Systems.- Transferable Contextual Bandits with Prior Observations.- Modeling Hierarchical Intents and Selective Current Interest for Session-based Recommendation.- A Finetuned language model for Recommending cQA-QAs for enriching Textbooks.- XCrossNet: Feature Structure-Oriented Learning for Click-Through Rate Prediction.- Learning Multiclass Classifier Under Noisy Bandit Feedback.- Diversify or Not: Dynamic Diversification for Personalized Recommendation.- Multi-criteria and Review-based Overall Rating Prediction.- W2FM: The Doubly-Warped Factorization Machine.- Causal Combinatorial Factorization Machines for Set-wise Recommendation.- Transformer-based Multi-task Learning for Queuing Time Aware Next POI Recommendation.- Joint Modeling Dynamic Preferences of Users and Items Using Reviews for Sequential Recommendation.- Box4Rec: Box Embedding for Sequential Recommendation.- UKIRF: An Item Rejection Framework for Improving Negative Items Sampling in One-Class Collaborative Filtering.- IACN: Influence-aware and Attention-based Co-evolutionary Network for Recommendation.- Nonlinear Matrix Factorization via Neighbor Embedding.- Deconfounding representation learning based on user interactions in Recommendation Systems.- Personalized Regularization Learning for Fairer Matrix Factorization.- Instance Selection for Online Updating in Dynamic Recommender Environments.- Text Analytics.


Best Sellers



Product Details
  • ISBN-13: 9783030757649
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 774
  • Spine Width: 40 mm
  • Weight: 1151 gr
  • ISBN-10: 3030757641
  • Publisher Date: 17 Jun 2021
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: 25th Pacific-Asia Conference, Pakdd 2021, Virtual Event, May 11-14, 2021, Proceedings, Part II
  • Width: 156 mm


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
Springer International Publishing -
Advances in Knowledge Discovery and Data Mining
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

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

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!