Feature extraction

1Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the previous chapters we have examined static and dynamic methods of program analysis. These features must be translated into mathematical representations and birthmarks to be useful. Furthermore, mathematical representations may be embedded in other mathematical types to make birthmarks more amenable to similarity comparisons and for use in classification algorithms. Another approach is to represent features using kernels. This allows for the use of classification algorithms including the support vector machine for complex data types. This chapter examines the mathematical representations that we use to describe program features.

Cite

CITATION STYLE

APA

Cesare, S., & Xiang, Y. (2012). Feature extraction. In SpringerBriefs in Computer Science (Vol. 0, pp. 57–61). Springer. https://doi.org/10.1007/978-1-4471-2909-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free