{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:56:29Z","timestamp":1729619789654,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/cip.2010.5604092","type":"proceedings-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T18:51:03Z","timestamp":1288810263000},"page":"269-274","source":"Crossref","is-referenced-by-count":0,"title":["Predicting relations in news-media content among EU countries"],"prefix":"10.1109","author":[{"given":"Ilias N.","family":"Flaounas","sequence":"first","affiliation":[]},{"given":"Nick","family":"Fyson","sequence":"additional","affiliation":[]},{"given":"Nello","family":"Cristianini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: simple building blocks of complex networks","volume":"298","author":"milo","year":"2002","journal-title":"Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2344614"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6"},{"journal-title":"ROC graphs Notes and practical considerations for researchers (Technical Report HPL-2003-4)","year":"2003","author":"fawcett","key":"ref13"},{"journal-title":"Pattern Recognition","year":"2009","author":"theodoridis","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp494"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04174-7_55"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/34.790431"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016034"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","article-title":"A graph distance metric combining maximum common subgraph and minimum common supergraph","volume":"22","author":"fem\u00e1ndez","year":"2001","journal-title":"Pattern Recognition Letters"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3115\/1557769.1557821"},{"key":"ref1","first-page":"344","article-title":"Inference and validation of networks","volume":"5781","author":"flaounas","year":"2009","journal-title":"ECML\/PKDD"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the internet topology","author":"faloutsos","year":"1999","journal-title":"SIGCOMM"}],"event":{"name":"2010 2nd International Workshop on Cognitive Information Processing (CIP)","start":{"date-parts":[[2010,6,14]]},"location":"Elba Island, Italy","end":{"date-parts":[[2010,6,16]]}},"container-title":["2010 2nd International Workshop on Cognitive Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5595574\/5604034\/05604092.pdf?arnumber=5604092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T03:24:54Z","timestamp":1685849094000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5604092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cip.2010.5604092","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}