Amanote Research

Amanote Research

    RegisterSign In

Efficiently Finding Arbitrarily Scaled Patterns in Massive Time Series Databases

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-39804-2_24
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2003

Authors
Eamonn Keogh
Publisher

Springer Berlin Heidelberg


Related search

Efficiently Mining Long Patterns From Databases

SIGMOD Record
Information SystemsSoftware
1998English

Similarity Search in Time Series Databases

2005English

Periodic Pattern Analysis in Time Series Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Fast Subsequence Matching in Time-Series Databases

1994English

Feature Selection in Time-Series Motion Databases

2018English

Data Mining in Time Series and Streaming Databases

Series in Machine Perception and Artificial Intelligence
2017English

Linear Detrending Subsequence Matching in Time-Series Databases

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

Mining Sequential Patterns More Efficiently by Reducing the Cost of Scanning Sequence Databases

IPSJ Digital Courier
2006English

Seasonal Patterns in Time Series of Pertussis

Epidemiology and Infection
EpidemiologyInfectious Diseases
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy