{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:30:38Z","timestamp":1743046238534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031151675"},{"type":"electronic","value":"9783031151682"}],"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-15168-2_15","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:10Z","timestamp":1661756770000},"page":"179-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Pareto-Optimal Solutions in\u00a0the\u00a0Multimodal Clustering Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-6006","authenticated-orcid":false,"given":"Mikhail","family":"Bogatyrev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Orlov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatyana","family":"Shestaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"9","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/JPROC.2015.2460697","volume":"103","author":"D Lahat","year":"2015","unstructured":"Lahat, D., Adal\u0131, D., Jutten, C.: Multimodal data fusion: an overview of methods, challenges and prospects. Proc. IEEE Inst. Electric. Electron. Eng. Multim. Data Fusion 103(9), 1449\u20131477 (2015)","journal-title":"Proc. IEEE Inst. Electric. Electron. Eng. Multim. Data Fusion"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.12691\/acis-3-1-3","volume":"3","author":"L Wang","year":"2017","unstructured":"Wang, L.: Heterogeneous data and big data analytics. Autom. Control Inf. Sci. 3(1), 8\u201315 (2017). https:\/\/doi.org\/10.12691\/acis-3-1-3","journal-title":"Autom. Control Inf. Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Ganter, B., Stumme, G., Wille, R. (eds.): Formal concept analysis. LNCS (LNAI), vol. 3626. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31881-1","DOI":"10.1007\/978-3-540-31881-1"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet N-ary relations. ACM Trans. Knowl. Discov. Data. 3(1), 36 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1080\/03081079.2013.798899","volume":"42","author":"DI Ignatov","year":"2013","unstructured":"Ignatov, D.I., Kuznetsov, S.O., Zhukov, L.E., Poelmans, J.: Can triconcepts become triclusters? Int. J. Gen. Syst. 42, 6 (2013)","journal-title":"Int. J. Gen. Syst."},{"key":"15_CR6","unstructured":"Gnatyshak, D.V., Ignatov, D.I., Kuznetsov, S.O.: From triadic FCA to triclustering: experimental comparison of some triclustering algorithms. In: Proceedings of the Tenth International Conference on Concept Lattices and Their Applications (CLA 2013), pp. 249\u2013260. Laboratory L3i, University of La Rochelle, La Rochelle (2013)"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G Voutsadakis","year":"2002","unstructured":"Voutsadakis, G.: Polyadic concept analysis. Order 19(3), 295\u2013304 (2002)","journal-title":"Order"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Ignatov, D.I., Gnatyshak, D.V., Kuznetsov, S.O., Mirkin, B.G.: Triadic formal concept analysis and triclustering: searching for optimal patterns. Mach. Learn. 101, 271\u2013302 (2015) https:\/\/doi.org\/10.1007\/s10994-015-5487-y","DOI":"10.1007\/s10994-015-5487-y"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Mirkin, B.G., Kramarenko, A.V.: Approximate bicluster and tricluster boxes in the analysis of binary data. In: Kuznetsov, S.O., \u015al\u0119zak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS (LNAI), vol. 6743, pp. 248\u2013256. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21881-1_40","DOI":"10.1007\/978-3-642-21881-1_40"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TSMCC.2008.2007252","volume":"39","author":"E Hruschka","year":"2009","unstructured":"Hruschka, E., Campello, R., Freitas, A., de Carballo, A.: A survey of evolutionary algorithms for clustering. IEEE Trans. Evolution. Comput. 39, 133\u2013155 (2009). https:\/\/doi.org\/10.1109\/TSMCC.2008.2007252","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"15_CR11","unstructured":"Simon, D.: Evolutionary optimization algorithms. In: Biologically-Inspired and Population-Based Approaches to Computer Intelligence, 1st edn. Wiley, Hoboken (2013)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.3390\/a14040122","volume":"14","author":"F Valdez","year":"2021","unstructured":"Valdez, F., Castillo, O., Melin, P.: Bio-inspired algorithms and its applications for optimization in fuzzy clustering. Algorithms 14, 122 (2021)","journal-title":"Algorithms"},{"key":"15_CR13","unstructured":"Cole, R.M.: Clustering with genetic algorithms, MSc Thesis, University of Western Australia, Australia (1998)"},{"key":"15_CR14","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley, London (2001)"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TEVC.2013.2290082","volume":"18","author":"A Mukhopadhyay","year":"2014","unstructured":"Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.: Survey of multiobjective evolutionary algorithms for data mining: part II. IEEE Trans. Evolution. Comput. 18(1), 20\u201335 (2014)","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.ress.2005.11.018","volume":"91","author":"A Abdullah Konaka","year":"2006","unstructured":"Abdullah Konaka, A., Coitb, D., Smith, A.: Multi-objective optimization using genetic algorithms: a tutorial. Reliab. Eng. Syst. Safety 91, 992\u20131007 (2006)","journal-title":"Reliab. Eng. Syst. Safety"},{"key":"15_CR17","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"AP Deb","year":"2002","unstructured":"Deb, A.P., Agrawal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolution. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"15_CR19","unstructured":"Myocardial Infarction Complications Data Set. http:\/\/archive.ics.uci.edu\/ml\/machine-learning-databases\/00579\/"},{"key":"15_CR20","unstructured":"Juvenile Triadic Data Set. http:\/\/fca-tools-bundle.com\/view-context\/60b92250ef71886d7336e49e"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15168-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:08:23Z","timestamp":1661756903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15168-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031151675","9783031151682"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15168-2_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","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":"20","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":"5","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":"17% - 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":"2.79","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":"Out of the 118 submission, 26 were rejected before being sent to peer review.","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)"}}]}}