The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances
In the last 5 years there have been a large number of new time series classification
algorithms proposed in the literature. These algorithms have been evaluated on subsets of …
algorithms proposed in the literature. These algorithms have been evaluated on subsets of …
Crowded scene analysis: A survey
Automated scene analysis has been a topic of great interest in computer vision and
cognitive science. Recently, with the growth of crowd phenomena in the real world, crowded …
cognitive science. Recently, with the growth of crowd phenomena in the real world, crowded …
[HTML][HTML] Incorporation of AIS data-based machine learning into unsupervised route planning for maritime autonomous surface ships
Abstract Maritime Autonomous Surface Ships (MASS) are deemed as the future of maritime
transport. Although showing attractiveness in terms of the solutions to emerging challenges …
transport. Although showing attractiveness in terms of the solutions to emerging challenges …
Recommending root-cause and mitigation steps for cloud incidents using large language models
Incident management for cloud services is a complex process involving several steps and
has a huge impact on both service health and developer productivity. On-call engineers …
has a huge impact on both service health and developer productivity. On-call engineers …
TS-CHIEF: a scalable and accurate forest algorithm for time series classification
Abstract Time Series Classification (TSC) has seen enormous progress over the last two
decades. HIVE-COTE (Hierarchical Vote Collective of Transformation-based Ensembles) is …
decades. HIVE-COTE (Hierarchical Vote Collective of Transformation-based Ensembles) is …
[图书][B] The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning
RY Rubinstein, DP Kroese - 2004 - Springer
This book is a comprehensive and accessible introduction to the cross-entropy (CE) method.
The CE method started life around 1997 when the first author proposed an adaptive …
The CE method started life around 1997 when the first author proposed an adaptive …
AnO(ND) difference algorithm and its variations
EW Myers - Algorithmica, 1986 - Springer
The problems of finding a longest common subsequence of two sequences A and B and a
shortest edit script for transforming A into B have long been known to be dual problems. In …
shortest edit script for transforming A into B have long been known to be dual problems. In …
Achieving accuracy and scalability simultaneously in detecting application clones on android markets
Besides traditional problems such as potential bugs,(smartphone) application clones on
Android markets bring new threats. That is, attackers clone the code from legitimate Android …
Android markets bring new threats. That is, attackers clone the code from legitimate Android …
A survey of longest common subsequence algorithms
L Bergroth, H Hakonen, T Raita - … International Symposium on …, 2000 - ieeexplore.ieee.org
The aim of this paper is to give a comprehensive comparison of well-known longest common
subsequence algorithms (for two input strings) and study their behaviour in various …
subsequence algorithms (for two input strings) and study their behaviour in various …
[PDF][PDF] The tree-to-tree correction problem
KC Tai - Journal of the ACM (JACM), 1979 - dl.acm.org
The tree-to-tree correctmn problem Is to determine, for two labeled ordered trees T and T',
the distance from T to T'as measured by the mlmmum cost sequence of edit operaUons …
the distance from T to T'as measured by the mlmmum cost sequence of edit operaUons …