|
[1]台灣物聯網實驗室 IOT Labs, 財經觀點/大數據時代 即時串流分析, https://www.facebook.com/iotlab/posts/903683066328826 [參照日期2020/7/20] [2]簡立峰 NTU Startup Day 演說: 物聯網是台灣扭轉產業的最後一次機會 http://www.bnext.com.tw/article/39479/BN-2016-05-06-163232-117[參照日期2020/7/20] [3]Amazon Kinesis Analytics. https://aws.amazon.com/tw/kinesis/analytics/ [參照日期2020/7/20] [4]經濟日報https://money.udn.com/money/story/5612/2804244 [參照日期2020/7/20] [5]Pengfei Hu, Sahraoui Dhelim, Huansheng Ning, and Tie Qiu, "Survey on fog computing: architecture, key technologies, applications and open issues", Journal of Network and Computer Applications, vol. 98, pp. 27-42, Nov. 2017. [6]Yi, Shanhe, Cheng Li, Qun Li. “A Survey of Fog Computing: Concepts, Applications and Issues”. In Mobidata '15 Proceedings of the 2015 Workshop on Mobile Big Data, pp. 37-41, 2015. [7]作者Taneyahomilk iT邦幫忙 基於雲端Iaas基礎平台OpenStack結合Kubernetes, BlockChain, Spark, SDN系列 第 11 篇Apache Spark 簡介 https://ithelp.ithome.com.tw/articles/10194895 [參照日期2020/7/20] [8]作者yjhyjhyjh0 痞客幫:Spark RDD (Resilient Distributed Datasets) 詳細圖文介紹 https://yjhyjhyjh0.pixnet.net/blog/post/411468760 [參照日期2020/7/20] [9]K.J. Åström, “On the choice of sampling rates in parametric identification of time series”, Information Sciences, vol. 1, no. 3, pp. 273-278, Jul. 1969. [10]Agrawal, Rakesh, Faloutsos, Christos, Swami, Arun, “Efficient Similarity Search In Sequence Databases”, Lecture Notes in Computer Science, vol. 730, pp. 69-84, 1993. [11]Eamonn J. Keogh and Michael J. Pazzani, “Scaling up dynamic time warping for datamining applications”, In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ’00). Association for Computing Machinery, New York, NY, USA, pp. 285–289, 2000. [12]Lin, J., Keogh, E., Wei, L. et al, “Experiencing SAX: a novel symbolic representation of time series”, Data Min Knowl Disc, vol. 15, pp. 107–144 , 2007. [13]M. Vlachos, G. Kollios and D. Gunopulos, "Discovering similar multidimensional trajectories", Proceedings 18th International Conference on Data Engineering, San Jose, CA, USA, pp. 673-684, 2002, DOI: 10.1109/ICDE.2002.994784. [14]遠洋號發表於程式開發:動態規劃求解最長公共子序列 https://kknews.cc/code/vvvb2e2.html [參照日期2020/7/20] [15]最長公共子序列-維基百科https://zh.wikipedia.org/wiki/%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%AD%90%E5%BA%8F%E5%88%97 [參照日期2020/7/20] [16]Yufeng Yu, Yuelong Zhu, Dingsheng Wan, Qun Zhao, and Huan Liu. “A Novel Trend Symbolic Aggregate Approximation for Time Series”, ArXiv abs/1905.00421, 2019. [17]Donald J. Berndt and James Clifford, “Using dynamic time warping to find patterns in time series”, In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (AAAIWS’94). AAAI Press, pp. 359–370, 1994. [18]Lei Chen and Raymond Ng, “On the marriage of Lp-norms and edit distance”, In Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (VLDB ’04). VLDB Endowment, pp. 792–803, 2004. [19]Lei Chen, M. Tamer Özsu, and Vincent Oria, “Robust and fast similarity search for moving object trajectories”, In Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD ’05). Association for Computing Machinery, New York, NY, USA, pp. 491–502, 2005, DOI:https://doi.org/10.1145/1066157.1066213 [20]Gholamreza Soleimani, Masoud Abessi, “DLCSS: A new similarity measure for time series data mining”, Engineering Applications of Artificial Intelligence, vol. 92, 2020. [21]Taxi Trajectory Data. Data from ECML/PKDD 15: Taxi Trip Time Prediction (II) Competition. https://www.kaggle.com/crailtap/taxi-trajectory [參照日期2020/7/20] [22]作者JulyRina 字典樹簡介 http://www.cppblog.com/JulyRina/archive/2015/03/09/209980.html [參照日期2020/7/20] [23]Spatial Data Science powered by SAP HANA. Mathias Kemeter https://towardsdatascience.com/spatial-data-science-powered-by-sap-hana-9d1153afa577 [參照日期2020/7/20] [24]作者Jewel INSIDE:認識大數據的黃色小象幫手-- Hadoop https://www.inside.com.tw/article/4428-big-data-4-hadoop [參照日期2020/7/20] [25]Apache Spark http://tadviser.com/index.php/Product:Apache_Spark [參照日期2020/7/20] [26]Marvin Raval, Longest Common Subsequence(LCS) Simplified and solution using Dynamic Programming with code also https://medium.com/@marvinraval99/longest-common-subsequence-lcs-using-dynamic-programming-2d77e6d9d683 [參照日期2020/7/20] [27]作者lobogaw 痞客幫:常態分配 (Normal distribution) https://lobogaw.pixnet.net/blog/post/90548816 [參照日期2020/7/20] |