Graph-based semi-supervised learning

著者

    • Subramanya, Amarnag
    • Talukdar, Partha Pratim

書誌事項

Graph-based semi-supervised learning

Amarnag Subramanya, Partha Pratim Talukdar

(Synthesis lectures on artificial intelligence and machine learning, #29)

Morgan & Claypool, c2014

  • : pbk

大学図書館所蔵 件 / 2

この図書・雑誌をさがす

注記

Including bibliographical references (p. 97-108) and index

内容説明・目次

内容説明

While labeled data is expensive to prepare, ever increasing amounts of unlabeled data is becoming widely available. In order to adapt to this phenomenon, several semi-supervised learning (SSL) algorithms, which learn from labeled as well as unlabeled data, have been developed. In a separate line of work, researchers have started to realize that graphs provide a natural way to represent data in a variety of domains. Graph-based SSL algorithms, which bring together these two lines of work, have been shown to outperform the state-of-the-art in many applications in speech processing, computer vision, natural language processing, and other areas of Artificial Intelligence. Recognizing this promising and emerging area of research, this synthesis lecture focuses on graph-based SSL algorithms (e.g., label propagation methods). Our hope is that after reading this book, the reader will walk away with the following: (1) an in-depth knowledge of the current state-of-the-art in graph-based SSL algorithms, and the ability to implement them; (2) the ability to decide on the suitability of graph-based SSL methods for a problem; and (3) familiarity with different applications where graph-based SSL methods have been successfully applied.

目次

Introduction Graph Construction Learning and Inference Scalability Applications Future Work Bibliography Authors' Biographies Index

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BB24778796
  • ISBN
    • 9781627052016
  • 出版国コード
    us
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    [S.l.]
  • ページ数/冊数
    xiii, 111 p.
  • 大きさ
    24 cm
  • 親書誌ID
ページトップへ