{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:27:17Z","timestamp":1729650437542,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/cec.2016.7744077","type":"proceedings-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T22:22:49Z","timestamp":1480544569000},"page":"2337-2344","source":"Crossref","is-referenced-by-count":0,"title":["Automatic inference of graph models for directed complex networks using genetic programming"],"prefix":"10.1109","author":[{"given":"Michael Richard","family":"Medland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle Robert","family":"Harrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatrice M.","family":"Ombuki-Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/1402731"},{"journal-title":"Foundations of the Theory of Probability","year":"1950","author":"kolmogorov","key":"ref32"},{"journal-title":"Automatic inference of graph models for complex networks with genetic programming","year":"2013","author":"bailey","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/NaBIC.2014.6921896"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1038\/43604","article-title":"Internet: growth dynamics of the worldwide web","volume":"401","author":"huberman","year":"1999","journal-title":"Nature"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.200327197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.4629"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.63.066123"},{"key":"ref15","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.62.1842"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330263"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281452"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16549-3_16"},{"key":"ref28","volume":"1","author":"koza","year":"1992","journal-title":"Genetic Programming Vol 1 on the Programming of Computers by Means of Natural Selection"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1126\/science.149.3683.510"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2598394.2598494"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463498"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.2001.1711"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"journal-title":"The Structure and Dynamics of Networks","year":"2006","author":"newman","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1385\/NI:2:2:145"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"ref20","article-title":"A meta-analysis of centrality measures for comparing and generating complex network models","author":"harrison","year":"2015","journal-title":"Journal of Computational Science p TBD"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/2200000005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/srep06284"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"erd\u00f6s","year":"1961","journal-title":"Acta Mathematica Hungarica"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs i","volume":"6","author":"erdos","year":"1959","journal-title":"Publ Math Debrecen"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref25","first-page":"60","article-title":"The small world problem","volume":"2","author":"milgram","year":"1967","journal-title":"Psychology Today"}],"event":{"name":"2016 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2016,7,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2016,7,29]]}},"container-title":["2016 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7636124\/7743769\/07744077.pdf?arnumber=7744077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:20:24Z","timestamp":1718922024000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7744077\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cec.2016.7744077","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}