• gradient-based boosting for statistical relational learning: the relational dependency network case

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1074
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. relational dependency networks (rdns) are graphical models that extend dependency networks to relational domains. this higher expressivity, however, comes at the expense of a more complex model-selection problem: an unbounded number of relational abstraction levels might need to be explored. whereas current learning approaches for rdns learn a single probability tree per random variable, we propose to turn the problem into a series of relational function-approximation problems using gradient-based boosting. in doing so, one can easily induce highly complex features over several iterations and in turn estimate quickly a very expressive model. our experimental results in several different data sets show that this boosting method results in efficient learning of rdns when compared to state-of-the-art statistical relational learning approaches.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها