{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:46:27Z","timestamp":1697838387868},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T00:00:00Z","timestamp":1471478400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s11227-016-1834-4","type":"journal-article","created":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T07:46:01Z","timestamp":1471506361000},"page":"1438-1466","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Intelligent and independent processes for overcoming big graphs"],"prefix":"10.1007","volume":"73","author":[{"given":"Masoud","family":"Sagharichian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Naderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"issue":"1","key":"1834_CR1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/s10618-009-0150-5","volume":"20","author":"M Kimura","year":"2010","unstructured":"Kimura M et al (2010) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Discov 20(1):70\u201397","journal-title":"Data Min Knowl Discov"},{"key":"1834_CR2","doi-asserted-by":"crossref","unstructured":"Ma H et al (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management. ACM, Napa Valley, California, USA, pp 233\u2013242","DOI":"10.1145\/1458082.1458115"},{"issue":"3","key":"1834_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10115-011-0396-2","volume":"30","author":"K Saito","year":"2012","unstructured":"Saito K et al (2012) Efficient discovery of influential nodes for SIS models in social networks. Knowl Inf Syst 30(3):613\u2013635","journal-title":"Knowl Inf Syst"},{"key":"1834_CR4","unstructured":"Becchetti L et al (2006) Link-based characterization and detection of web spam. In: AIRWeb"},{"key":"1834_CR5","doi-asserted-by":"crossref","unstructured":"Castillo C et al (2007) Know your neighbors: Web spam detection using the web topology. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM","DOI":"10.1145\/1277741.1277814"},{"key":"1834_CR6","doi-asserted-by":"crossref","unstructured":"Arabnia HR, Oliver MA (1987) Arbitrary rotation of raster images with SIMD machine architectures. In: Computer Graphics Forum. Wiley Online Library","DOI":"10.1111\/j.1467-8659.1987.tb00340.x"},{"key":"1834_CR7","doi-asserted-by":"crossref","unstructured":"Golmohammadi K, Zaiane OR (2012) Data mining applications for fraud detection in securities market. In: Intelligence and Security Informatics Conference (EISIC), 2012 European","DOI":"10.1109\/EISIC.2012.51"},{"issue":"2","key":"1834_CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188\u2013192","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"1834_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1022804606389","volume":"25","author":"MA Wani","year":"2003","unstructured":"Wani MA (2003) Arabnia HR Parallel edge-region-based segmentation algorithm targeted at reconfigurable multiring network. J Supercomput 25(1):43\u201362","journal-title":"J Supercomput"},{"key":"1834_CR10","doi-asserted-by":"crossref","unstructured":"Arabnia HR (1995) A distributed stereocorrelation algorithm. In: Computer Communications and Networks, 1995. Proceedings., Fourth International Conference on. : IEEE","DOI":"10.1109\/ICCCN.1995.540163"},{"key":"1834_CR11","unstructured":"Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th Annual International High Performance Computing Conference"},{"key":"1834_CR12","doi-asserted-by":"crossref","unstructured":"Malewicz G et al (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. ACM, Indianapolis, Indiana, USA, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"1834_CR13","unstructured":"McCune RR, Weninger T, Madey G Thinking Like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing"},{"issue":"3","key":"1834_CR14","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1007\/s10586-015-0472-6","volume":"18","author":"O Batarfi","year":"2015","unstructured":"Batarfi O et al (2015) Large scale graph processing systems: survey and an experimental evaluation. Clust Comput 18(3):1189\u20131213","journal-title":"Clust Comput"},{"issue":"12","key":"1834_CR15","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.14778\/2732977.2732980","volume":"7","author":"M Han","year":"2014","unstructured":"Han M et al (2014) An experimental comparison of pregel-like graph processing systems. Proce VLDB Endow 7(12):1047\u20131058","journal-title":"Proce VLDB Endow"},{"issue":"17","key":"1834_CR16","doi-asserted-by":"crossref","first-page":"4954","DOI":"10.1002\/cpe.3482","volume":"27","author":"M Sagharichian","year":"2015","unstructured":"Sagharichian M, Naderi H, Haghjoo M (2015) ExPregel: a new computational model for large-scale graph processing. Concurr Comput Pract Exp 27(17):4954\u20134969","journal-title":"Concurr Comput Pract Exp"},{"issue":"3","key":"1834_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00130109","volume":"10","author":"HR Arabnia","year":"1996","unstructured":"Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243\u2013269","journal-title":"J Supercomput"},{"issue":"11","key":"1834_CR18","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/0167-8191(95)00032-9","volume":"21","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor\u2014theoretical properties and algorithms. Parallel Comput 21(11):1783\u20131805","journal-title":"Parallel Comput"},{"issue":"1","key":"1834_CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1006\/jpdc.1995.1011","volume":"24","author":"SM Bhandarkar","year":"1995","unstructured":"Bhandarkar SM, Arabnia HR (1995) The Hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24(1):107\u2013114","journal-title":"J Parallel Distrib Comput"},{"key":"1834_CR20","unstructured":"Gregor D, Lumsdaine A (2005) The parallel BGL: a generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC)"},{"key":"1834_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, Philadelphia, PA, USA, pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"key":"1834_CR22","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D (2010) Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement. ACM, Melbourne, Australia, pp 390\u2013403","DOI":"10.1145\/1879141.1879192"},{"key":"1834_CR23","doi-asserted-by":"crossref","unstructured":"Kang U, Tsourakakis CE, Faloutsos C (2009) Pegasus: a peta-scale graph mining system implementation and observations. In: Data Mining, 2009. ICDM\u201909. Ninth IEEE International Conference on.: IEEE","DOI":"10.1109\/ICDM.2009.14"},{"key":"1834_CR24","unstructured":"Kang U et al (2008) Hadi: fast diameter estimation and mining in massive graphs with hadoop. Carnegie Mellon University. School of Computer Science, Machine Learning Department"},{"key":"1834_CR25","doi-asserted-by":"crossref","unstructured":"Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. In: Computer graphics forum. Wiley Online Library","DOI":"10.1111\/j.1467-8659.1989.tb00448.x"},{"issue":"5","key":"1834_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/comjnl\/30.5.425","volume":"30","author":"HR Arabnia","year":"1987","unstructured":"Arabnia HR, Oliver MA (1987) A transputer network for the arbitrary rotation of digitised images. Comput J 30(5):425\u2013432","journal-title":"Comput J"},{"issue":"1","key":"1834_CR27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1834_CR28","doi-asserted-by":"crossref","unstructured":"Jain N, Liao G, Willke TL (2013) GraphBuilder: scalable graph ETL framework. In: First International Workshop on Graph Data Management Experiences and Systems. ACM, New York, pp 1\u20136","DOI":"10.1145\/2484425.2484429"},{"key":"1834_CR29","unstructured":"Rastogi V et al (2012) Finding connected components on map-reduce in logarithmic rounds. arXiv preprint arXiv:1203.5387"},{"issue":"1","key":"1834_CR30","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.future.2011.05.025","volume":"28","author":"SN Srirama","year":"2012","unstructured":"Srirama SN, Jakovits P, Vainikko E (2012) Adapting scientific computing problems to clouds using MapReduce. Future Gener Comput Syst 28(1):184\u2013192","journal-title":"Future Gener Comput Syst"},{"key":"1834_CR31","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2012) The trinity graph engine. Technical Report 161291, Microsoft Research","DOI":"10.1145\/2463676.2467799"},{"key":"1834_CR32","doi-asserted-by":"crossref","unstructured":"Chen R et al (2010) Large graph processing in the cloud. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM, Indianapolis, Indiana, USA, pp 1123\u20131126","DOI":"10.1145\/1807167.1807297"},{"key":"1834_CR33","unstructured":"Apache Giraph. Available from: http:\/\/giraph.apache.org\/"},{"key":"1834_CR34","unstructured":"Apache Hama. Available from: http:\/\/hama.apache.org\/"},{"key":"1834_CR35","doi-asserted-by":"crossref","unstructured":"Salihoglu S, Widom J (2012) Gps: a graph processing system","DOI":"10.1145\/2484838.2484843"},{"key":"1834_CR36","doi-asserted-by":"crossref","unstructured":"Cai Z, Logothetis D, Siganos G (2012) Facilitating real-time graph mining. In: Proceedings of the Fourth International Workshop on Cloud Data Management. ACM, Maui, Hawaii, USA, pp 1\u20138","DOI":"10.1145\/2390021.2390023"},{"key":"1834_CR37","unstructured":"Kalnis P et al (2012) Mizan: optimizing graph mining in large parallel systems"},{"key":"1834_CR38","doi-asserted-by":"crossref","unstructured":"Bao NT, Suzumura T (2013) Towards highly scalable pregel-based graph processing platform with $$\\times $$ \u00d7 10. In: Proceedings of the 22nd International Conference on World Wide Web Companion. International World Wide Web Conferences Steering Committee: Rio de Janeiro, Brazil, pp 501\u2013508","DOI":"10.1145\/2487788.2487984"},{"issue":"2","key":"1834_CR39","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2007183.2007185","volume":"45","author":"E Krepska","year":"2011","unstructured":"Krepska E et al (2011) HipG: parallel processing of large-scale graphs. SIGOPS Oper Syst Rev 45(2):3\u201313","journal-title":"SIGOPS Oper Syst Rev"},{"issue":"8","key":"1834_CR40","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y et al (2012) Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proc VLDB Endow 5(8):716\u2013727","journal-title":"Proc VLDB Endow"},{"key":"1834_CR41","unstructured":"Low Y et al (2011) Graphlab: a distributed framework for machine learning in the cloud. arXiv preprint arXiv:1107.0922"},{"key":"1834_CR42","doi-asserted-by":"crossref","unstructured":"Che S (2014) GasCL: a vertex-centric graph model for GPUs. In: IEEE High Performance Extreme Computing Conference (HPEC)","DOI":"10.1109\/HPEC.2014.7040962"},{"key":"1834_CR43","doi-asserted-by":"publisher","unstructured":"Che S, Beckmann BM, Reinhardt SK (2014) BelRed: constructing GPGPU graph applications with software building blocks In: High Performance Extreme Computing Conference (HPEC), 2014 IEEE, Waltham, MA, pp 1\u20136. doi: 10.1109\/HPEC.2014.7040961","DOI":"10.1109\/HPEC.2014.7040961"},{"key":"1834_CR44","unstructured":"Zhong J, He B (2013) Medusa: simplified graph processing on GPUs. IEEE Trans Parallel Distrib Syst 99:1\u20131"},{"key":"1834_CR45","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W (2013) X-Stream: edge-centric graph processing using streaming partitions, In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. ACM, Farminton, Pennsylvania, pp 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"key":"1834_CR46","doi-asserted-by":"crossref","unstructured":"Yuan P et al (2014) Fast iterative graph computation: a path centric approach. In: High Performance Computing, Networking, Storage and Analysis, SC14: International Conference for IEEE","DOI":"10.1109\/SC.2014.38"},{"issue":"14","key":"1834_CR47","doi-asserted-by":"crossref","first-page":"2014","DOI":"10.14778\/2556549.2556581","volume":"6","author":"W Xie","year":"2013","unstructured":"Xie W et al (2013) Fast iterative graph computation with block updates. Proc VLDB Endow 6(14):2014\u20132025","journal-title":"Proc VLDB Endow"},{"key":"1834_CR48","doi-asserted-by":"crossref","unstructured":"Yan D et al (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. Proc VLDB Endow 7(14)","DOI":"10.14778\/2733085.2733103"},{"key":"1834_CR49","doi-asserted-by":"crossref","unstructured":"Simmhan Y et al (2014) GoFFish: a sub-graph centric framework for large-scale graph analytics. In: Silva F, Dutra I, Santos\u00a0Costa V (eds) Euro-Par 2014 Parallel Processing. Springer International Publishing, pp 451\u2013462","DOI":"10.1007\/978-3-319-09873-9_38"},{"key":"1834_CR50","doi-asserted-by":"crossref","unstructured":"Chen R et al (2012) Improving large graph processing on partitioned graphs in the cloud. In: Proceedings of the Third ACM Symposium on Cloud Computing. ACM, San Jose, California, pp 1\u201313","DOI":"10.1145\/2391229.2391232"},{"key":"1834_CR51","doi-asserted-by":"crossref","unstructured":"Yang S et al (2012) Towards effective partition management for large graphs. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM, Scottsdale, Arizona, USA, pp 517\u2013528","DOI":"10.1145\/2213836.2213895"},{"key":"1834_CR52","doi-asserted-by":"crossref","unstructured":"Tian Y et al (2013) From \u201cThink Like a Vertex\u201d to \u201cThink Like a Graph\u201d. Proc VLDB Endow 7(3)","DOI":"10.14778\/2732232.2732238"},{"key":"1834_CR53","unstructured":"Wang G et al (2013) Asynchronous large-scale graph processing made easy. In: CIDR"},{"issue":"12","key":"1834_CR54","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.14778\/2732977.2732980","volume":"7","author":"M Han","year":"2014","unstructured":"Han M et al (2014) An experimental comparison of pregel-like graph processing systems. Proc VLDB Endow 7(12):1047\u20131058","journal-title":"Proc VLDB Endow"},{"key":"1834_CR55","unstructured":"Stanford Large Network Dataset Collection (2014) Available from: http:\/\/snap.stanford.edu\/data\/"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1834-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1834-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1834-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1834-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T18:24:37Z","timestamp":1692469477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1834-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,18]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1834"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1834-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,18]]}}}