{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T17:43:43Z","timestamp":1762105423748,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031678677"},{"type":"electronic","value":"9783031678684"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-67868-4_7","type":"book-chapter","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T21:03:07Z","timestamp":1722546187000},"page":"97-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["What is the\u00a0Intrinsic Dimension of\u00a0Your Binary Data?\u2014and\u00a0How to\u00a0Compute it Quickly"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-6374","authenticated-orcid":false,"given":"Tom","family":"Hanika","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7813-9799","authenticated-orcid":false,"given":"Tobias","family":"Hille","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"7_CR1","unstructured":"Andrews, S.: In-close, a fast algorithm for computing formal concepts (2009). https:\/\/ceur-ws.org\/Vol-483\/paper1.pdf"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bartl, E., Belohl\u00e1vek, R., Osicka, P., Rezankov\u00e1, H.: Dimensionality reduction in Boolean data: comparison of four BMF methods. In: Masulli, F., Petrosino, A., Rovetta, S. (eds.) Clustering High-Dimensional Data. LNCS, vol.\u00a07627, pp. 118\u2013133. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-662-48577-4_8","DOI":"10.1007\/978-3-662-48577-4_8"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/J.INS.2018.05.016","volume":"459","author":"R Belohl\u00e1vek","year":"2018","unstructured":"Belohl\u00e1vek, R., Outrata, J., Trnecka, M.: Toward quality assessment of Boolean matrix factorizations. Inf. Sci. 459, 71\u201385 (2018). https:\/\/doi.org\/10.1016\/J.INS.2018.05.016","journal-title":"Inf. Sci."},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/J.JCSS.2015.06.002","volume":"81","author":"R Belohl\u00e1vek","year":"2015","unstructured":"Belohl\u00e1vek, R., Trnecka, M.: From-below approximations in Boolean matrix factorization: geometry and new algorithm. J. Comput. Syst. Sci. 81(8), 1678\u20131697 (2015). https:\/\/doi.org\/10.1016\/J.JCSS.2015.06.002","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Buzmakov, A., Dudyrev, E., Kuznetsov, S.O., Makhalova, T., Napoli, A.: Data complexity: an FCA-based approach. Int. J. Approx. Reason. 165, 109084 (2024). https:\/\/doi.org\/10.1016\/J.IJAR.2023.109084","DOI":"10.1016\/J.IJAR.2023.109084"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Carter, K.M., Raich, R., Hero III, A.O.: On local intrinsic dimension estimation and its applications. IEEE Trans. Signal Process. 58(2), 650\u2013663 (2010). https:\/\/doi.org\/10.1109\/TSP.2009.2031722","DOI":"10.1109\/TSP.2009.2031722"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001). https:\/\/doi.org\/10.1145\/502807.502808","journal-title":"ACM Comput. Surv."},{"key":"7_CR8","volume-title":"Fractal Geometry: Mathematical Foundations and Applications","author":"K Falconer","year":"1990","unstructured":"Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. Wiley, Chicester (1990)"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Ganter, B.: Diskrete Mathematik: Geordnete Mengen. Springer-Lehrbuch, 1st edn., Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-37500-2","DOI":"10.1007\/978-3-642-37500-2"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-59830-2","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.2748\/tmj.20201015a","volume":"74","author":"T Hanika","year":"2022","unstructured":"Hanika, T., Schneider, F.M., Stumme, G.: Intrinsic dimension of geometric data sets. Tohoku Math. J. 74(1), 23\u201352 (2022). https:\/\/doi.org\/10.2748\/tmj.20201015a","journal-title":"Tohoku Math. J."},{"key":"7_CR12","unstructured":"Inria Centre at Rennes University: Scikit-mine: a Python module for pattern mining (2022). v0.0.9, 2022-12-30. https:\/\/scikit-mine.github.io\/scikit-mine\/"},{"key":"7_CR13","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel recursive algorithm for FCA. In: Belohlavek, R., Kuznetsov, S.O. (eds.) Proceedings of CLA 2008, CEUR WS, vol.\u00a0433, pp. 71\u201382. CEUR-WS.org (2008)"},{"key":"7_CR14","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CBO. In: Kryszkiewicz, M., Obiedkov, S. (eds.) Proceedings of CLA 2010. CEUR WS, vol.\u00a0672, pp. 325\u2013337. CEUR-WS.org (2010)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Krajca","year":"2010","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel algorithm for computing fixpoints of Galois connections. AMAI 59, 257\u2013272 (2010). https:\/\/doi.org\/10.1007\/s10472-010-9199-5","journal-title":"AMAI"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Kuznetsov, S.O., Gromov, V.A., Borodin, N.S., Divavin, A.M.: Formal concept analysis for evaluating intrinsic dimension of a natural language. In: Maji, P., Huang, T., Pal, N.R., Chaudhury, S., De, R.K. (eds.) PReMI. LNCS, vol. 14301, pp. 331\u2013339. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-45170-6_34","DOI":"10.1007\/978-3-031-45170-6_34"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10994-005-5316-9","volume":"62","author":"T Li","year":"2006","unstructured":"Li, T.: A unified view on clustering binary data. Mach. Learn. 62, 199\u2013215 (2006)","journal-title":"Mach. Learn."},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Liu, C.W., Wang, W.C.: A comparison of methods for dimensionality assessment of categorical item responses. In: Zhang, Q. (eds.) Pacific Rim Objective Measurement Symposium (PROMS) 2015 Conference Proceedings, pp. 395\u2013410. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-981-10-1687-5_26","DOI":"10.1007\/978-981-10-1687-5_26"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J Outrata","year":"2012","unstructured":"Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf. Sci. 185(1), 114\u2013127 (2012). https:\/\/doi.org\/10.1016\/j.ins.2011.09.023","journal-title":"Inf. Sci."},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Pestov, V.: Intrinsic dimension of a dataset: what properties does one expect? In: IJCNN, pp. 2959\u20132964 (2007). https:\/\/doi.org\/10.1109\/IJCNN.2007.4371431","DOI":"10.1109\/IJCNN.2007.4371431"},{"issue":"2\u20133","key":"7_CR21","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.neunet.2007.12.030","volume":"21","author":"V Pestov","year":"2008","unstructured":"Pestov, V.: An axiomatic approach to intrinsic dimension of a dataset. Neural Netw. 21(2\u20133), 204\u2013213 (2008). https:\/\/doi.org\/10.1016\/j.neunet.2007.12.030","journal-title":"Neural Netw."},{"key":"7_CR22","unstructured":"Stubbemann, M., Hanika, T., Schneider, F.M.: Intrinsic dimension for large-scale geometric learning. Trans. Mach. Learn. Res. 2023 (2023). https:\/\/openreview.net\/forum?id=85BfDdYMBY"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowl. Eng. 42(2), 189\u2013222 (2002). https:\/\/doi.org\/10.1016\/S0169-023X(02)00057-5","journal-title":"Data Knowl. Eng."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Sutton, O.J., Zhou, Q., Gorban, A.N., Tyukin, I.Y.: Relative intrinsic dimensionality is intrinsic to learning. CoRR (2023). https:\/\/doi.org\/10.48550\/ARXIV.2311.07579","DOI":"10.48550\/ARXIV.2311.07579"},{"key":"7_CR25","unstructured":"Tatti, N.: Distances between data sets based on summary statistics. J. Mach. Learn. Res. 8(1), 131\u2013154 (2007)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Tatti, N., Mielikainen, T., Gionis, A., Mannila, H.: What is the dimension of your binary data? In: ICDM, pp. 603\u2013612. IEEE (2006)","DOI":"10.1109\/ICDM.2006.167"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Trnecka, M., Trneckova, M.: Data reduction for Boolean matrix factorization algorithms based on formal concept analysis. Knowl. Based Syst. 158, 75\u201380 (2018). https:\/\/doi.org\/10.1016\/J.KNOSYS.2018.05.035","DOI":"10.1016\/J.KNOSYS.2018.05.035"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Workshop on Frequent Itemset Mining Implementations (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining, pp. 447\u2013457 (2022). https:\/\/doi.org\/10.1137\/1.9781611972726.27","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Conceptual Knowledge Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67868-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:03:44Z","timestamp":1723417424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67868-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031678677","9783031678684"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67868-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CONCEPTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Conceptual Knowledge Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"C\u00e1diz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/concepts2024.uca.es","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}