محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
یادگیری ماشین 2013
جزئیات رویداد
همایش ، رویداد ، ژورنال
اینستاگرام تی پی بین
حوزه های تحت پوشش رویداد

  • similarity measures over refinement graphs

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 956
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
    similarity also plays a crucial role in support vector machines. similarity assessment plays a key role in lazy learning methods such as k-nearest neighbor or case-based reasoning. in this paper we will show how refinement graphs, that were originally introduced for inductive learning, can be employed to assess and reason about similarity. we will define and analyze two similarity measures, s λ and s π , based on refinement graphs. the anti-unification-based similarity, s λ , assesses similarity by finding the anti-unification of two instances, which is a description capturing all the information common to these two instances. the property-based similarity, s π , is based on a process of disintegrating the instances into a set of properties, and then analyzing these property sets. moreover these similarity measures are applicable to any representation language for which a refinement graph that satisfies the requirements we identify can be defined. specifically, we present a refinement graph for feature terms, in which several languages of increasing expressiveness can be defined. the similarity measures are empirically evaluated on relational data sets belonging to languages of different expressiveness.

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

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