{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:24:04Z","timestamp":1757456644095},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11227-020-03449-x","type":"journal-article","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T10:03:49Z","timestamp":1603188229000},"page":"5237-5238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Intelligent and pervasive computing for cyber-physical systems"],"prefix":"10.1007","volume":"77","author":[{"given":"Mohammad R.","family":"Khosravi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varun G.","family":"Menon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,20]]},"reference":[{"key":"3449_CR1","doi-asserted-by":"publisher","first-page":"9716","DOI":"10.1007\/s11227-020-03211-3","volume":"76","author":"X Deng","year":"2020","unstructured":"Deng X, Xu Y, Chen L et al (2020) Dynamic clustering method for imbalanced learning based on AdaBoost. J Supercomput 76:9716\u20139738. https:\/\/doi.org\/10.1007\/s11227-020-03211-3","journal-title":"J Supercomput"},{"key":"3449_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03436-2","author":"P Tavallali","year":"2020","unstructured":"Tavallali P, Tavallali P, Singhal M (2020) K-means tree: an optimal clustering tree for unsupervised learning. J Supercomput. https:\/\/doi.org\/10.1007\/s11227-020-03436-2","journal-title":"J Supercomput"},{"key":"3449_CR3","unstructured":"Khosravi M et al (2020) The topical collection on intelligent and pervasive computing for cyber-physical systems. J Supercomput. Access through: https:\/\/link.springer.com\/journal\/11227\/topicalCollection\/AC_139af0dd61f6c80979c8197ad5303db8\/"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03449-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03449-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03449-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T10:55:25Z","timestamp":1634727325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03449-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,20]]},"references-count":3,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["3449"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03449-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,20]]},"assertion":[{"value":"20 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}