Knowledge Discovery in Inductive Databases: 5th International Workshop, KDID 2006 Berlin, Germany, September 18th, 2006 Revised Selected and Invited Papers

Overview

This book constitutes the thoroughly refereed joint postproceedings of the 5th International Workshop on Knowledge Discovery in Inductive Databases, KDID 2006, held in association with ECML/PKDD. Bringing together the fields of databases, machine learning, and data mining, the papers address various current topics in knowledge discovery and data mining in the framework of inductive databases such as constraint-based mining, database technology and inductive querying.

...
See more details below
Paperback (2007)
$99.00
BN.com price
Other sellers (Paperback)
  • All (11) from $32.23   
  • New (7) from $63.01   
  • Used (4) from $32.23   
Sending request ...

Overview

This book constitutes the thoroughly refereed joint postproceedings of the 5th International Workshop on Knowledge Discovery in Inductive Databases, KDID 2006, held in association with ECML/PKDD. Bringing together the fields of databases, machine learning, and data mining, the papers address various current topics in knowledge discovery and data mining in the framework of inductive databases such as constraint-based mining, database technology and inductive querying.

Read More Show Less

Product Details

Table of Contents

Invited Talk.- Value, Cost, and Sharing: Open Issues in Constrained Clustering.- Contributed Papers.- Mining Bi-sets in Numerical Data.- Extending the Soft Constraint Based Mining Paradigm.- On Interactive Pattern Mining from Relational Databases.- Analysis of Time Series Data with Predictive Clustering Trees.- Integrating Decision Tree Learning into Inductive Databases.- Using a Reinforced Concept Lattice to Incrementally Mine Association Rules from Closed Itemsets.- An Integrated Multi-task Inductive Database VINLEN: Initial Implementation and Early Results.- Beam Search Induction and Similarity Constraints for Predictive Clustering Trees.- Frequent Pattern Mining and Knowledge Indexing Based on Zero-Suppressed BDDs.- Extracting Trees of Quantitative Serial Episodes.- IQL: A Proposal for an Inductive Query Language.- Mining Correct Properties in Incomplete Databases.- Efficient Mining Under Rich Constraints Derived from Various Datasets.- Three Strategies for Concurrent Processing of Frequent Itemset Queries Using FP-Growth.- Discussion Paper.- Towards a General Framework for Data Mining.

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)