menu
{ "item_title" : "Inductive Logic Programming", "item_author" : [" Jesse Davis", "Jan Ramon "], "item_description" : "Reframing on Relational Data.- Inductive Learning using Constraint-driven Bias.- Nonmonotonic Learning in Large Biological Networks.- Construction of Complex Aggregates with Random Restart Hill-Climbing.- Logical minimisation of meta-rules within Meta-Interpretive Learning.- Goal and plan recognition via parse trees using prefix and infix probability computation.- Effectively creating weakly labeled training examples via approximate domain knowledge.- Learning Prime Implicant Conditions From Interpretation Transition.- Statistical Relational Learning for Handwriting Recognition.- The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions.- Towards machine learning of predictive models from ecological data.- PageRank, ProPPR, and Stochastic Logic Programs.- Complex aggregates over clusters of elements.- On the Complexity of Frequent Subtree Mining in Very Simple Structures.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/31/923/707/3319237071_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Inductive Logic Programming|Jesse Davis

Inductive Logic Programming : 24th International Conference, Ilp 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Reframing on Relational Data.- Inductive Learning using Constraint-driven Bias.- Nonmonotonic Learning in Large Biological Networks.- Construction of Complex Aggregates with Random Restart Hill-Climbing.- Logical minimisation of meta-rules within Meta-Interpretive Learning.- Goal and plan recognition via parse trees using prefix and infix probability computation.- Effectively creating weakly labeled training examples via approximate domain knowledge.- Learning Prime Implicant Conditions From Interpretation Transition.- Statistical Relational Learning for Handwriting Recognition.- The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions.- Towards machine learning of predictive models from ecological data.- PageRank, ProPPR, and Stochastic Logic Programs.- Complex aggregates over clusters of elements.- On the Complexity of Frequent Subtree Mining in Very Simple Structures.

This item is Non-Returnable

Details

  • ISBN-13: 9783319237077
  • ISBN-10: 3319237071
  • Publisher: Springer
  • Publish Date: December 2015
  • Dimensions: 9.21 x 6.14 x 0.47 inches
  • Shipping Weight: 0.7 pounds
  • Page Count: 211

Related Categories

You May Also Like...

    1

BAM Customer Reviews