{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:55:46Z","timestamp":1743062146614,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594091"},{"type":"electronic","value":"9783030594107"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59410-7_39","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:57:43Z","timestamp":1600707463000},"page":"587-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Motif Discovery Using Similarity-Constraints Deep Neural Networks"],"prefix":"10.1007","author":[{"given":"Chuitian","family":"Rong","sequence":"first","affiliation":[]},{"given":"Ziliang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chunbin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jianming","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. J. Comput. Biol. 9(2), 225\u2013242 (2000)","key":"39_CR1","DOI":"10.1089\/10665270252935430"},{"doi-asserted-by":"crossref","unstructured":"Castro, N., Azevedo, P.J.: Multiresolution motif discovery in time series. In: SDM, pp. 665\u2013676 (2010)","key":"39_CR2","DOI":"10.1137\/1.9781611972801.73"},{"doi-asserted-by":"crossref","unstructured":"Chu, W., Cai, D.: Stacked similarity-aware autoencoders. In: IJCAI, pp. 1561\u20131567 (2017)","key":"39_CR3","DOI":"10.24963\/ijcai.2017\/216"},{"doi-asserted-by":"crossref","unstructured":"Gao, Y., Lin, J.: Efficient discovery of variable-length time series motifs with large length range in million scale time series. CoRR abs\/1802.04883 (2018)","key":"39_CR4","DOI":"10.1109\/ICDM.2017.8356939"},{"doi-asserted-by":"crossref","unstructured":"Gao, Y., Lin, J., Rangwala, H.: Iterative grammar-based framework for discovering variable-length time series motifs. In: ICMLA, pp. 7\u201312 (2016)","key":"39_CR5","DOI":"10.1109\/ICMLA.2016.0011"},{"doi-asserted-by":"crossref","unstructured":"Lam, H.T., Calders, T., Pham, N.: Online discovery of top-k similar motifs in time series data. In: ICDM, pp. 1004\u20131015 (2010)","key":"39_CR6","DOI":"10.1137\/1.9781611972818.86"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Lin, J., Oates, T.: Visualizing variable-length time series motifs. In: ICDM, pp. 895\u2013906 (2012)","key":"39_CR7","DOI":"10.1137\/1.9781611972825.77"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., U, L.H., Yiu, M.L., Gong, Z.: Quick-motif: an efficient and scalable framework for exact motif discovery. In: ICDE, pp. 579\u2013590 (2015)","key":"39_CR8","DOI":"10.1109\/ICDE.2015.7113316"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin, J., Keogh, E., Li, W., Lonardi, S.: Experiencing sax: a novel symbolic representation of time series. Data Min. Knowl. Discov. 15, 107\u2013144 (2007). https:\/\/doi.org\/10.1007\/s10618-007-0064-z","journal-title":"Data Min. Knowl. Discov."},{"unstructured":"Lin, J., Keogh, E., Lonardi, S., Patel, P.: Finding motifs in time series. In: Proceedings of 2nd Workshop on Temporal Data Mining at KDD, pp. 53\u201368 (2002)","key":"39_CR10"},{"doi-asserted-by":"crossref","unstructured":"Lin, J., Li, Y.: Finding approximate frequent patterns in streaming medical data. In: CBMS, pp. 13\u201318 (2010)","key":"39_CR11","DOI":"10.1109\/CBMS.2010.6042675"},{"doi-asserted-by":"crossref","unstructured":"Lu, J., Lin, C., Wang, W., Li, C., Wang, H.: String similarity measures and joins with synonyms. In: SIGMOD, pp. 373\u2013384 (2013)","key":"39_CR12","DOI":"10.1145\/2463676.2465313"},{"doi-asserted-by":"crossref","unstructured":"Mueen, A.: Enumeration of time series motifs of all lengths. In: ICDM, pp. 547\u2013556 (2013)","key":"39_CR13","DOI":"10.1109\/ICDM.2013.27"},{"doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E.J., Zhu, Q., Cash, S., Westover, M.B.: Exact discovery of time series motifs. In: SDM, pp. 473\u2013484 (2009)","key":"39_CR14","DOI":"10.1137\/1.9781611972795.41"},{"doi-asserted-by":"crossref","unstructured":"Narang, A., Bhattacherjee, S.: Real-time approximate range motif discovery & data redundancy removal algorithm. In: EDBT, pp. 485\u2013496 (2011)","key":"39_CR15","DOI":"10.1145\/1951365.1951422"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"CG Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artif. Intell. Res. 7, 67\u201382 (1997)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Nunthanid, P., Niennattrakul, V., Ratanamahatana, C.A.: Discovery of variable length time series motif. In: EEE, pp. 472\u2013475 (2011)","key":"39_CR17","DOI":"10.1109\/ECTICON.2011.5947877"},{"unstructured":"Patel, P., Keogh, E.J., Lin, J., Lonardi, S.: Mining motifs in massive time series databases. In: ICDM, pp. 370\u2013377 (2002)","key":"39_CR18"},{"doi-asserted-by":"crossref","unstructured":"Rong, C., Lin, C., Silva, Y.N., Wang, J., Lu, W., Du, X.: Fast and scalable distributed set similarity joins for big data analytics. In: ICDE, pp. 1059\u20131070 (2017)","key":"39_CR19","DOI":"10.1109\/ICDE.2017.151"},{"key":"39_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-44845-8_37","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P Senin","year":"2014","unstructured":"Senin, P., et al.: GrammarViz 2.0: a tool for grammar-based pattern discovery in time series. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8726, pp. 468\u2013472. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44845-8_37"},{"issue":"2\u20133","key":"39_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10994-005-5829-2","volume":"58","author":"Y Tanaka","year":"2005","unstructured":"Tanaka, Y., Iwamoto, K., Uehara, K.: Discovery of time-series motif from multi-dimensional data based on MDL principle. Mach. Learn. 58(2\u20133), 269\u2013300 (2005). https:\/\/doi.org\/10.1007\/s10994-005-5829-2","journal-title":"Mach. Learn."},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.knosys.2008.03.022","volume":"21","author":"H Tang","year":"2008","unstructured":"Tang, H., Liao, S.S.: Discovering original motifs with different lengths from time series. Knowl. Based Syst. 21, 666\u2013671 (2008)","journal-title":"Knowl. Based Syst."},{"key":"39_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-319-46478-7_31","volume-title":"Computer Vision \u2013 ECCV 2016","author":"Y Wen","year":"2016","unstructured":"Wen, Y., Zhang, K., Li, Z., Qiao, Yu.: A discriminative feature learning approach for deep face recognition. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9911, pp. 499\u2013515. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46478-7_31"},{"doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., Yan, Z., Ulanova, L., Begum, N., Keogh, E.: Matrix profile i: All pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In: ICDM, pp. 1317\u20131322 (2016)","key":"39_CR24","DOI":"10.1109\/ICDM.2016.0179"},{"issue":"1","key":"39_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10618-017-0519-9","volume":"32","author":"C-CM Yeh","year":"2017","unstructured":"Yeh, C.-C.M., et al.: Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile. Data Min. Knowl. Disc. 32(1), 83\u2013123 (2017). https:\/\/doi.org\/10.1007\/s10618-017-0519-9","journal-title":"Data Min. Knowl. Disc."},{"doi-asserted-by":"crossref","unstructured":"Zhu, Y., Zimmerman, Z., Senobari, N.S., Yeh, C.M.: Matrix profile II: exploiting a novel algorithm and gpus to break the one hundred million barrier for time series motifs and joins. In: ICDM, pp. 739\u2013748 (2016)","key":"39_CR26","DOI":"10.1109\/ICDM.2016.0085"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59410-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:53:52Z","timestamp":1710269632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59410-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594091","9783030594107"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59410-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}