{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:56:33Z","timestamp":1743058593812,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","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-21803-4_89","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"893-905","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Customer Clustering of French Transmission System Operator (RTE) Based on Their Electricity Consumption"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Da Silva","sequence":"first","affiliation":[]},{"given":"Hoai Minh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Lefieux","sequence":"additional","affiliation":[]},{"given":"Bach","family":"Tran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"issue":"6","key":"89_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1093\/bioinformatics\/17.6.495","volume":"17","author":"J Aach","year":"2001","unstructured":"Aach, J., Church, G.M.: Aligning gene expression time series with time warping algorithms. Bioinformatics 17(6), 495\u2013508 (2001)","journal-title":"Bioinformatics"},{"key":"89_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.is.2015.04.007","volume":"53","author":"S Aghabozorgi","year":"2015","unstructured":"Aghabozorgi, S., Seyed Shirkhorshidi, A., Ying Wah, T.: Time-series clustering - a decade review. Inf. Syst. 53, 16\u201338 (2015)","journal-title":"Inf. Syst."},{"issue":"3","key":"89_CR3","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/s10618-016-0483-9","volume":"31","author":"A Bagnall","year":"2017","unstructured":"Bagnall, A., Lines, J., Bostrom, A., Large, J., Keogh, E.: The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min. Knowl. Discov. 31(3), 606\u2013660 (2017)","journal-title":"Data Min. Knowl. Discov."},{"key":"89_CR4","doi-asserted-by":"crossref","unstructured":"Chu, S., Keogh, E., Hart, D., Pazzani, M.: Iterative deepening dynamic time warping for time series. In: Proceedings of the 2002 SIAM International Conference on Data Mining, pp. 195\u2013212. SIAM (2002)","DOI":"10.1137\/1.9781611972726.12"},{"key":"89_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-60299-2_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1995","author":"DQ Goldin","year":"1995","unstructured":"Goldin, D.Q., Kanellakis, P.C.: On similarity queries for time-series data: Constraint specification and implementation. In: Montanari, U., Rossi, F. (eds.) Principles and Practice of Constraint Programming \u2013 CP 1995. Lecture Notes in Computer Science, pp. 137\u2013153. Springer, Heidelberg (1995)"},{"issue":"4","key":"89_CR6","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"HA Thi Le","year":"2007","unstructured":"Le Thi, H.A., Belghiti, M.T., Pham Dinh, T.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37(4), 593\u2013608 (2007)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"89_CR7","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"HA Thi Le","year":"2014","unstructured":"Le Thi, H.A., Le, H.M., Pham, D.T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognit. 47(1), 388\u2013401 (2014)","journal-title":"Pattern Recognit."},{"key":"89_CR8","unstructured":"Le\u00a0Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: A DCA-Like Algorithm and its Accelerated Version with Application in Data Visualization. \n                    arXiv:1806.09620\n                    \n                   [Cs, Math]. p.\u00a08 (2018)"},{"issue":"12","key":"89_CR9","doi-asserted-by":"crossref","first-page":"2827","DOI":"10.1162\/NECO_a_00673","volume":"26","author":"HA Thi Le","year":"2014","unstructured":"Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: A DC programming approach for finding communities in networks. Neural Comput. 26(12), 2827\u20132854 (2014)","journal-title":"Neural Comput."},{"issue":"1","key":"89_CR10","first-page":"23","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: The DC (Difference of Convex Functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"89_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Thi Le","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"89_CR12","first-page":"2579","volume":"9","author":"L Maaten Van der","year":"2008","unstructured":"Van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"89_CR13","doi-asserted-by":"crossref","unstructured":"Meinard, M.: Dynamic time warping. In: Information Retrieval for Music and Motion, pp. 69\u201384. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74048-3_4"},{"key":"89_CR14","doi-asserted-by":"crossref","unstructured":"Paparrizos, J., Gravano, L.: K-Shape: efficient and accurate clustering of time series. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1855\u20131870. ACM Press (2015)","DOI":"10.1145\/2723372.2737793"},{"issue":"1","key":"89_CR15","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"89_CR16","unstructured":"Pham\u00a0Dinh, T., Le\u00a0Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)"},{"key":"89_CR17","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., Keogh, E.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD 2012, p.\u00a0262. ACM Press, Beijing, China (2012)","DOI":"10.1145\/2339530.2339576"},{"issue":"6","key":"89_CR18","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1007\/s10618-014-0377-7","volume":"29","author":"P Sch\u00e4fer","year":"2015","unstructured":"Sch\u00e4fer, P.: The BOSS is concerned with time series classification in the presence of noise. Data Min. Knowl. Discov. 29(6), 1505\u20131530 (2015)","journal-title":"Data Min. Knowl. Discov."},{"key":"89_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.32614\/RJ-2016-021","volume":"8","author":"L Scrucca","year":"2016","unstructured":"Scrucca, L., Fop, M., Murphy, T.B., Raftery, A.E.: Mclust 5: clustering, classification and density estimation using gaussian finite mixture models. R J. 8, 29 (2016)","journal-title":"R J."},{"issue":"2","key":"89_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 63(2), 411\u2013423 (2001)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"11","key":"89_CR21","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"T Warren Liao","year":"2005","unstructured":"Warren Liao, T.: Clustering of time series data\u2013a survey. Pattern Recognit. 38(11), 1857\u20131874 (2005)","journal-title":"Pattern Recognit."},{"key":"89_CR22","unstructured":"Yang, Z., Peltonen, J., Kaski, S.: Majorization-minimization for manifold embedding. In: Artificial Intelligence and Statistics, pp. 1088\u20131097 (2015)"},{"key":"89_CR23","unstructured":"Yi, B.K., Faloutsos, C.: Fast time sequence indexing for arbitrary Lp norms. In: VLDB, vol.\u00a0385, p.\u00a099 (2000)"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T06:01:10Z","timestamp":1572588070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_89","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}