國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Link Weight Prediction with Deep Lea...

Hou, Yuchen.

Link Weight Prediction with Deep Learning.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Link Weight Prediction with Deep Learning.
作者:	Hou, Yuchen.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2018
面頁冊數:	108 p.
附註:	Source: Dissertation Abstracts International, Volume: 80-03(E), Section: B.
附註:	Adviser: Lawrence B. Holder.
Contained By:	Dissertation Abstracts International80-03B(E).
標題:	Computer science.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10784587
ISBN:	9780438568778

Link Weight Prediction with Deep Learning.
Hou, Yuchen.

Link Weight Prediction with Deep Learning. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 108 p.

Source: Dissertation Abstracts International, Volume: 80-03(E), Section: B.

Thesis (Ph.D.)--Washington State University, 2018.

Deep learning has been successful in various domains including image recognition, speech recognition and natural language processing. However, the research on its application in graph mining is still in an early stage. Here we present Model R, a neural network model created to provide a deep learning approach to the link weight prediction problem. This model uses a node embedding technique that extracts node embeddings (knowledge of nodes) from the known links' weights (relations between nodes) and uses this knowledge to predict the unknown links' weights. We demonstrate the power of Model R through experiments and compare it with the stochastic block model and its derivatives. Model R shows that deep learning can be successfully applied to link weight prediction and it outperforms stochastic block model and its derivatives by up to 73% in terms of prediction performance. We analyze the node embeddings to confirm that closeness in embedding space correlates with stronger relationships as measured by the link weight. We anticipate this new approach will provide effective solutions to more graph mining tasks.

ISBN: 9780438568778Subjects--Topical Terms:

199325
Computer science.

Link Weight Prediction with Deep Learning.
LDR:03072nmm a2200313 4500 001 547555
005 20190513114556.5
008 190715s2018 ||||||||||||||||| ||eng d
020 $a 9780438568778
035 $a (MiAaPQ)AAI10784587
035 $a (MiAaPQ)wsu:12317
035 $a AAI10784587
040 $a MiAaPQ $c MiAaPQ
100 1 $a Hou, Yuchen. $3 826861
245 1 0 $a Link Weight Prediction with Deep Learning.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 108 p.
500 $a Source: Dissertation Abstracts International, Volume: 80-03(E), Section: B.
500 $a Adviser: Lawrence B. Holder.
502 $a Thesis (Ph.D.)--Washington State University, 2018.
520 $a Deep learning has been successful in various domains including image recognition, speech recognition and natural language processing. However, the research on its application in graph mining is still in an early stage. Here we present Model R, a neural network model created to provide a deep learning approach to the link weight prediction problem. This model uses a node embedding technique that extracts node embeddings (knowledge of nodes) from the known links' weights (relations between nodes) and uses this knowledge to predict the unknown links' weights. We demonstrate the power of Model R through experiments and compare it with the stochastic block model and its derivatives. Model R shows that deep learning can be successfully applied to link weight prediction and it outperforms stochastic block model and its derivatives by up to 73% in terms of prediction performance. We analyze the node embeddings to confirm that closeness in embedding space correlates with stronger relationships as measured by the link weight. We anticipate this new approach will provide effective solutions to more graph mining tasks.
520 $a We also demonstrate how to apply Model R for the collaborative rating prediction problem, which is a special case of the graph link weight prediction problem where the graph is a bipartite graph. This model extracts knowledge of users and items from known ratings and uses this knowledge to predict unknown ratings. We demonstrate the power of Model R through experiments and compare it with the most prevalent collaborative filtering algorithm - neighborhood-based collaborative filtering. Model R shows that deep learning can be successfully applied to collaborative rating prediction and it outperforms neighborhood-based collaborative filtering by up to 18% in terms of prediction performance.
520 $a We also present Model S, a generalized deep learning approach to the graph link weight prediction problem based on general node embedding techniques. We evaluate this approach with three different node embedding techniques experimentally and compare its performance with stochastic block model and its derivatives.
590 $a School code: 0251.
650 4 $a Computer science. $3 199325
690 $a 0984
710 2 $a Washington State University. $b Computer Science. $3 826862
773 0 $t Dissertation Abstracts International $g 80-03B(E).
790 $a 0251
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10784587