乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T11:36:58Z","timestamp":1724499418688},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1016\/j.artint.2016.07.003","type":"journal-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T13:35:43Z","timestamp":1468935343000},"page":"143-167","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Building knowledge maps of Web graphs"],"prefix":"10.1016","volume":"239","author":[{"given":"Valeria","family":"Fionda","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Gutierrez","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7499-5798","authenticated-orcid":false,"given":"Giuseppe","family":"Pirr\u00f2","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2016.07.003_br0010","series-title":"Elements of Cartography","author":"Robinson","year":"1995"},{"key":"10.1016\/j.artint.2016.07.003_br0020","series-title":"Atlas of Cyberspace","author":"Dodge","year":"2001"},{"issue":"4","key":"10.1016\/j.artint.2016.07.003_br0030","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0040","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1111\/j.1475-6811.2007.00158.x","article-title":"Forecasting \u201cfriends forever\u201d: a longitudinal investigation of sustained closeness between best friends","volume":"14","author":"Ledbetter","year":"2007","journal-title":"Pers. Relatsh."},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0050","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0169-7552(95)00103-6","article-title":"WebMap: a graphical hypertext navigation tool","volume":"28","author":"Doemel","year":"1995","journal-title":"Comput. Netw. ISDN Syst."},{"key":"10.1016\/j.artint.2016.07.003_br0060","series-title":"WWW","first-page":"326","article-title":"A metro map metaphor for guided tours on the web: the webvise guided tour system","author":"Sandvad","year":"2001"},{"key":"10.1016\/j.artint.2016.07.003_br0070","series-title":"WWW","first-page":"899","article-title":"Trains of thought: generating information maps","author":"Shahaf","year":"2012"},{"key":"10.1016\/j.artint.2016.07.003_br0080","series-title":"ISWC","first-page":"622","article-title":"Explaining and suggesting relatedness in knowledge graphs","author":"Pirr\u00f2","year":"2015"},{"key":"10.1016\/j.artint.2016.07.003_br0090","series-title":"KR","article-title":"Knowledge maps of web graphs","author":"Fionda","year":"2014"},{"key":"10.1016\/j.artint.2016.07.003_br0100","series-title":"ISWC (Posters & Demos)","first-page":"81","article-title":"The map generator tool","author":"Fionda","year":"2014"},{"key":"10.1016\/j.artint.2016.07.003_br0110","series-title":"Jorge Luis Borges, Collected Fictions","first-page":"325","article-title":"On the exactitude of science","author":"Borges","year":"1998"},{"issue":"3","key":"10.1016\/j.artint.2016.07.003_br0120","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jswis.2009081901","article-title":"Linked data \u2013 the story so far","volume":"5","author":"Bizer","year":"2009","journal-title":"Int. J. Semantic Web Inf. Syst."},{"key":"10.1016\/j.artint.2016.07.003_br0130","series-title":"SPARQL 1.1 query language","author":"Harris","year":"2010"},{"issue":"4","key":"10.1016\/j.artint.2016.07.003_br0140","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.websem.2010.01.002","article-title":"NSPARQL: a navigational language for RDF","volume":"8","author":"P\u00e9rez","year":"2010","journal-title":"J. Web Semant."},{"key":"10.1016\/j.artint.2016.07.003_br0150","series-title":"WWW","first-page":"281","article-title":"Semantic navigation on the web of data: specification of routes, web fragments and actions","author":"Fionda","year":"2012"},{"key":"10.1016\/j.artint.2016.07.003_br0160","series-title":"Linked Data: Evolving the Web into a Global Data Space","author":"Heath","year":"2011"},{"key":"10.1016\/j.artint.2016.07.003_br0170","series-title":"KDD","first-page":"118","article-title":"Fast discovery of connection subgraphs","author":"Faloutsos","year":"2004"},{"key":"10.1016\/j.artint.2016.07.003_br0180","series-title":"AAAI","first-page":"800","article-title":"The KOJAK group finder: connecting the dots via integrated knowledge-based and statistical reasoning","author":"Adibi","year":"2004"},{"key":"10.1016\/j.artint.2016.07.003_br0190","series-title":"PKDD 2007","first-page":"471","article-title":"The most reliable subgraph problem","author":"Hintsanen","year":"2007"},{"key":"10.1016\/j.artint.2016.07.003_br0200","series-title":"ICDM","first-page":"659","article-title":"Network simplification with minimal loss of connectivity","author":"Zhou","year":"2010"},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0210","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1117454.1117462","article-title":"Discovering informative connection subgraphs in multi-relational graphs","volume":"7","author":"Ramakrishnan","year":"2005","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0220","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1209\/epl\/i2005-10232-x","article-title":"Minimum spanning trees of weighted scale-free networks","volume":"72","author":"Macdonald","year":"2005","journal-title":"Europhys. Lett."},{"key":"10.1016\/j.artint.2016.07.003_br0230","series-title":"ICDE","first-page":"868","article-title":"STAR: Steiner-tree approximation in relationship graphs","author":"Kasneci","year":"2009"},{"key":"10.1016\/j.artint.2016.07.003_br0240","series-title":"Introduction to Social Network Methods","author":"Hanneman","year":"2005"},{"key":"10.1016\/j.artint.2016.07.003_br0250","series-title":"XML Path language (XPath) recommendation","author":"Consortium","year":"1999"},{"key":"10.1016\/j.artint.2016.07.003_br0260","series-title":"ISWC (Posters & Demos)","article-title":"Extracting relevant subgraphs from graph navigation","volume":"vol. 914","author":"Fionda","year":"2012"},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0270","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/2697393","article-title":"Nautilod: a formal language for the web of data graph","volume":"9","author":"Fionda","year":"2015","journal-title":"ACM Trans. Web"},{"key":"10.1016\/j.artint.2016.07.003_br0280","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.websem.2014.04.003","article-title":"The swget portal: navigating and acting on the web of linked data","volume":"26","author":"Fionda","year":"2014","journal-title":"J. Web Semant."},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0290","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","article-title":"The map equation","volume":"178","author":"Rosvall","year":"2009","journal-title":"Eur. Phys. J. Spec. Top."},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0300","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1132952.1132954","article-title":"Graph mining: laws, generators, and algorithms","volume":"38","author":"Chakrabarti","year":"2006","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0310","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"10.1016\/j.artint.2016.07.003_br0320","series-title":"ACM\u2013SIAM","first-page":"679","article-title":"Compact representations of separable graphs","author":"Blandford","year":"2003"},{"issue":"3","key":"10.1016\/j.artint.2016.07.003_br0330","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/S0097539799359117","article-title":"A fast general methodology for information-theoretically optimal encodings of graphs","volume":"30","author":"He","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0340","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E, Stat. Nonlinear Soft Matter Phys."},{"key":"10.1016\/j.artint.2016.07.003_br0350","series-title":"SIGKDD","first-page":"824","article-title":"Scan: a structural clustering algorithm for networks","author":"Xu","year":"2007"},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0360","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/j.artint.2016.07.003_br0370","series-title":"AAAI Spring Symposium: AI Technologies for Homeland Security","first-page":"91","article-title":"Knowledge representation issues in semantic graphs for relationship detection","author":"Marc Barth\u00e9lemy","year":"2005"},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0380","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322433","article-title":"Survey of graph database models","volume":"40","author":"Angles","year":"2008","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.artint.2016.07.003_br0390","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.websem.2009.02.002","article-title":"Extending SPARQL with regular expression patterns (for querying RDF)","volume":"7","author":"Alkhateeb","year":"2009","journal-title":"J. Web Semant."},{"key":"10.1016\/j.artint.2016.07.003_br0400","series-title":"RR","first-page":"251","article-title":"A RPL through RDF: expressive navigation in RDF graphs","author":"Zauner","year":"2010"},{"key":"10.1016\/j.artint.2016.07.003_br0410","series-title":"AAAI","first-page":"102","article-title":"Extended property paths: writing more SPARQL queries in a succinct way","author":"Fionda","year":"2015"},{"key":"10.1016\/j.artint.2016.07.003_br0420","series-title":"ICDE","first-page":"636","article-title":"XPlainer: visual explanations of XPath queries","author":"Consens","year":"2007"},{"key":"10.1016\/j.artint.2016.07.003_br0430","series-title":"WWW","first-page":"797","article-title":"SPARQL2l: towards support for subgraph extraction queries in RDF databases","author":"Anyanwu","year":"2007"},{"key":"10.1016\/j.artint.2016.07.003_br0440","series-title":"WWW","first-page":"411","article-title":"Data summaries for on-demand queries over linked data","author":"Harth","year":"2010"},{"key":"10.1016\/j.artint.2016.07.003_br0450","series-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Di Battista","year":"1998"},{"issue":"1\u20136","key":"10.1016\/j.artint.2016.07.003_br0460","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","article-title":"Graph structure in the web","volume":"33","author":"Broder","year":"2000","journal-title":"Comput. Netw."},{"key":"10.1016\/j.artint.2016.07.003_br0470","series-title":"Semantic Search over the Web","first-page":"3","article-title":"Topology of the web of data","author":"Bizer","year":"2012"},{"issue":"3","key":"10.1016\/j.artint.2016.07.003_br0480","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1278253.1278260","article-title":"Visualization of web spaces: state of the art and future directions","volume":"38","author":"Turetken","year":"2007","journal-title":"ACM SIGMIS Database"},{"issue":"1","key":"10.1016\/j.artint.2016.07.003_br0490","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/aris.1440370106","article-title":"Visualizing knowledge domains","volume":"37","author":"Borner","year":"2005","journal-title":"Annu. Rev. Inf. Sci. Technol."},{"key":"10.1016\/j.artint.2016.07.003_br0500","series-title":"Hypertext","first-page":"43","article-title":"Hypermedia topologies and user navigation","author":"Parunak","year":"1989"},{"key":"10.1016\/j.artint.2016.07.003_br0510","series-title":"Hypertext","first-page":"61","article-title":"Visualizing and assessing navigation in hypertext","author":"McEneaney","year":"1999"},{"key":"10.1016\/j.artint.2016.07.003_br0520","series-title":"WWW","article-title":"WebMap: concept mapping on the web","author":"Gaines","year":"1995"},{"key":"10.1016\/j.artint.2016.07.003_br0530","series-title":"WWW","first-page":"221","article-title":"Geospatial mapping and navigation of the web","author":"McCurley","year":"2001"},{"key":"10.1016\/j.artint.2016.07.003_br0540","series-title":"WWW","first-page":"343","article-title":"Constructing multi-granular and topic-focused web site maps","author":"Li","year":"2001"},{"key":"10.1016\/j.artint.2016.07.003_br0550","series-title":"Knowledge Cartography: Software Tools and Mapping Techniques","author":"Okada","year":"2008"},{"key":"10.1016\/j.artint.2016.07.003_br0560","series-title":"XML Topic Maps: Creating and Using Topic Maps for the Web","first-page":"31","article-title":"A perspective on the quest for global knowledge interchange","author":"Newcomb","year":"2002"},{"key":"10.1016\/j.artint.2016.07.003_br0570","article-title":"As we may think","author":"Bush","year":"1945","journal-title":"Atl. Mon."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370216300807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370216300807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T21:08:37Z","timestamp":1634504917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370216300807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":57,"alternative-id":["S0004370216300807"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2016.07.003","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2016,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Building knowledge maps of Web graphs","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2016.07.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}