Advances in Knowledge Discovery and Data Mining
Home > Computing and Information Technology > Databases > Data mining > Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 Lecture Notes in Computer Science)
Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 Lecture Notes in Computer Science)

Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




Available


About the Book

The two-volume set LNAI 7818 + LNAI 7819 constitutes the refereed proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013, held in Gold Coast, Australia, in April 2013. The total of 98 papers presented in these proceedings was carefully reviewed and selected from 363 submissions. They cover the general fields of data mining and KDD extensively, including pattern mining, classification, graph mining, applications, machine learning, feature selection and dimensionality reduction, multiple information sources mining, social networks, clustering, text mining, text classification, imbalanced data, privacy-preserving data mining, recommendation, multimedia data mining, stream data mining, data preprocessing and representation.

Table of Contents:
Discovering Local Subgroups, with an Application to Fraud Detection.- PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data.- Frequent Pattern Mining in Attributed Trees.- Mining Frequent Patterns from Human Interactions in Meetings Using Directed Acyclic Graphs.- ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences.- Efficient Mining of Contrast Patterns on Large Scale Imbalanced Real-Life Data.- Online Cross-Lingual PLSI for Evolutionary Theme Patterns Analysis.- F-Trail: Finding Patterns in Taxi Trajectories.- Mining Appliance Usage Patterns in Smart Home Environment.- Computational Models of Stress in Reading Using Physiological and Physical Sensor Data.- Latent Patient Profile Modelling and Applications with Mixed-Variate Restricted Boltzmann Machine.- MassBayes: A New Generative Classifier with Multi-dimensional Likelihood Estimation.- Fast and Effective Single Pass Bayesian Learning.- Sparse Reductions for Fixed-Size Least Squares Support Vector Machines on Large Scale Data.- Discovery of Regional Co-location Patterns with k-Nearest Neighbor Graph.- Spectral Decomposition for Optimal Graph Index Prediction.- Patterns amongst Competing Task Frequencies: Super-Linearities, and the Almond-DG Model.- Node Classification in Social Network via a Factor Graph Model.- Fast Graph Stream Classification Using Discriminative Clique Hashing.- Mining Interesting Itemsets in Graph Datasets.- Robust Synchronization-Based Graph Clustering.- Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors.- Exploiting Temporal Information in a Two-Stage Classification Framework for Content-Based Depression Detection.- EEG-Based Person Verification Using Multi-Sphere SVDD and UBM.- Measuring Reproducibility of High-Throughput Deep-Sequencing Experiments Based on Self-adaptive Mixture Copula.- Mining Representative Movement Patterns through Compression.- NARGES: Prediction Model for Informed Routing in a Communications Network.- Mining Usage Traces of Mobile Apps for Dynamic Preference Prediction.- Leveraging Hybrid Citation Context for Impact Summarization.- Optimal Allocation of High Dimensional Assets through Canonical Vines.- Inducing Context Gazetteers from Encyclopedic Databases for Named Entity Recognition.- An Optimization Method for Proportionally Diversifying Search Results.- Joint Naıve Bayes and LDA for Unsupervised Sentiment Analysis.- An Unsupervised Learning Model to Perform Side Channel Attack.- Decisive Supervised Learning.- Learning Overlap Optimization for Domain Decomposition Methods.- CLUEKR : CLUstering Based Efficient kNN Regression.- AREM: A Novel Associative Regression Model Based on EM Algorithm.- One-Class Transfer Learning with Uncertain Data.- Time Series Forecasting Using Distribution Enhanced Linear Regression.- Twin Bridge Transfer Learning for Sparse Collaborative Filtering.- Dimensionality Reduction with Dimension Selection.- Multi-View Visual Classification via a Mixed-Norm Regularizer.- Mining Specific Features for Acquiring User Information Needs.- Ensemble-Based Wrapper Methods for Feature Selection and Class Imbalance Learning.- Exploring Groups from Heterogeneous Data via Sparse Learning.- Multiplex Topic Models.- Integrating Clustering and Ranking on Hybrid Heterogeneous Information Network.- Learning from Multiple Observers with Unknown Expertise.


Best Sellers


Product Details
  • ISBN-13: 9783642374524
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 610
  • Returnable: Y
  • Series Title: Lecture Notes in Artificial Intelligence
  • Width: 155 mm
  • ISBN-10: 3642374522
  • Publisher Date: 20 Mar 2013
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 7818 Lecture Notes in Computer Science
  • Sub Title: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, 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: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 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: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part I(7818 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

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!