{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:14:17Z","timestamp":1725765257075},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539732"},{"type":"electronic","value":"9783642539749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-53974-9_11","type":"book-chapter","created":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T02:25:13Z","timestamp":1387333513000},"page":"113-128","source":"Crossref","is-referenced-by-count":3,"title":["Generating Large-Scale Heterogeneous Graphs for Benchmarking"],"prefix":"10.1007","author":[{"given":"Amarnath","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: A recursive model for graph mining. In: Proc. 4th SIAM Int. Conf. on Data Mining (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: An in-depth study of stochastic kronecker graphs. In: Proc. of the 11th IEEE Int. Conf. on Data Mining (ICDM), pp. 587\u2013596 (2011)","DOI":"10.1109\/ICDM.2011.23"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Mixing patterns and community structure in networks. Statistical Mechanics of Complex Networks, 66\u201387 (2003)","DOI":"10.1007\/978-3-540-44943-0_5"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"04110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A. Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E\u00a078, 04110 (2008)","journal-title":"Phys. Rev. E"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-36727-4_11","volume-title":"Selected Topics in Performance Evaluation and Benchmarking","author":"M.-D. Pham","year":"2013","unstructured":"Pham, M.-D., Boncz, P., Erling, O.: S3g2: A scalable structure-correlated social graph generator. In: Nambiar, R., Poess, M. (eds.) TPCTC 2012. LNCS, vol.\u00a07755, pp. 156\u2013172. Springer, Heidelberg (2013)"},{"issue":"2-3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y. Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: A benchmark for OWL knowledge base systems. J. Web Sem.\u00a03(2-3), 158\u2013182 (2005)","journal-title":"J. Web Sem."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C. Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. on Semantic Web and Information Systems (IJSWIS)\u00a05(2), 1\u201324 (2009)","journal-title":"Int. J. on Semantic Web and Information Systems (IJSWIS)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Experimental Mathematics\u00a010(1), 53\u201366 (2001)","journal-title":"Experimental Mathematics"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Kolda, T.G., Pinar, A.: Community structure and scale-free collections of Erd\u00f6s-R\u00e9nyi graphs. CoRR abs\/1112.3644 (2011)","DOI":"10.1103\/PhysRevE.85.056109"},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.80.046110","volume":"80","author":"B. Karrer","year":"2009","unstructured":"Karrer, B., Newman, M.: Random graph models for directed acyclic networks. Physical Review E\u00a080(4), 046110 (2009)","journal-title":"Physical Review E"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1039\/b908681a","volume":"5","author":"G. Lima-Mendez","year":"2009","unstructured":"Lima-Mendez, G., van Helden, J.: The powerful law of the power law and other myths in network biology. Mol. BioSyst.\u00a05, 1482\u20131493 (2009)","journal-title":"Mol. BioSyst."},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1089\/106652703322539024","volume":"10","author":"F.R.K. Chung","year":"2003","unstructured":"Chung, F.R.K., Lu, L., Dewey, T.G., Galas, D.J.: Duplication models for biological networks. Journal of Computational Biology\u00a010(5), 677\u2013687 (2003)","journal-title":"Journal of Computational Biology"},{"key":"11_CR13","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C.: A scalable generative graph model with community structure (February 2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1302.6636"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1752-0509-5-21","volume":"5","author":"J. Krumsiek","year":"2011","unstructured":"Krumsiek, J., Suhre, K., Illig, T., Adamski, J., Theis, F.J.: Gaussian graphical modeling reconstructs pathway reactions from high-throughput metabolomics data. BMC Systems Biology\u00a05(1), 21 (2011)","journal-title":"BMC Systems Biology"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-60608-4_48","volume-title":"Deductive and Object-Oriented Databases","author":"D. Quass","year":"1995","unstructured":"Quass, D., Rajaraman, A., Sagiv, Y., Ullman, J., Widom, J.: Querying semistructured heterogeneous information. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds.) DOOD 1995. LNCS, vol.\u00a01013, pp. 319\u2013344. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Specifying Big Data Benchmarks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53974-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T15:14:01Z","timestamp":1558797241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53974-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642539732","9783642539749"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53974-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}