Driver Behaviour Clustering Using Discrete PDFs and Modified Markov Algorithm

  • Kartashev K
  • Doikin A
  • Campean F
  • et al.
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… So, the theory of random walks on a graph does not differ significantly from the theory of Markov chains. Conversely, every Markov chain can be represented as a random walk on a …

Cite

CITATION STYLE

APA

Kartashev, K., Doikin, A., Campean, F., Uglanov, A., Abdullatif, A., Zhang, Q., & Angiolini, E. (2022). Driver Behaviour Clustering Using Discrete PDFs and Modified Markov Algorithm (pp. 557–568). https://doi.org/10.1007/978-3-030-87094-2_49

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