\documentclass[10pt]{article}

\usepackage{fullpage}
\usepackage{setspace}
\usepackage{parskip}
\usepackage{titlesec}
\usepackage[section]{placeins}
\usepackage{xcolor}
\usepackage{breakcites}
\usepackage{lineno}
\usepackage{hyphenat}





\PassOptionsToPackage{hyphens}{url}
\usepackage[colorlinks = true,
            linkcolor = blue,
            urlcolor  = blue,
            citecolor = blue,
            anchorcolor = blue]{hyperref}
\usepackage{etoolbox}
\makeatletter
\patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{%
  \errmessage{\noexpand\@combinedblfloats could not be patched}%
}%
\makeatother


\usepackage{natbib}




\renewenvironment{abstract}
  {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize}
  {\bigskip}

\titlespacing{\section}{0pt}{*3}{*1}
\titlespacing{\subsection}{0pt}{*2}{*0.5}
\titlespacing{\subsubsection}{0pt}{*1.5}{0pt}


\usepackage{authblk}


\usepackage{graphicx}
\usepackage[space]{grffile}
\usepackage{latexsym}
\usepackage{textcomp}
\usepackage{longtable}
\usepackage{tabulary}
\usepackage{booktabs,array,multirow}
\usepackage{amsfonts,amsmath,amssymb}
\providecommand\citet{\cite}
\providecommand\citep{\cite}
\providecommand\citealt{\cite}
% You can conditionalize code for latexml or normal latex using this.
\newif\iflatexml\latexmlfalse
\providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}%

\AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}}

\usepackage[utf8]{inputenc}
\usepackage[english]{babel}



\usepackage{float}








\begin{document}

\title{Dynamic Frequent Trajectory Mining Algorithm Based on Confidence of
Suffix Subsequence}



\author[1]{Fan He}%
\author[1]{mandan Liu}%
\author[1]{Chao Zhong}%
\affil[1]{East China University of Science and Technology}%


\vspace{-1em}



  
  \date{May 25, 2024}


\begingroup
\let\center\flushleft
\let\endcenter\endflushleft
\maketitle
\endgroup





\selectlanguage{english}
\begin{abstract}
With the popularization of smart devices and the continuous development
of wireless communication technology, a large amount of trajectory data
is recorded in wireless networks, and frequent item mining for
trajectory data has become a research hotspot. In order to rapid update
frequent trajectory set when new data is added to the original
trajectory database, and to solve the problem that trajectory database
occupies a large amount of storage space, we propose a new dynamic
PrefixSpan algorithm based on the confidence of suffix subsequence
(CSS-PrefixSpan). This algorithm makes full use of the information of
the frequent trajectory set and estimates the support of infrequent
trajectory by using the confidence of infrequent trajectory suffix
subsequence. When incremental trajectory data is added to the original
trajectory database, CSS-PrefixSpan can dynamically update frequent
trajectory set and no longer need to store the original trajectory data
after mining frequent trajectories. Through two trajectory dataset
mining experiments, the accuracy of the support estimation and the
effectiveness of proposed algorithm are verified.%
\end{abstract}%



\sloppy


\textbf{Hosted file}

\verb`Dynamic Frequent Trajectory Mining Algorithm Based on Confidence of Suffix Subsequence.docx`  available at \url{https://authorea.com/users/563202/articles/610448-dynamic-frequent-trajectory-mining-algorithm-based-on-confidence-of-suffix-subsequence}

\selectlanguage{english}
\FloatBarrier
\end{document}

