返回
Space-Efficient Feature Maps for String Alignment Kernels
DOI:10.1007/s41019-020-00120-6.png)
摘要
En 中文
String kernels are attractive data analysis tools for analyzing string data. Among them, alignment kernels are known for their high prediction accuracies in string classifications when tested in combination with SVM in various applications. However, alignment kernels have a crucial drawback in that they scale poorly due to their quadratic computation complexity in the number of input strings, which limits large-scale applications in practice. We address this need by presenting the first approximation for string alignment kernels, which we call space-efficient feature maps for edit distance with moves (SFMEDM), by leveraging a metric embedding named edit-sensitive parsing and feature maps (FMs) of random Fourier features (RFFs) for large-scale string analyses. The original FMs for RFFs consume a huge amount of memory proportional to the dimension d of input vectors and the dimension D of output vectors, which prohibits its large-scale applications. We present novel space-efficient feature maps (SFMs) of RFFs for a space reduction from O(dD) of the original FMs to O(d) of SFMs with a theoretical guarantee with respect to concentration bounds. We experimentally test SFMEDM on its ability to learn SVM for large-scale string classifications with various massive string data, and we demonstrate the superior performance of SFMEDM with respect to prediction accuracy, scalability and computation efficiency.
Keyword:
Feature maps
Kernel approximation
String alignment kernels
期刊
D
IF:
4.6
论文数:
249
被引数:
665
机构
引用论文
Can CD34 discriminate between benign and malignant hepatocytic lesions in fine-needle aspirates and thin core biopsies?
Cancer
IF0
Characterization of polymer matrix and low melting point solder for anisotropic conductive film各向异性导电膜用聚合物基体及低熔点焊料的表征
KEGG: new perspectives on genomes, pathways, diseases and drugsKEGG: 基因组,途径,疾病和药物的新观点
NUCLEIC ACIDS RESEARCH
IF13.1

