Supervised Learning

• Classify new text examples

  • Once upon a time, there were 3 bears (BEG)
  • The 3 bears lived in a big house. (MID)
  • They all stayed in the house happily ever after. (END)

• The system will decide…

  • Class 1 (BEG) (matching ‘once’, ‘upon’, ‘time’, ‘there’)
  • Class 2 (MID) (matching ‘lived’)
  • Class 3 (END) (matching ‘happily’, ‘ever’, ‘after’)

• Problem

  • We need labeled examples
  • But, many systems work well with only a few labeled examples
  • (A user can add classified texts to the set of examples)

前のｽﾗｲﾄﾞ

次のｽﾗｲﾄﾞ

最初のｽﾗｲﾄﾞに戻る

ｸﾞﾗﾌｨｯｸｽの表示