Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

preprint · Data Mining and Knowledge Discovery · 2017

Efficient geometric-based computation of the string subsequence kernel

Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi

Cited by 0Open access

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

Bellaouar, S., Cherroun, H., & Ziadi, D. (2017). Efficient geometric-based computation of the string subsequence kernel. Data Mining and Knowledge Discovery, 32(2), 532–559. https://doi.org/10.1007/s10618-017-0545-7

MLA 9

Bellaouar, Slimane, et al. “Efficient geometric-based computation of the string subsequence kernel.” Data Mining and Knowledge Discovery, vol. 32, no. 2, 2017, pp. 532–59, https://doi.org/10.1007/s10618-017-0545-7.

Chicago

Bellaouar, Slimane, Hadda Cherroun, and Djelloul Ziadi. 2017. “Efficient geometric-based computation of the string subsequence kernel.” Data Mining and Knowledge Discovery 32 (2): 532–59. https://doi.org/10.1007/s10618-017-0545-7.

Harvard

Bellaouar, S., Cherroun, H. and Ziadi, D. (2017) ‘Efficient geometric-based computation of the string subsequence kernel’, Data Mining and Knowledge Discovery, 32(2), pp. 532–559. Available at: https://doi.org/10.1007/s10618-017-0545-7.

BibTeX
@misc{bellaouar2017efficient,
  title = {{Efficient geometric-based computation of the string subsequence kernel}},
  author = {Bellaouar, Slimane and Cherroun, Hadda and Ziadi, Djelloul},
  journal = {Data Mining and Knowledge Discovery},
  volume = {32},
  number = {2},
  pages = {532--559},
  year = {2017},
  doi = {10.1007/s10618-017-0545-7}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers