{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T04:24:16Z","timestamp":1741753456164,"version":"3.38.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.3233\/aic-140594","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T22:38:20Z","timestamp":1575067100000},"page":"263-274","source":"Crossref","is-referenced-by-count":1,"title":["Maximum spanning tree based linkage learner"],"prefix":"10.1177","volume":"27","author":[{"given":"B. Hoda","family":"Helmi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Iran University of Science and Technology, Tehran, Iran. E-mails: helmi@iust.ac.ir, rahmani@iust.ac.ir"}]},{"given":"Adel T.","family":"Rahmani","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Iran University of Science and Technology, Tehran, Iran. E-mails: helmi@iust.ac.ir, rahmani@iust.ac.ir"}]}],"member":"179","container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-140594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T07:48:04Z","timestamp":1741679284000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/AIC-140594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.3233\/aic-140594","relation":{},"ISSN":["0921-7126"],"issn-type":[{"type":"print","value":"0921-7126"}],"subject":[],"published":{"date-parts":[[2014]]}}}