English
Related papers

Related papers: Use Short Isometric Shapelets to Accelerate Binary…

200 papers

Theoretically-inspired sequential density ratio estimation (SDRE) algorithms are proposed for the early classification of time series. Conventional SDRE algorithms can fail to estimate DRs precisely due to the internal overnormalization…

Machine Learning · Computer Science 2023-02-21 Akinori F. Ebihara , Taiki Miyagawa , Kazuyuki Sakurai , Hitoshi Imaoka

Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many…

Machine Learning · Computer Science 2021-07-15 Angus Dempster , François Petitjean , Geoffrey I. Webb

Time series classification is an important problem in data mining with several applications in different domains. Because time series data are usually high dimensional, dimensionality reduction techniques have been proposed as an efficient…

Machine Learning · Computer Science 2020-10-05 Muhammad Marwan Muhammad Fuad

We propose a novel approach to the problem of clustering hierarchically aggregated time-series data, which has remained an understudied problem though it has several commercial applications. We first group time series at each aggregated…

Machine Learning · Computer Science 2022-05-30 Xing Han , Tongzheng Ren , Jing Hu , Joydeep Ghosh , Nhat Ho

Recently there has been an increase in the studies on time-series data mining specifically time-series clustering due to the vast existence of time-series in various domains. The large volume of data in the form of time-series makes it…

Machine Learning · Computer Science 2019-12-06 Hossein Kamalzadeh , Abbas Ahmadi , Saeed Mansour

SMOTE (Synthetic Minority Oversampling Technique) is the established geometric approach to random oversampling to balance classes in the imbalanced learning problem, followed by many extensions. Its idea is to introduce synthetic data…

Machine Learning · Computer Science 2025-03-06 Oleg Kachan , Andrey Savchenko , Gleb Gusev

The quantification of visual aesthetics and complexity have a long history, the latter previously operationalized via the application of compression algorithms. Here we generalize and extend the compression approach beyond simple complexity…

Computer Vision and Pattern Recognition · Computer Science 2022-05-23 Andres Karjus , Mar Canet Solà , Tillmann Ohm , Sebastian E. Ahnert , Maximilian Schich

The maximal biclique enumeration problem in bipartite graphs is fundamental and has numerous applications in E-commerce and transaction networks. Most existing studies adopt a branch-and-bound framework, which recursively expands a partial…

Data Structures and Algorithms · Computer Science 2026-02-26 Kaixin Wang , Kaiqiang Yu , Cheng Long

Feature transformation plays a critical role in enhancing machine learning model performance by optimizing data representations. Recent state-of-the-art approaches address this task as a continuous embedding optimization problem, converting…

Machine Learning · Computer Science 2025-08-29 Yang Gao , Dongjie Wang , Scott Piersall , Ye Zhang , Liqiang Wang

Signal processing applications use sinusoidal modelling for speech synthesis, speech coding, and audio coding. Estimation of the model parameters involves non-linear optimisation methods, which can be very costly for real-time applications.…

In this paper, we propose a method for density-based clustering in high-dimensional spaces that combines Locality-Sensitive Hashing (LSH) with the Quick Shift algorithm. The Quick Shift algorithm, known for its hierarchical clustering…

Machine Learning · Computer Science 2025-12-01 Sajjad Hashemian

The merit factor problem is of practical importance to manifold domains, such as digital communications engineering, radars, system modulation, system testing, information theory, physics, chemistry. However, the merit factor problem is…

Information Theory · Computer Science 2021-06-08 Miroslav Dimitrov

In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line…

Computational Geometry · Computer Science 2019-09-25 Sanjib Sadhu , Xiaozhou He , Sasanka Roy , Subhas C. Nandy , Suchismita Roy

The selection of algorithms is a crucial step in designing AI services for real-world time series classification use cases. Traditional methods such as neural architecture search, automated machine learning, combined algorithm selection,…

Machine Learning · Computer Science 2024-10-02 Lars Böcking , Leopold Müller , Niklas Kühl

This paper proposes a simple method to extract from a set of multiple related time series a compressed representation for each time series based on statistics for the entire set of all time series. This is achieved by a hierarchical…

Applications · Statistics 2020-05-05 Mogens Graf Plessen

Time series classification (TSC) is the most import task in time series mining as it has several applications in medicine, meteorology, finance cyber security, and many others. With the ever increasing size of time series datasets, several…

Machine Learning · Computer Science 2023-12-12 Muhammad Marwan Muhammad Fuad

In this paper, we present a so-called interlaced sparse self-attention approach to improve the efficiency of the \emph{self-attention} mechanism for semantic segmentation. The main idea is that we factorize the dense affinity matrix as the…

Computer Vision and Pattern Recognition · Computer Science 2019-07-31 Lang Huang , Yuhui Yuan , Jianyuan Guo , Chao Zhang , Xilin Chen , Jingdong Wang

Irregularly sampled time series (ISTS) data has irregular temporal intervals between observations and different sampling rates between sequences. ISTS commonly appears in healthcare, economics, and geoscience. Especially in the medical…

Machine Learning · Computer Science 2020-10-27 Chenxi Sun , Shenda Hong , Moxian Song , Hongyan Li

Learning a good distance measure for distance-based classification in time series leads to significant performance improvement in many tasks. Specifically, it is critical to effectively deal with variations and temporal dependencies in time…

Machine Learning · Computer Science 2019-10-24 Dongmin Park , Susik Yoon , Hwanjun Song , Jae-Gil Lee

Sampling-based motion planners such as Rapidly-exploring Random Tree* (RRT*) and its informed variant IRRT* are widely used for optimal path planning in complex environments. However, these methods often suffer from slow convergence and…

Robotics · Computer Science 2025-05-29 Hyejeong Ryu
‹ Prev 1 8 9 10 Next ›