{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:40:50Z","timestamp":1780357250979,"version":"3.54.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031112164","type":"print"},{"value":"9783031112171","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-11217-1_3","type":"book-chapter","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T21:02:35Z","timestamp":1657918955000},"page":"34-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Pattern Mining: Current Challenges and\u00a0Opportunities"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mourad","family":"Nouioua","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hai","family":"Duong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,16]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1186\/s12911-018-0633-7","volume":"18","author":"R Abeysinghe","year":"2018","unstructured":"Abeysinghe, R., Cui, L.: Query-constraint-based mining of association rules for exploratory analysis of clinical datasets in the national sleep research resource. BMC Med. Inform. Decis. Making 18(2), 58 (2018)","journal-title":"BMC Med. Inform. Decis. Making"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.: The state-of-the-art of set visualization. In: Computer Graphics Forum, vol. 35, pp. 234\u2013260. Wiley Online Library (2016)","DOI":"10.1111\/cgf.12722"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/sam.11322","volume":"9","author":"M Bhuiyan","year":"2016","unstructured":"Bhuiyan, M., Hasan, M.A.: Interactive knowledge discovery from hidden data through sampling of frequent patterns. Statist. Anal. Data Mining ASA Data Sci. J. 9(4), 205\u2013229 (2016)","journal-title":"Statist. Anal. Data Mining ASA Data Sci. J."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M., Mukhopadhyay, S., Hasan, M.A.: Interactive pattern mining on hidden data: a sampling-based solution. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 95\u2013104 (2012)","DOI":"10.1145\/2396761.2396777"},{"issue":"10","key":"3_CR5","first-page":"12","volume":"45","author":"C Chand","year":"2012","unstructured":"Chand, C., Thakkar, A., Ganatra, A.: Target oriented sequential pattern mining using recency and monetary constraints. Int. J. Comput. App. 45(10), 12\u201318 (2012)","journal-title":"Int. J. Comput. App."},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen, M.S., Park, J.S., Yu, P.S.: Efficient data mining for path traversal patterns. IEEE Trans. Knowl. Data Eng. 10(2), 209\u2013221 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0957-4174(03)00073-3","volume":"25","author":"DA Chiang","year":"2003","unstructured":"Chiang, D.A., Wang, Y.F., Lee, S.L., Lin, C.J.: Goal-oriented sequential pattern for network banking churn analysis. Expert Syst. App. 25(3), 293\u2013302 (2003)","journal-title":"Expert Syst. App."},{"issue":"4","key":"3_CR8","first-page":"113","volume":"2","author":"HE Chueh","year":"2010","unstructured":"Chueh, H.E., et al.: Mining target-oriented sequential patterns with time-intervals. Int. J. Comput. Sci. Inf. Technol. 2(4), 113\u2013123 (2010)","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.08.043","volume":"420","author":"Y Djenouri","year":"2017","unstructured":"Djenouri, Y., Comuzzi, M.: Combining apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem. Inf. Sci 420, 1\u201315 (2017)","journal-title":"Inf. Sci"},{"issue":"12","key":"3_CR10","doi-asserted-by":"publisher","first-page":"4775","DOI":"10.1007\/s10489-018-1245-8","volume":"48","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Djenouri, D., Belhadi, A., Fournier-Viger, P., Lin, J.C.-W.: A new framework for metaheuristic-based frequent itemset mining. Appl. Intell. 48(12), 4775\u20134791 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1245-8","journal-title":"Appl. Intell."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Dzyuba, V., Leeuwen, M.v., Nijssen, S., De Raedt, L.: Interactive learning of pattern rankings. Int. J. Artif. Intell. Tools 23(06), 1460026 (2014)","DOI":"10.1142\/S0218213014600264"},{"key":"3_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.005","volume":"182","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Cheng, C., Cheng, Z., Lin, J.C., Selmaoui-Folcher, N.: Mining significant trend sequences in dynamic attributed graphs. Knowl. Based Syst. 182, 104797 (2019)","journal-title":"Knowl. Based Syst."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., et al.: A survey of pattern mining in dynamic graphs. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 10(6), e1372 (2020)","DOI":"10.1002\/widm.1372"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-53917-6_9","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2013","unstructured":"Fournier-Viger, P., Mwamikazi, E., Gueniche, T., Faghihi, U.: MEIT: memory efficient itemset tree for targeted association rule mining. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013. LNCS (LNAI), vol. 8347, pp. 95\u2013106. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-53917-6_9"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2021","unstructured":"Gan, W., et al.: A survey of utility-oriented pattern mining. IEEE Trans. Knowl. Data Eng. 33(4), 1306\u20131327 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","volume":"513","author":"W Gan","year":"2020","unstructured":"Gan, W., et al.: ProUM: projection-based utility mining on sequence data. Inf. Sci. 513, 222\u2013240 (2020)","journal-title":"Inf. Sci."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Jentner, W., Keim, D.A.: Visualization and visual analytic techniques for patterns. In: High-Utility Pattern Mining, pp. 303\u2013337 (2019)","DOI":"10.1007\/978-3-030-04921-8_12"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28, 75\u2013105 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J-L Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Lee, Y.J., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 417\u2013424. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24571-1_38"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TKDE.2003.1245290","volume":"15","author":"M Kubat","year":"2003","unstructured":"Kubat, M., Hafez, A., Raghavan, V.V., Lekkala, J.R., Chen, W.K.: Itemset trees for targeted association querying. IEEE Trans. Knowl. Data Eng. 15(6), 1522\u20131534 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam, H.T., Morchen, F., Fradkin, D., Calders, T.: Mining compressing sequential patterns. Statist. Anal. Data Mining ASA Data Sci. J. 7(1), 34\u201352 (2014)","journal-title":"Statist. Anal. Data Mining ASA Data Sci. J."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"140122","DOI":"10.1109\/ACCESS.2020.3012817","volume":"8","author":"X Li","year":"2020","unstructured":"Li, X., Li, J., Fournier-Viger, P., Nawaz, M.S., Yao, J., Lin, J.C.W.: Mining productive itemsets in dynamic databases. IEEE Access 8, 140122\u2013140144 (2020)","journal-title":"IEEE Access"},{"issue":"5","key":"3_CR23","doi-asserted-by":"publisher","first-page":"9498","DOI":"10.1016\/j.eswa.2008.03.014","volume":"36","author":"CW Lin","year":"2009","unstructured":"Lin, C.W., Hong, T.P., Lu, W.H.: The pre-FUFP algorithm for incremental mining. Expert Syst. App. 36(5), 9498\u20139505 (2009)","journal-title":"Expert Syst. App."},{"issue":"17","key":"3_CR24","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JCW Lin","year":"2017","unstructured":"Lin, J.C.W., Yang, L., Fournier-Viger, P., Hong, T.P., Voznak, M.: A binary PSO approach to mine high-utility itemsets. Soft Comput. 21(17), 5103\u20135121 (2017)","journal-title":"Soft Comput."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364 (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Miao, J., Wan, S., Gan, W., Sun, J., Chen, J.: TargetUM: targeted high-utility itemset querying. arXiv preprint arXiv:2111.00309 (2021)","DOI":"10.1109\/BigData52589.2021.9671720"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.ins.2018.04.013","volume":"507","author":"F Min","year":"2020","unstructured":"Min, F., Zhang, Z.H., Zhai, W.J., Shen, R.P.: Frequent pattern discovery with tri-partition alphabets. Inf. Sci. 507, 715\u2013732 (2020)","journal-title":"Inf. Sci."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-030-79457-6_7","volume-title":"Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices","author":"O Ouarem","year":"2021","unstructured":"Ouarem, O., Nouioua, F., Fournier-Viger, P.: Mining episode rules from event sequences under non-overlapping frequency. In: Fujita, H., Selamat, A., Lin, J.C.-W., Ali, M. (eds.) IEA\/AIE 2021. LNCS (LNAI), vol. 12798, pp. 73\u201385. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79457-6_7"},{"key":"3_CR29","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-61133-0_2","volume-title":"Software Foundations for Data Interoperability and Large Scale Graph Data Analytics","author":"W Qu","year":"2020","unstructured":"Qu, W., Yan, D., Guo, G., Wang, X., Zou, L., Zhou, Y.: Parallel mining of frequent subtree patterns. In: Qin, L., et al. (eds.) SFDI\/LSGDA -2020. CCIS, vol. 1281, pp. 18\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61133-0_2"},{"key":"3_CR30","unstructured":"Shabtay, L., Yaari, R., Dattner, I.: A guided FP-growth algorithm for multitude-targeted mining of big data. arXiv preprint arXiv:1803.06632 (2018)"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jcss.2013.03.005","volume":"80","author":"P Shelokar","year":"2014","unstructured":"Shelokar, P., Quirin, A., Cord\u00f3n, O.: Three-objective subgraph mining using multiobjective evolutionary programming. Comput. Syst. Sci 80(1), 16\u201326 (2014)","journal-title":"Comput. Syst. Sci"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2014.03.074","volume":"278","author":"SJ Shin","year":"2014","unstructured":"Shin, S.J., Lee, D.S., Lee, W.S.: CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. Inf. Sci. 278, 559\u2013576 (2014)","journal-title":"Inf. Sci."},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-93040-4_1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W Song","year":"2018","unstructured":"Song, W., Huang, C.: Discovering high utility itemsets based on the artificial bee colony algorithm. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 3\u201314. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_1"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"19568","DOI":"10.1109\/ACCESS.2018.2819162","volume":"6","author":"W Song","year":"2018","unstructured":"Song, W., Huang, C.: Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6, 19568\u201319582 (2018)","journal-title":"IEEE Access"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Song, W., Zheng, C., Huang, C., Liu, L.: Heuristically mining the top-k high-utility itemsets with cross-entropy optimization. Appl. Intell. 1\u201316 (2021). https:\/\/doi.org\/10.1007\/s10489-021-02576-z","DOI":"10.1007\/s10489-021-02576-z"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ins.2019.11.018","volume":"515","author":"T Truong","year":"2020","unstructured":"Truong, T., Duong, H., Le, B., Fournier-Viger, P.: EHAUSM: an efficient algorithm for high average utility sequence mining. Inf. Sci. 515, 302\u2013323 (2020)","journal-title":"Inf. Sci."},{"key":"3_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.018","volume":"183","author":"T Truong","year":"2019","unstructured":"Truong, T., Duong, H., Le, B., Fournier-Viger, P., Yun, U.: Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl. Based Syst. 183, 104847 (2019)","journal-title":"Knowl. Based Syst."},{"key":"3_CR38","first-page":"1","volume":"52","author":"T Truong","year":"2021","unstructured":"Truong, T., Duong, H., Le, B., Fournier-Viger, P., Yun, U.: Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. Appl. Intell. 52, 1\u201323 (2021)","journal-title":"Appl. Intell."},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Wu, Y., Shen, C., Jiang, H., Wu, X.: Strict pattern matching under non-overlapping condition. Sci. China Inf. Sci. 50(1), 012101 (2017)","DOI":"10.1007\/s11432-015-0935-3"},{"issue":"10","key":"3_CR40","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","volume":"48","author":"Y Wu","year":"2018","unstructured":"Wu, Y., Tong, Y., Zhu, X., Wu, X.: NOSEP: nonoverlapping sequence pattern mining with gap constraints. IEEE Trans. Cybern. 48(10), 2809\u20132822 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Wu, Y., Wang, Y., Li, Y., Zhu, X., Wu, X.: Self-adaptive nonoverlapping contrast sequential pattern mining. IEEE Trans. Cybern. (2021)","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.knosys.2016.10.011","volume":"115","author":"F Xie","year":"2017","unstructured":"Xie, F., Wu, X., Zhu, X.: Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowl. Based Syst. 115, 27\u201339 (2017)","journal-title":"Knowl. Based Syst."},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 482\u2013486. SIAM (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"3_CR44","unstructured":"Zhang, C., Du, Z., Dai, Q., Gan, W., Weng, J., Yu, P.S.: TUSQ: targeted high-utility sequence querying. arXiv preprint arXiv:2103.16615 (2021)"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.asoc.2017.09.033","volume":"62","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Fu, G., Cheng, F., Qiu, J., Su, Y.: A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl. Soft Comput. 62, 974\u2013986 (2018)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications. DASFAA 2022 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-11217-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:08:55Z","timestamp":1710259735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-11217-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031112164","9783031112171"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-11217-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","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":"72","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":"76","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":"13% - 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":"3","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}