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

  • spectral learning of weighted automata

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1003
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     in recent years we have seen the development of efficient provably correct algorithms for learning weighted finite automata (wfa). most of these algorithms avoid the known hardness results by defining parameters beyond the number of states that can be used to quantify the complexity of learning automata under a particular distribution. one such class of methods are the so-called spectral algorithms that measure learning complexity in terms of the smallest singular value of some hankel matrix. however, despite their simplicity and wide applicability to real problems, their impact in application domains remains marginal to this date. one of the goals of this paper is to remedy this situation by presenting a derivation of the spectral method for learning wfa that—without sacrificing rigor and mathematical elegance—puts emphasis on providing intuitions on the inner workings of the method and does not assume a strong background in formal algebraic methods. in addition, our algorithm overcomes some of the shortcomings of previous work and is able to learn from statistics of substrings. to illustrate the approach we present experiments on a real application of the method to natural language parsing.

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

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