menu
{ "item_title" : "Inductive Logic Programming", "item_author" : [" Celine Rouveirol", "Michele Sebag "], "item_description" : "The 11th international conference on Inductive Logic Programming, ILP2001, was held in Strasbourg, France, September 9-11, 2001. ILP2001 was co-located withthe3rdinternationalworkshoponLogic, Learning, andLanguage(LLL2001), and nearly co-located with the joint 12th European Conference on Machine Learning (ECML2001) and 5th European conference on Principles and Practice of Knowledge Discovery in Databases (PKDD2001). Continuing a series of international conferences devoted to Inductive Logic Programming and Relational Learning, ILP2001 is the central annual event for researchersinterestedinlearningstructuredknowledgefromstructuredexamples and background knowledge. One recent one major challenge for ILP has been to contribute to the ex- nentialemergenceofDataMining, andtoaddressthehandlingofmulti-relational databases. On the one hand, ILP has developed a body of theoretical results and algorithmicstrategiesforexploringrelationaldata, essentiallybutnotexclusively from a supervised learning viewpoint. These results are directly relevant to an e?cient exploration of multi-relational databases. Ontheotherhand, DataMiningmightrequirespeci?crelationalstrategiesto be developed, especially with regard to the scalability issue. The near-colocation of ILP2001 with ECML2001-PKDD2001 was an incentive to increase cro- fertilization between the ILP relational savoir-faire and the new problems and learning goals addressed and to be addressed in Data Mining. Thirty-seven papers were submitted to ILP, among which twenty-one were selected and appear in these proceedings. Several - non-disjoint - trends can be observed, along an admittedly subjective clustering. On the theoretical side, a new mode of inference is proposed by K. Inoue, analog to the open-ended mode of Bayesian reasoning (where the frontier - tween induction and abduction wanes). New learning re?nement operators are proposed by L. Badea, while R. Otero investigates negation-handling settings.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/54/042/538/3540425381_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|Celine Rouveirol

Inductive Logic Programming : 11th International Conference, Ilp 2001, Strasbourg, France, September 9-11, 2001. Proceedings

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

Overview

The 11th international conference on Inductive Logic Programming, ILP2001, was held in Strasbourg, France, September 9-11, 2001. ILP2001 was co-located withthe3rdinternationalworkshoponLogic, Learning, andLanguage(LLL2001), and nearly co-located with the joint 12th European Conference on Machine Learning (ECML2001) and 5th European conference on Principles and Practice of Knowledge Discovery in Databases (PKDD2001). Continuing a series of international conferences devoted to Inductive Logic Programming and Relational Learning, ILP2001 is the central annual event for researchersinterestedinlearningstructuredknowledgefromstructuredexamples and background knowledge. One recent one major challenge for ILP has been to contribute to the ex- nentialemergenceofDataMining, andtoaddressthehandlingofmulti-relational databases. On the one hand, ILP has developed a body of theoretical results and algorithmicstrategiesforexploringrelationaldata, essentiallybutnotexclusively from a supervised learning viewpoint. These results are directly relevant to an e?cient exploration of multi-relational databases. Ontheotherhand, DataMiningmightrequirespeci?crelationalstrategiesto be developed, especially with regard to the scalability issue. The near-colocation of ILP2001 with ECML2001-PKDD2001 was an incentive to increase cro- fertilization between the ILP relational savoir-faire and the new problems and learning goals addressed and to be addressed in Data Mining. Thirty-seven papers were submitted to ILP, among which twenty-one were selected and appear in these proceedings. Several - non-disjoint - trends can be observed, along an admittedly subjective clustering. On the theoretical side, a new mode of inference is proposed by K. Inoue, analog to the open-ended mode of Bayesian reasoning (where the frontier - tween induction and abduction wanes). New learning re?nement operators are proposed by L. Badea, while R. Otero investigates negation-handling settings.

This item is Non-Returnable

Details

  • ISBN-13: 9783540425380
  • ISBN-10: 3540425381
  • Publisher: Springer
  • Publish Date: August 2001
  • Dimensions: 9.21 x 6.14 x 0.58 inches
  • Shipping Weight: 0.86 pounds
  • Page Count: 259

Related Categories

You May Also Like...

    1

BAM Customer Reviews