Time-Series Classification in Many Intrinsic Dimensions
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In the context of many data mining tasks, high dimensionality was shown to be able to pose significant problems, commonly referred to as different aspects of the curse of dimensionality. In this paper, we investigate in the time-series domain one aspect of the dimensionality curse called hubness, which refers to the tendency of some instances in a data set to become hubs by being included in unexpectedly many k-nearest neighbor lists of other instances. Through empirical measurements on a large collection of time-series data sets we demonstrate that the hubness phenomenon is caused by high intrinsic dimensionality of time-series data, and shed light on the mechanism through which hubs emerge, focusing on the popular and successful dynamic time warping (DTW) distance. Also, the interaction between hubness and the information provided by class labels is investigated, by considering label matches and mismatches between neighboring time series. Following our findings we formulate a framework for categorizing time-series data sets based on measurements that reflect hubness and the diversity of class labels among nearest neighbors. The framework allows one to assess whether hubness can be successfully used to improve the performance of k-NN classification. Finally, the merits of the framework are demonstrated through experimental evaluation of 1-NN and k-NN classifiers, including a proposed weighting scheme that is designed to make use of hubness information. Our experimental results show that the examined framework, in the majority of cases, is able to correctly reflect the circumstances in which hubness information can effectively be employed in k-NN time-series classification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Experiencing SAX: A novel symbolic representation of time series
Lin, J., Keogh, E., Wei, L., & Lonardi, S. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-007-0064-z · Cited by 1,618 · cited 2×
“, piecewise aggregate approximation (PAA) [22], piecewise constant approximation (APCA) [6], and symbolic aggregate approximation (SAX) [27].”
Background
Cited by
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Rotation-invariant similarity in time series using bag-of-patterns representation
Lin, J., Khade, R., & Li, Y. (2012) · Journal of Intelligent Information Systems · doi:10.1007/s10844-012-0196-5 · Cited by 295
The Role of Hubness in Clustering High-Dimensional Data
Tomasev, N., Radovanovic, M., Mladenic, D., & Ivanovic, M. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.25 · Cited by 142
“Its existence was verified for euclidean (l2) and Manhattan (l1) distances, lp distances with p > 2, fractional distances (lp with rational p 2 ð0; 1Þ), Bray-Curtis, normalized euclidean, and Canberra distances, cosine similarity, and the dynamic time warping distance for time series [22], [23], [28].”
BackgroundReward Motivation Enhances Task Coding in Frontoparietal Cortex
Etzel, J. A., Cole, M. W., Zacks, J. M., Kay, K. N., & Braver, T. S. (2016) · Cerebral Cortex · doi:10.1093/cercor/bhu327 · Cited by 132
Metadata
- Authors
- Radovanović, M., Nanopoulos, A., & Ivanović, M.
- Venue
- Proceedings of the 2010 SIAM International Conference on Data Mining
- Published
- 2010-04-29
- Pages
- 677-688
- OpenAlex
- W96651161
- Cited by
- 72
- References
- 1
- FWCI
- 8.46
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Time-Series Classification in Many Intrinsic Dimensions. https://app.cochat.ai/papers/10.1137/1.9781611972801.59
- The paper
- Radovanović, M., Nanopoulos, A., & Ivanović, M. (2010). Time-Series Classification in Many Intrinsic Dimensions. Proceedings of the 2010 SIAM International Conference on Data Mining. https://doi.org/10.1137/1.9781611972801.59
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.