國立虎尾科技大學 |

Application of Deep-Learning to Compiler-Based Graphs.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Application of Deep-Learning to Compiler-Based Graphs./
作者:	Vanderbruggen, Tristan.
面頁冊數:	1 online resource (164 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9780355768282

Application of Deep-Learning to Compiler-Based Graphs.
Vanderbruggen, Tristan.

Application of Deep-Learning to Compiler-Based Graphs. - 1 online resource (164 pages)

Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.

Thesis (Ph.D.)--University of Delaware, 2018.

Includes bibliographical references

Graph-structured data is used in many domains to represent complex objects, such as the molecular structure of chemicals or interactions between members of a social network. However, extracting meaningful information from these graphs is a difficult task, which is often undertaken on a case by case basis. Devising automated methods to mine information from graphs has become increasingly important as the use of graphs becomes more prevalent. Techniques have been developed that adapt algorithms, like support vector machine, to extract information from graphs with minimal preprocessing. Unfortunately, none of these techniques permit the use of deep neural networks (DNNs) to learn from graphs. Given the potential of DNNs to learn from large amounts of data, this has become an important area of interest. Recently, a technique based on graph spectral analysis was proposed to characterize graphs in a way that allows them to be used as input by DNNs.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355768282Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Application of Deep-Learning to Compiler-Based Graphs.
LDR:03222ntm a2200337K 4500 001 915346
005 20180727125213.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780355768282
035 $a (MiAaPQ)AAI10745116
035 $a (MiAaPQ)udel:13213
035 $a AAI10745116
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Vanderbruggen, Tristan. $3 1188669
245 1 0 $a Application of Deep-Learning to Compiler-Based Graphs.
264 0 $c 2018
300 $a 1 online resource (164 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
500 $a Adviser: John Cavazos.
502 $a Thesis (Ph.D.)--University of Delaware, 2018.
504 $a Includes bibliographical references
520 $a Graph-structured data is used in many domains to represent complex objects, such as the molecular structure of chemicals or interactions between members of a social network. However, extracting meaningful information from these graphs is a difficult task, which is often undertaken on a case by case basis. Devising automated methods to mine information from graphs has become increasingly important as the use of graphs becomes more prevalent. Techniques have been developed that adapt algorithms, like support vector machine, to extract information from graphs with minimal preprocessing. Unfortunately, none of these techniques permit the use of deep neural networks (DNNs) to learn from graphs. Given the potential of DNNs to learn from large amounts of data, this has become an important area of interest. Recently, a technique based on graph spectral analysis was proposed to characterize graphs in a way that allows them to be used as input by DNNs.
520 $a We used this technique to apply DNNs to two different systems problems, i.e., 1) classifying malicious applications based on graph-structured representations of executable code and 2) developing prediction models that assist in iterative compilation to optimize and parallelize scientific code. Our results on malicious application classification show that graph-based characterizations increase the ability of DNN to distinguish malware from different families. We performed a detailed evaluation of deep learning applied to state-of-the-art and graph-based malware characterizations. The graph-based characterizations are obtained by reverse engineering potentially malicious applications. For performance prediction, the graphs represent versions of optimized code. We use machine learning to rank these versions and inform an iterative compilation process. The models are trained using only five percent of the search space.
520 $a Our work shows that graph structured data can be used to build powerful deep learning models. The techniques developed for this dissertation shows great potential in a diverse pair of systems.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Delaware. $b Computer and Information Sciences. $3 1183446
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10745116 $z click for full text (PQDT)