{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:30Z","timestamp":1750221270577,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T00:00:00Z","timestamp":1512345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["16K00161"],"award-info":[{"award-number":["16K00161"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,12,4]]},"DOI":"10.1145\/3151759.3151820","type":"proceedings-article","created":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T18:54:36Z","timestamp":1518202476000},"page":"126-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Approach for retrieving similar stock price patterns using dynamic programming method"],"prefix":"10.1145","author":[{"given":"Yoshihisa","family":"Udagawa","sequence":"first","affiliation":[{"name":"Tokyo Polytechnic University, Kanagawa, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,12,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2011. Technical Analysis Cambridge Univ. (Feb. 2011) 1--179 http:\/\/www.mrao.cam.ac.uk\/~mph\/Technical_Analysis.pdf.  2011. Technical Analysis Cambridge Univ. (Feb. 2011) 1--179 http:\/\/www.mrao.cam.ac.uk\/~mph\/Technical_Analysis.pdf."},{"key":"e_1_3_2_1_2_1","unstructured":"Rose M. 2011. Everything you wanted to know about candlestick charts Thames Publishing Ltd. (2011) 1--22.  Rose M. 2011. Everything you wanted to know about candlestick charts Thames Publishing Ltd. (2011) 1--22."},{"volume-title":"Dynamic Programming: Longest Common Subsequence, CMSC 451, Maryland Univ. (Sept.","year":"2010","author":"Mount D.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","unstructured":"Park J. 2015. Dynamic Programming CS 97SI Stanford Univ. (June 2015) 1--36 https:\/\/web.stanford.edu\/class\/cs97si\/04-dynamic-programing.pdf.  Park J. 2015. Dynamic Programming CS 97SI Stanford Univ. (June 2015) 1--36 https:\/\/web.stanford.edu\/class\/cs97si\/04-dynamic-programing.pdf."},{"key":"e_1_3_2_1_5_1","unstructured":"Kinlay J. 2016. Dynamic Time Warping - QUANTITATIVE RESEARCH AND TRADING (Aug. 2016) 1--11 http:\/\/jonathankinlay.com\/2016\/08\/dynamic-time-warping\/.  Kinlay J. 2016. Dynamic Time Warping - QUANTITATIVE RESEARCH AND TRADING (Aug. 2016) 1--11 http:\/\/jonathankinlay.com\/2016\/08\/dynamic-time-warping\/."},{"key":"e_1_3_2_1_6_1","first-page":"3","article-title":"Stock market direction prediction using data mining Classification","volume":"10","author":"Paliyawan P.","year":"2015","journal-title":"Journal of Engineering and Applied Sciences, Asian Research Publishing Network (ARPN)"},{"volume-title":"Proceedings of the International Arab Conference on Information Technology (ACIT'2013)","author":"Al-Radaideh Q. A.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","first-page":"3","article-title":"Stock Price Prediction Using K-Nearest Neighbor (kNN) Algorithm","volume":"3","author":"Alkhatib K.","year":"2013","journal-title":"International Journal of Business, Humanities and Technology"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2010.05.004"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.06.024"},{"volume-title":"Springer Nature","year":"2016","author":"Smith T. G.","key":"e_1_3_2_1_11_1"}],"event":{"name":"iiWAS2017: The 19th International Conference on Information Integration and Web-based Applications & Services","acronym":"iiWAS2017","location":"Salzburg Austria"},"container-title":["Proceedings of the 19th International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3151759.3151820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3151759.3151820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:05Z","timestamp":1750212665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3151759.3151820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,4]]},"references-count":11,"alternative-id":["10.1145\/3151759.3151820","10.1145\/3151759"],"URL":"https:\/\/doi.org\/10.1145\/3151759.3151820","relation":{},"subject":[],"published":{"date-parts":[[2017,12,4]]},"assertion":[{"value":"2017-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}