{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:00:01Z","timestamp":1740142801764,"version":"3.37.3"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"8","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61332006 and 61100022"],"award-info":[{"award-number":["61332006 and 61100022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2011CB302200-G","2012AA011004"],"award-info":[{"award-number":["2011CB302200-G","2012AA011004"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1093\/comjnl\/bxw005","type":"journal-article","created":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T03:49:31Z","timestamp":1456458571000},"page":"1207-1219","source":"Crossref","is-referenced-by-count":0,"title":["Searching the Informative Subgraph Based on the PeakGraph Model"],"prefix":"10.1093","volume":"59","author":[{"given":"Huilin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JunChang","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,2,25]]},"reference":[{"key":"2016083005472038000_59.8.1207.1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0137"},{"key":"2016083005472038000_59.8.1207.2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq076"},{"key":"2016083005472038000_59.8.1207.3","doi-asserted-by":"crossref","unstructured":"Steinhaeuser K. and Chawla N.V. (2008) Community Detection in a Large Real-World Social Network. Proc. 1st Int. Workshop on Social Computing, Behavioral Modeling and Prediction, Phoenix, AZ, April 1\u20132, pp. 168\u2013175. Springer, New York, USA.","DOI":"10.1007\/978-0-387-77672-9_19"},{"key":"2016083005472038000_59.8.1207.4","doi-asserted-by":"crossref","unstructured":"Xiang R. , Neville J. and Rogati M. (2010) Modeling Relationship Strength in Online Social Networks. Proc. WWW 2010, Raleigh, NC, USA, April 26\u201330, pp. 981\u2013990. ACM, New York, USA.","DOI":"10.1145\/1772690.1772790"},{"key":"2016083005472038000_59.8.1207.5","unstructured":"http:\/\/www.casos.cs.cmu.edu\/index.php (accessed October 23, 2015)."},{"key":"2016083005472038000_59.8.1207.6","doi-asserted-by":"crossref","unstructured":"Pandit S. , Chau D.H. , Wang S. and Faloutsos C. (2007) Netprobe: A Fast and Scalable System for Fraud Detection in Online Auction Networks. Proc.WWW'07, Banff, Alberta, Canada, May 8\u201312, pp. 201\u2013210. ACM, New York, USA.","DOI":"10.1145\/1242572.1242600"},{"key":"2016083005472038000_59.8.1207.7","doi-asserted-by":"crossref","unstructured":"Faloutsos C. , McCurley K.S. and Tomkins A. (2004) Fast Discovery of Connection Subgraphs. Proc. KDD'04, Seattle, Washington, USA, August 22\u201325, pp. 118\u2013127. ACM, New York, USA.","DOI":"10.1145\/1014052.1014068"},{"key":"2016083005472038000_59.8.1207.8","doi-asserted-by":"crossref","unstructured":"Tong H. and Faloutsos C. (2006) Center-piece Subgraphs: Problem Definition and Fast Solutions. Proc. KDD'06, Philadelphia, USA, August 20\u201323, pp. 404\u2013413. ACM, New York, USA.","DOI":"10.1145\/1150402.1150448"},{"key":"2016083005472038000_59.8.1207.9","doi-asserted-by":"crossref","unstructured":"Chen C. , Wang G. , Liu H. , Xin J. and Yuan Y. (2011) SISP: A New Framework for Searching the Informative Subgraph based on PSO. Proc. CIKM'11, Glasgow, Scotland, UK, October 24\u201328, pp. 453\u2013462. ACM, New York, USA.","DOI":"10.1145\/2063576.2063645"},{"key":"2016083005472038000_59.8.1207.10","unstructured":"Vast S. , Dupont P. and Deville Y. (2005) Automatic Extraction of Relevant Nodes in Biochemical Networks. Proc. Atelier Apprentissage Et Bioinformatique, CAp2005, Nice, France, May 31\u2013June 6, pp. 21\u201331. Conf\u00e9rence Dapprentissage, Nice, France."},{"key":"2016083005472038000_59.8.1207.11","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117462"},{"key":"2016083005472038000_59.8.1207.12","doi-asserted-by":"crossref","unstructured":"Kasneci G. , Elbassuoni S. and Weikum G. (2009) Ming: Mining Informative Entity-relationship Subgraphs. Proc. CIKM'09, Hong Kong, November 2\u20136, pp. 1653\u20131656. ACM, New York, USA.","DOI":"10.1145\/1645953.1646196"},{"key":"2016083005472038000_59.8.1207.13","doi-asserted-by":"crossref","unstructured":"Eberhart R. and Shi Y.H. (2001) Particle Swarm Optimization: Developments, Applications and Resources. Proc. CEC 2001, Seoul, South Korea, May 27\u201330, pp. 81\u201386. IEEE, New York, USA.","DOI":"10.1109\/CEC.2001.934374"},{"key":"2016083005472038000_59.8.1207.14","doi-asserted-by":"crossref","unstructured":"Navlakha S. , Rastogi R. and Shrivastava N. (2008) Graph Summarization with Bounded Error. Proc. SIGMOD'08, Vancouver, Canada, June 9\u201312, pp. 419\u2013432. ACM, New York, USA.","DOI":"10.1145\/1376616.1376661"},{"key":"2016083005472038000_59.8.1207.15","doi-asserted-by":"crossref","unstructured":"Du N. , Wu B. , Pei X. , Wang B. and Xu L. (2007) Community Detection in Large-scale Social Networks. Proc. WebKDD\/SNA-KDD'07, San Jose, USA, August 12\u201315, pp. 16\u201325. ACM, New York, USA.","DOI":"10.1145\/1348549.1348552"},{"key":"2016083005472038000_59.8.1207.16","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1103\/PhysRevE.72.027104","article-title":"Community detection in complex networks using extremal optimization","volume":"72","author":"Duch","year":"2005","journal-title":"Phys. Rev. E Stat. Nonlin. Soft Matter Phys."},{"key":"2016083005472038000_59.8.1207.17","doi-asserted-by":"crossref","unstructured":"Kalisky T. , Sreenivasan S. , Braunstein L.A. , Buldyrev S.V. , Havlin S. and Stanley H.E. (2004) Scale-Free Properties of Weighted Random Graphs: Minimum Spanning Trees and Percolation. Proc. Sci. Complex Networks: from Biology to the Internet and WWW, Aveiro Portugal, August 29\u2013September 2, pp. 79\u201389. AIP, New York, USA.","DOI":"10.1063\/1.1985379"},{"key":"2016083005472038000_59.8.1207.18","unstructured":"Hauff C. and N\u00fcrnberger A. (2006) Utilizing Scale-free Networks to Support the Search for Scientific Publications. Proc. Dutch Belgian Workshop on Information Retrieval, Delft, The Netherlands, March 13\u201314, pp. 57\u201364. Neslia Paniculata, Delft, The Netherlands."},{"key":"2016083005472038000_59.8.1207.19","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"2016083005472038000_59.8.1207.20","unstructured":"SIDL-WP-1999-0120 (1999) The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab, Palo Alto, CA, USA."},{"key":"2016083005472038000_59.8.1207.21","unstructured":"http:\/\/snap.stanford.edu\/data\/cit-HepPh.html (accessed October 23, 2015)."},{"key":"2016083005472038000_59.8.1207.22","unstructured":"http:\/\/snap.stanford.edu\/data\/roadNet-PA.htm (accessed October 23, 2015)."},{"key":"2016083005472038000_59.8.1207.23","unstructured":"http:\/\/snap.stanford.edu\/data\/roadNet-CA.html (accessed October 23, 2015)."},{"key":"2016083005472038000_59.8.1207.24","unstructured":"http:\/\/snap.stanford.edu\/data\/roadNet-TX.html (accessed October 23, 2015)."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/8\/1207\/8039623\/bxw005.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T14:19:07Z","timestamp":1589638747000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,25]]},"references-count":24,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2016,8,30]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1093\/comjnl\/bxw005"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw005","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2016,2,25]]}}}