{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:51:25Z","timestamp":1743015085846,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442360"},{"type":"electronic","value":"9783031442377"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44237-7_12","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T22:01:45Z","timestamp":1695160905000},"page":"120-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Median Computation for\u00a0Consensus Learning: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Xiaoyi","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Nienk\u00f6tter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"12\u201314","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.tcs.2010.12.009","volume":"412","author":"M Bader","year":"2011","unstructured":"Bader, M.: The transposition median problem is NP-complete. Theoret. Comput. Sci. 412(12\u201314), 1099\u20131110 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-014-0586-7","volume":"164","author":"A Beck","year":"2015","unstructured":"Beck, A., Sabach, S.: Weiszfeld\u2019s method: old and new results. J. Optim. Theory Appl. 164(1), 1\u201340 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2018.01.003","volume":"28","author":"T Boongoen","year":"2018","unstructured":"Boongoen, T., Iam-On, N.: Cluster ensembles: a survey of approaches with recent extensions and applications. Comput. Sci. Rev. 28, 1\u201325 (2018)","journal-title":"Comput. Sci. Rev."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-22351-8_5","volume-title":"Scientific and Statistical Database Management","author":"S Cohen-Boulakia","year":"2011","unstructured":"Cohen-Boulakia, S., Denise, A., Hamel, S.: Using medians to generate consensus rankings for biological data. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 73\u201390. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22351-8_5"},{"issue":"11","key":"12_CR5","doi-asserted-by":"publisher","first-page":"3904","DOI":"10.1109\/TPAMI.2020.2992392","volume":"43","author":"R Chakraborty","year":"2021","unstructured":"Chakraborty, R., et al.: Intrinsic Grassmann averages for online linear, robust and nonlinear subspace learning. IEEE-TPAMI 43(11), 3904\u20133917 (2021)","journal-title":"IEEE-TPAMI"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TPAMI.2020.3003846","volume":"44","author":"R Chakraborty","year":"2022","unstructured":"Chakraborty, R., et al.: ManifoldNet: a deep neural network for manifold-valued data with applications. IEEE-TPAMI 44(2), 799\u2013810 (2022)","journal-title":"IEEE-TPAMI"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Mukhopadhyay, A.: Clustering ensemble: a multiobjective genetic algorithm based approach. In: Proceedings of International Conference on Computational Intelligence: Modeling, Techniques and Applications, pp. 443\u2013449 (2013)","DOI":"10.1016\/j.protcy.2013.12.381"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.patcog.2009.10.013","volume":"43","author":"M Ferrer","year":"2010","unstructured":"Ferrer, M., et al.: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recogn. 43(4), 1642\u20131655 (2010)","journal-title":"Pattern Recogn."},{"issue":"7","key":"12_CR9","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.cviu.2010.12.010","volume":"115","author":"M Ferrer","year":"2011","unstructured":"Ferrer, M., et al.: A generic framework for median graph computation based on a recursive embedding approach. Comput. Vis. Image Underst. 115(7), 919\u2013928 (2011)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"S143","DOI":"10.1016\/j.neuroimage.2008.10.052","volume":"45","author":"PT Fletcher","year":"2009","unstructured":"Fletcher, P.T., et al.: The geometric median on Riemannian manifolds with application to robust atlas estimation. Neuroimage 45(1), S143\u2013S152 (2009)","journal-title":"Neuroimage"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-34166-3_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"L Franek","year":"2012","unstructured":"Franek, L., Jiang, X.: Evolutionary weighted mean based framework for generalized median computation with application to strings. In: Gimel\u2019farb, G., et al. (eds.) SSPR \/SPR 2012. LNCS, vol. 7626, pp. 70\u201378. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34166-3_8"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","volume":"27","author":"ALN Fred","year":"2005","unstructured":"Fred, A.L.N., Jain, A.K.: Combining multiple clusterings using evidence accumulation. IEEE-TPAMI 27(6), 835\u2013850 (2005)","journal-title":"IEEE-TPAMI"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis, A., et al.: Clustering aggregation. ACM Trans. Knowl. Discov. Data 1(1), 4 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Goder, A., Filkov, V.: Consensus clustering algorithms: comparison and refinement. In: Proceedings of 10th Workshop on Algorithm Engineering and Experiments, pp. 109\u2013117 (2008)","DOI":"10.1137\/1.9781611972887.11"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11263-012-0601-0","volume":"103","author":"R Hartley","year":"2013","unstructured":"Hartley, R., et al.: Rotation averaging. Int. J. Comput. Vision 103(3), 267\u2013305 (2013)","journal-title":"Int. J. Comput. Vision"},{"key":"12_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-54717-6_7","volume-title":"Biomedical Engineering Systems and Technologies","author":"M Hayashida","year":"2017","unstructured":"Hayashida, M., Koyano, H.: Finding median and center strings for a probability distribution on a set of strings under Levenshtein distance based on integer linear programming. In: Fred, A., Gamboa, H. (eds.) BIOSTEC 2016. CCIS, vol. 690, pp. 108\u2013121. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54717-6_7"},{"issue":"1\u20132","key":"12_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C de la Higuera","year":"2000","unstructured":"de la Higuera, C., Casacuberta, F.: Topology of strings: median string is np-complete. Theoret. Comput. Sci. 230(1\u20132), 39\u201348 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSP.2010.939747","volume":"28","author":"P Honeine","year":"2011","unstructured":"Honeine, P., Richard, C.: Preimage problem in kernel-based machine learning. IEEE Signal Process. Mag. 28(2), 77\u201388 (2011)","journal-title":"IEEE Signal Process. Mag."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-70659-3_14","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"X Jiang","year":"2002","unstructured":"Jiang, X., Bunke, H.: Optimal lower bound for generalized median problems in metric space. In: Caelli, T., Amin, A., Duin, R.P.W., de Ridder, D., Kamel, M. (eds.) SSPR \/SPR 2002. LNCS, vol. 2396, pp. 143\u2013151. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-70659-3_14"},{"issue":"10","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X Jiang","year":"2001","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: On median graphs: properties, algorithms, and applications. IEEE-TPAMI 23(10), 1144\u20131151 (2001)","journal-title":"IEEE-TPAMI"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/BFb0033318","volume-title":"Advances in Pattern Recognition","author":"A Juan","year":"1998","unstructured":"Juan, A., Vidal, E.: Fast median search in metric spaces. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds.) SSPR \/SPR 1998. LNCS, vol. 1451, pp. 905\u2013912. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0033318"},{"issue":"9","key":"12_CR22","first-page":"2489","volume":"47","author":"L Khelifi","year":"2017","unstructured":"Khelifi, L., Mignotte, M.: A novel fusion approach based on the global consistency criterion to fusing multiple segmentations. IEEE Trans. Syst. Man Cybern. Syst. 47(9), 2489\u20132502 (2017)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M Kriv\u00e1nek","year":"1986","unstructured":"Kriv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform. 23(3), 311\u2013323 (1986)","journal-title":"Acta Inform."},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/1025045","volume":"25","author":"JB Kruskal","year":"1983","unstructured":"Kruskal, J.B.: An overview of sequence comparison: time warps, string edits, and macromolecules. SIAM Rev. 25(2), 201\u2013237 (1983)","journal-title":"SIAM Rev."},{"issue":"2","key":"12_CR25","first-page":"331","volume":"14","author":"F Kruzslicz","year":"1999","unstructured":"Kruzslicz, F.: Improved greedy algorithm for computing approximate median strings. Acta Cybern. 14(2), 331\u2013339 (1999)","journal-title":"Acta Cybern."},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1006\/cviu.1996.0502","volume":"67","author":"DP Lopresti","year":"1997","unstructured":"Lopresti, D.P., Zhou, J.: Using consensus sequence voting to correct OCR errors. Comput. Vis. Image Underst. 67(1), 39\u201347 (1997)","journal-title":"Comput. Vis. Image Underst."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Ma, T., et al.: Ensembling low precision models for binary biomedical image segmentation. In: IEEE Winter Conference on Applications of Computer Vision, pp. 325\u2013334 (2021)","DOI":"10.1109\/WACV48630.2021.00037"},{"issue":"4","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.2514\/1.28949","volume":"30","author":"FL Markley","year":"2007","unstructured":"Markley, F.L., et al.: Averaging quaternions. J. Guid. Control. Dyn. 30(4), 1193\u20131197 (2007)","journal-title":"J. Guid. Control. Dyn."},{"key":"12_CR29","volume-title":"Robust Statistics: Theory and Methods (with R)","author":"RA Maronna","year":"2019","unstructured":"Maronna, R.A., et al.: Robust Statistics: Theory and Methods (with R), 2nd edn. Wiley, Hoboken (2019)","edition":"2"},{"issue":"21","key":"12_CR30","doi-asserted-by":"publisher","first-page":"4635","DOI":"10.3390\/s19214635","volume":"19","author":"DG M\u00e1rquez","year":"2019","unstructured":"M\u00e1rquez, D.G., F\u00e9lix, P., Garc\u00eda, C.A., Tejedor, J., Fred, A.L.N., Otero, A.: Positive and negative evidence accumulation clustering for sensor fusion: an application to heartbeat clustering. Sensors 19(21), 4635 (2019)","journal-title":"Sensors"},{"issue":"10","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0167-8655(01)00062-9","volume":"22","author":"L Mic\u00f3","year":"2001","unstructured":"Mic\u00f3, L., Oncina, J.: An approximate median search algorithm in non-metric spaces. Pattern Recogn. Lett. 22(10), 1145\u20131151 (2001)","journal-title":"Pattern Recogn. Lett."},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.patrec.2019.02.004","volume":"120","author":"P Mirabal","year":"2019","unstructured":"Mirabal, P., et al.: Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string. Pattern Recogn. Lett. 120, 104\u2013111 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Distance-preserving vector space embedding for the closest string problem. In: Proceedings of 23rd ICPR, pp. 1530\u20131535 (2016)","DOI":"10.1109\/ICPR.2016.7899854"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Consensus learning for sequence data. In: Data Mining in Time Series and Streaming Databases, pp. 69\u201391. World Scientific (2018)","DOI":"10.1142\/9789813228047_0004"},{"issue":"2","key":"12_CR35","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TSMC.2019.2896657","volume":"51","author":"A Nienk\u00f6tter","year":"2021","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Distance-preserving vector space embedding for consensus learning. IEEE Trans. Syst. Man Cybern. Syst 51(2), 1244\u20131257 (2021)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst"},{"issue":"5","key":"12_CR36","first-page":"5872","volume":"45","author":"A Nienk\u00f6tter","year":"2023","unstructured":"Nienk\u00f6tter, A., Jiang, X.: Kernel-based generalized median computation for consensus learning. IEEE-TPAMI 45(5), 5872\u20135888 (2023)","journal-title":"IEEE-TPAMI"},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.asoc.2017.01.035","volume":"55","author":"JV de Oliveira","year":"2017","unstructured":"de Oliveira, J.V., et al.: Particle swarm clustering in clustering ensembles: exploiting pruning and alignment free consensus. Appl. Soft Comput. 55, 141\u2013153 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"12_CR38","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.patcog.2010.09.013","volume":"44","author":"F Petitjean","year":"2011","unstructured":"Petitjean, F., et al.: A global averaging method for dynamic time warping, with applications to clustering. Pattern Recogn. 44(3), 678\u2013693 (2011)","journal-title":"Pattern Recogn."},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"P\u00f3sfai, M., et al.: Consensus ranking for multi-objective interventions in multiplex networks. N. J. Phys. 21, 055001 (2019)","DOI":"10.1088\/1367-2630\/ab14b3"},{"issue":"3","key":"12_CR40","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/TPAMI.2017.2692779","volume":"40","author":"M Storath","year":"2018","unstructured":"Storath, M., Weinmann, A.: Fast median filtering for phase or orientation data. IEEE-TPAMI 40(3), 639\u2013652 (2018)","journal-title":"IEEE-TPAMI"},{"issue":"12","key":"12_CR41","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"AP Topchy","year":"2005","unstructured":"Topchy, A.P., et al.: Clustering ensembles: models of consensus and weak partitions. IEEE-TPAMI 27(12), 1866\u20131881 (2005)","journal-title":"IEEE-TPAMI"},{"issue":"8","key":"12_CR42","doi-asserted-by":"publisher","first-page":"2593","DOI":"10.1109\/TBME.2022.3150952","volume":"69","author":"P Tu","year":"2022","unstructured":"Tu, P., et al.: Ultrasound image guided and mixed reality-based surgical system with real-time soft tissue deformation computing for robotic cervical pedicle screw placement. IEEE Trans. Biomed. Eng. 69(8), 2593\u20132603 (2022)","journal-title":"IEEE Trans. Biomed. Eng."},{"issue":"8","key":"12_CR43","doi-asserted-by":"publisher","first-page":"2712","DOI":"10.1016\/j.patcog.2010.03.001","volume":"43","author":"S Vega-Pons","year":"2010","unstructured":"Vega-Pons, S., et al.: Weighted partition consensus via kernels. Pattern Recogn. 43(8), 2712\u20132724 (2010)","journal-title":"Pattern Recogn."},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.jvcir.2018.07.009","volume":"55","author":"S Wazarkar","year":"2018","unstructured":"Wazarkar, S., Keshavamurthy, B.N.: A survey on image data analysis through clustering techniques for real world applications. J. Vis. Commun. Image Represent. 55, 596\u2013626 (2018)","journal-title":"J. Vis. Commun. Image Represent."},{"issue":"3","key":"12_CR45","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/TMI.2013.2239654","volume":"32","author":"Y Xie","year":"2013","unstructured":"Xie, Y., et al.: Multiple atlas construction from a heterogeneous brain MR image collection. IEEE Trans. Med. Imaging 32(3), 628\u2013635 (2013)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"8","key":"12_CR46","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1007\/s00521-016-2819-1","volume":"30","author":"L Yin","year":"2018","unstructured":"Yin, L., Liu, Y.: Ensemble biclustering gene expression data based on the spectral clustering. Neural Comput. Appl. 30(8), 2403\u20132416 (2018)","journal-title":"Neural Comput. Appl."},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, M.: Weighted clustering ensemble: a review. Pattern Recogn. 124, 108428 (2022)","DOI":"10.1016\/j.patcog.2021.108428"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44237-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T22:10:10Z","timestamp":1695161410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44237-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442360","9783031442377"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44237-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Analysis of Images and Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/caip2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/www.easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.09","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}