2016 Eighth International Conference on Knowledge and Systems Engineering (KSE) 2016
DOI: 10.1109/kse.2016.7758034
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting tree structures for classifying programs by functionalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…where C is the number of symbols in the view, and x j is the vector representation of the j th symbol. Taking instruction addq $32, %rsp as an example, its vector is the linear combination of vectors of symbols addq, value, and reg k-nearest neighbors (kNN) We apply kNN algorithm with tree edit distance (TED) and Levenshtein distance (LD) [16]. The number of neighbors k is set to 3.…”
Section: Architecture Weights Biases Rvnnmentioning
confidence: 99%
“…where C is the number of symbols in the view, and x j is the vector representation of the j th symbol. Taking instruction addq $32, %rsp as an example, its vector is the linear combination of vectors of symbols addq, value, and reg k-nearest neighbors (kNN) We apply kNN algorithm with tree edit distance (TED) and Levenshtein distance (LD) [16]. The number of neighbors k is set to 3.…”
Section: Architecture Weights Biases Rvnnmentioning
confidence: 99%