Home > Computing and Information Technology > Computer science > Artificial intelligence > Machine learning > Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 Lecture Notes in Computer Science)
Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 Lecture Notes in Computer Science)

Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book constitutes the refereed proceedings of the 12th European Conference on Machine Learning, ECML 2001, held in Freiburg, Germany, in September 2001. The 50 revised full papers presented together with four invited contributions were carefully reviewed and selected from a total of 140 submissions. Among the topics covered are classifier systems, naive-Bayes classification, rule learning, decision tree-based classification, Web mining, equation discovery, inductive logic programming, text categorization, agent learning, backpropagation, reinforcement learning, sequence prediction, sequential decisions, classification learning, sampling, and semi-supervised learning.

Table of Contents:
Regular Papers.- An Axiomatic Approach to Feature Term Generalization.- Lazy Induction of Descriptions for Relational Case-Based Learning.- Estimating the Predictive Accuracy of a Classifier.- Improving the Robustness and Encoding Complexity of Behavioural Clones.- A Framework for Learning Rules from Multiple Instance Data.- Wrapping Web Information Providers by Transducer Induction.- Learning While Exploring: Bridging the Gaps in the Eligibility Traces.- A Reinforcement Learning Algorithm Applied to Simplified Two-Player Texas Hold’em Poker.- Speeding Up Relational Reinforcement Learning through the Use of an Incremental First Order Decision Tree Learner.- Analysis of the Performance of AdaBoost.M2 for the Simulated Digit-Recognition-Example.- Iterative Double Clustering for Unsupervised and Semi-supervised Learning.- On the Practice of Branching Program Boosting.- A Simple Approach to Ordinal Classification.- Fitness Distance Correlation of Neural Network Error Surfaces: A Scalable,Continuous Optimization Problem.- Extraction of Recurrent Patterns from Stratified Ordered Trees.- Understanding Probabilistic Classifiers.- Efficiently Determining the Starting Sample Size for Progressive Sampling.- Using Subclasses to Improve Classification Learning.- Learning What People (Don’t) Want.- Towards a Universal Theory of Artificial Intelligence Based on Algorithmic Probability and Sequential Decisions.- Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences.- Consensus Decision Trees: Using Consensus Hierarchical Clustering for Data Relabelling and Reduction.- Learning of Variability for Invariant Statistical Pattern Recognition.- The Evaluation of Predictive Learners: Some Theoretical and Empirical Results.- An Evolutionary Algorithm for Cost-Sensitive Decision Rule Learning.- A Mixture Approach to Novelty Detection Using Training Data with Outliers.- Applying the Bayesian Evidence Framework to ?-Support Vector Regression.- DQL: A New Updating Strategy for Reinforcement Learning Based on Q-Learning.- A Language-Based Similarity Measure.- Backpropagation in Decision Trees for Regression.- Comparing the Bayes and Typicalness Frameworks.- Symbolic Discriminant Analysis for Mining Gene Expression Patterns.- Social Agents Playing a Periodical Policy.- Learning When to Collaborate among Learning Agents.- Building Committees by Clustering Models Based on Pairwise Similarity Values.- Second Order Features for Maximising Text Classification Performance.- Importance Sampling Techniques in Neural Detector Training.- Induction of Qualitative Trees.- Text Categorization Using Transductive Boosting.- Using Multiple Clause Constructors in Inductive Logic Programming for Semantic Parsing.- Using Domain Knowledge on Population Dynamics Modeling for Equation Discovery.- Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL.- A Unified Framework for Evaluation Metrics in Classification Using Decision Trees.- Improving Term Extraction by System Combination Using Boosting.- Classification on Data with Biased Class Distribution.- Discovering Admissible Simultaneous Equation Models from Observed Data.- Discovering Strong Principles of Expressive Music Performance with the PLCG Rule Learning Strategy.- Proportional k-Interval Discretization for Naive-Bayes Classifiers.- Using Diversity in Preparing Ensembles of Classifiers Based on Different Feature Subsets to Minimize Generalization Error.- Geometric Properties of Naive Bayes in Nominal Domains.- Invited Papers.- Support Vectors for Reinforcement Learning.- Combining Discrete Algorithmic and Probabilistic Approaches in Data Mining.- Statistification or Mystification? The Need for Statistical Thought in Visual Data Mining.- The Musical Expression Project: A Challenge for Machine Learning and Knowledge Discovery.- Scalability, Search, and Sampling: From Smart Algorithms to Active Discovery.


Best Sellers


Product Details
  • ISBN-13: 9783540425366
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 620
  • Returnable: Y
  • Series Title: Lecture Notes in Artificial Intelligence
  • Sub Title: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings
  • Width: 155 mm
  • ISBN-10: 3540425365
  • Publisher Date: 23 Aug 2001
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Series Title: 2167 Lecture Notes in Computer Science
  • Spine Width: 33 mm
  • Weight: 888 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 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.

Machine Learning: ECML 2001: 12th European Conference on Machine Learning, Freiburg, Germany, September 5-7, 2001. Proceedings(2167 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!
    ASK VIDYA