Machine Learning: ECML-95: 8th European Conference on Machine Learning, Heraclion, Crete, Greece, April 25 - 27, 1995. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$89.99
Used and New from Other Sellers
Used and New from Other Sellers
from $15.00
Usually ships in 1-2 business days
(Save 86%)
Other sellers (Paperback)
  • All (9) from $15.00   
  • New (3) from $72.55   
  • Used (6) from $15.00   

Overview

This volume constitutes the proceedings of the Eighth European Conference on Machine Learning ECML-95, held in Heraclion, Crete in April 1995.
Besides four invited papers the volume presents revised versions of 14 long papers and 26 short papers selected from a total of 104 submissions. The papers address all current aspects in the area of machine learning; also logic programming, planning, reasoning, and algorithmic issues are touched upon.

Read More Show Less

Product Details

Table of Contents

Reasoning and learning in probabilistic and possibilistic networks: An overview.- Problem decomposition and the learning of skills.- Machine learning in the world wide web.- Abstract computer models: Towards a new method for theorizing about adaptive agents.- Learning abstract planning cases.- The role of prototypicality in exemplar-based learning.- Specialization of recursive predicates.- A distributed genetic algorithm improving the generalization behavior of neural networks.- Learning non-monotonic logic programs: Learning exceptions.- A comparative utility analysis of case-based reasoning and control-rule learning systems.- A minimization approach to propositional inductive learning.- On concept space and hypothesis space in case-based learning algorithms.- The power of decision tables.- Pruning multivariate decision trees by hyperplane merging.- Multiple-Knowledge Representations in concept learning.- The effect of numeric features on the scalability of inductive learning programs.- Analogical logic program synthesis from examples.- A guided tour through hypothesis spaces in ILP.- JIGSAW: Puzzling together RUTH and SPECTRE (Extended abstract).- Discovery of constraints and data dependencies in relational databases (Extended abstract).- Learning disjunctive normal forms in a dual classifier system (Extended abstract).- The effects of noise on efficient incremental induction (Extended abstract).- Analysis of Rachmaninoff's piano performances using inductive logic programming (Extended abstract).- Handling real numbers in ILP: A step towards better behavioural clones (Extended abstract).- Simplifying decision trees by pruning and grafting: New results (Extended abstract).- A tight integration of pruning and learning (Extended abstract).- Decision-tree based neural network (Extended abstract).- Learning recursion with iterative bootstrap induction (Extended abstract).- Patching proofs for reuse (Extended abstract).- Adapting to drift in continuous domains (Extended abstract).- Parallel recombinative reinforcement learning (Extended abstract).- Learning to solve complex tasks for reactive systems (Extended abstract).- Co-operative Reinforcement Learning by payoff filters (Extended abstract).- Automatic synthesis of control programs by combination of learning and problem solving methods (Extended abstract).- Analytical learning guided by empirical technology: An approach to integration (Extended abstract).- A new MDL measure for robust rule induction (Extended abstract).- Class-driven statistical discretization of continuous attributes (Extended abstract).- Generating neural networks through the induction of threshold logic unit trees (Extended abstract).- Learning classification rules using lattices (Extended abstract).- Hybrid classification: Using axis-parallel and oblique subdivisions of the attribute space (Extended abstract).- An induction-based control for genetic algorithms (Extended abstract).- Fender: An approach to theory restructuring (extended abstract).- Language series revisited: The complexity of hypothesis spaces in ILP (Extended abstract).- Prototype, nearest neighbor and hybrid algorithms for time series classification (Extended abstract).

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)