{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:39:42Z","timestamp":1730227182561,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/ic3.2018.8530473","type":"proceedings-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T19:30:16Z","timestamp":1542051016000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Predicting the Algorithmic Time Complexity of Single Parametric Algorithms Using Multiclass Classification with Gradient Boosted Trees"],"prefix":"10.1109","author":[{"given":"Deepak Kumar","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit","family":"Vohra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarun","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICTACC.2017.26"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFORMATICS.2017.8327225"},{"journal-title":"Link to the codes used for generation of features","year":"0","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICIII.2011.104"},{"journal-title":"Link to the generated data points corresponding to their respective codes","year":"0","key":"ref11"},{"journal-title":"Methodology of the master method","year":"0","key":"ref5"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: a gradient boosting machine","volume":"29","author":"friedman","year":"2001","journal-title":"Ann Stat"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCT.2017.8117821"},{"year":"0","key":"ref2"},{"year":"0","key":"ref9"},{"journal-title":"Overview of random forest and xgboost","year":"0","key":"ref1"}],"event":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","start":{"date-parts":[[2018,8,2]]},"location":"Noida","end":{"date-parts":[[2018,8,4]]}},"container-title":["2018 Eleventh International Conference on Contemporary Computing (IC3)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8509799\/8530453\/08530473.pdf?arnumber=8530473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T16:49:07Z","timestamp":1643215747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8530473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ic3.2018.8530473","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}