期刊文献+

Similarity Search Algorithm over Data Supply Chain Based on Key Points 被引量:1

Similarity Search Algorithm over Data Supply Chain Based on Key Points
原文传递
导出
摘要 In this paper, we target a similarity search among data supply chains, which plays an essential role in optimizing the supply chain and extending its value. This problem is very challenging for application-oriented data supply chains because the high complexity of the data supply chain makes the computation of similarity extremely complex and inefficient. In this paper, we propose a feature space representation model based on key points,which can extract the key features from the subsequences of the original data supply chain and simplify it into a feature vector form. Then, we formulate the similarity computation of the subsequences based on the multiscale features. Further, we propose an improved hierarchical clustering algorithm for a similarity search over the data supply chains. The main idea is to separate the subsequences into disjoint groups such that each group meets one specific clustering criteria; thus, the cluster containing the query object is the similarity search result. The experimental results show that the proposed approach is both effective and efficient for data supply chain retrieval. In this paper, we target a similarity search among data supply chains, which plays an essential role in optimizing the supply chain and extending its value. This problem is very challenging for application-oriented data supply chains because the high complexity of the data supply chain makes the computation of similarity extremely complex and inefficient. In this paper, we propose a feature space representation model based on key points,which can extract the key features from the subsequences of the original data supply chain and simplify it into a feature vector form. Then, we formulate the similarity computation of the subsequences based on the multiscale features. Further, we propose an improved hierarchical clustering algorithm for a similarity search over the data supply chains. The main idea is to separate the subsequences into disjoint groups such that each group meets one specific clustering criteria; thus, the cluster containing the query object is the similarity search result. The experimental results show that the proposed approach is both effective and efficient for data supply chain retrieval.
出处 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2017年第2期174-184,共11页 清华大学学报(自然科学版(英文版)
基金 partly supported by the National Natural Science Foundation of China(Nos.61532012,61370196,and 61672109)
关键词 data supply chain similarity search feature space hierarchical clustering data supply chain similarity search feature space hierarchical clustering
  • 相关文献

参考文献1

二级参考文献25

  • 1Das G, Lin K-I, Mannila H, Renganathan G, Smyth P: Rule Discovery from Time Series. In: KDD: 1998.16-22.
  • 2Catalano J, Armstrong T, Oates T: Discovering patterns in real-valued time series: Springer; 2006.
  • 3Keogh E J, Pazzani M J: An Enhanced Represen- tation of Time Series Which Allows Fast and Ac- curate Classification, Clustering and Relevance Feedback. In: KDD: 1998. 239-243.
  • 4Debr6geas A, H#brail G: Interactive Interpre- tation of Kohonen Maps Applied to Curves. In: KDD: 1998. 179-183.
  • 5Dean J, Ghemawat S: MapReduce: simplified data processing on large clusters. Communica- tions of the ACM 2008, 51 (1):107-113.
  • 6Zhang Y, Glass JR: An inner-product low- er-bound estimate for dynamic time warping. In: Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on: 201 I. IEEE: 5660-5663.
  • 7AIon J, Athitsos V, Yuan Q, Sclaroff S: A unified framework for gesture recognition and spatio- temporal gesture segmentation. Pattern Analy- sis and Machine Intelligence, IEEE Transactions on 2009, 31(9):1685-1699.
  • 8Keogh E, Wei L, Xi X, Vlachos M, Lee S-H, Proto- papas P: Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures. The VLDB Journal--The International Journal on Very Large Data Bases 2009, 18(3):611-630.
  • 9Huber-M6rk R, Zambanini S, Zaharieva M, Kam- pel M: Identification of ancient coins based on fusion of shape and local features. Machine vision and applications 2011, 22(6):983-994.
  • 10Chadwick NA, McMeekin DA, Tan T: Classifying eye and head movement artifacts in EEG Sig- nals. In: Digital Ecosystems and Technologies Conference (DEST), 2011 Proceedings of the 5th IEEE International Conference on: 2011. IEEE: 285-291.

共引文献5

同被引文献8

引证文献1

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部