An efficient \(k\) nearest neighbor search for multivariate time series

DOI10.1016/j.ic.2006.08.004zbMath1109.68040OpenAlexW2022367269WikidataQ59768937 ScholiaQ59768937MaRDI QIDQ868028

Cyrus Shahabi, Kiyoung Yang

Publication date: 19 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.08.004

zbMATH Keywords

principal component analysissimilarity measuremultivariate time seriesfeature subset selectiondistance-based index structure

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Distance measure with improved lower bound for multivariate time series ⋮ Generalized framework for similarity measure of time series ⋮ Estimating common principal components in high dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded similarity querying for time-series data
• Wrappers for feature subset selection
• Elastic translation invariant matching of trajectories
• Principal component analysis.
• Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
• Between-Groups Comparison of Principal Components
• Some tests for common principal component subspaces in several groups
• Dynamic programming algorithm optimization for spoken word recognition
• Plant diagnostics by transient classification: The ALADDIN approach
• 10.1162/153244303322753616
• Gene selection for cancer classification using support vector machines

This page was built for publication: An efficient \(k\) nearest neighbor search for multivariate time series