{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:23:44Z","timestamp":1762341824758,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012687","name":"Universit\u00e4t Kassel","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012687","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Knowledge computation tasks, such as computing a base of valid implications, are often infeasible for large data sets. This is in particular true when deriving canonical bases in formal concept analysis (FCA). Therefore, it is necessary to find techniques that on the one hand reduce the data set size, but on the other hand preserve enough structure to extract useful knowledge. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and (maybe) interesting patterns. An essentially different approach is used in network science, called <jats:italic>k<\/jats:italic>-cores. These cores are able to reflect rare patterns, as long as they are well connected within the data set. In this work, we study <jats:italic>k<\/jats:italic>-cores in the realm of FCA by exploiting the natural correspondence of bi-partite graphs and formal contexts. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts.<\/jats:p>","DOI":"10.1007\/s10472-022-09790-6","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T11:06:24Z","timestamp":1650452784000},"page":"537-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Knowledge cores in large formal contexts"],"prefix":"10.1007","volume":"90","author":[{"given":"Tom","family":"Hanika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9034-0321","authenticated-orcid":false,"given":"Johannes","family":"Hirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"9790_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Batagelj, V., Fu, X., Hong, S.H., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: S.H. Hong, K.L. Ma (eds.) APVIS, pp. 17\u201324. IEEE Computer Society. http:\/\/dblp.uni-trier.de\/db\/conf\/apvis\/apvis2007.html#AhmedBFHMM07 (2007)","DOI":"10.1109\/APVIS.2007.329304"},{"key":"9790_CR2","unstructured":"Andrews, S., Orphanides, C.: Analysis of large data sets using formal concept lattices. In: M. Kryszkiewicz, S.A. Obiedkov (eds.) CLA, vol. 672, pp. 104\u2013115. CEUR-WS.org. http:\/\/dblp.uni-trier.de\/db\/conf\/cla\/cla2010.html#AndrewsO10 (2010)"},{"issue":"3","key":"9790_CR3","doi-asserted-by":"publisher","first-page":"2696","DOI":"10.1016\/j.eswa.2009.09.026","volume":"37","author":"C Aswanikumar","year":"2010","unstructured":"Aswanikumar, C., Srinivas, S.: Concept lattice reduction using fuzzy k-means clustering. Expert Syst. Appl. 37 (3), 2696\u20132704 (2010). http:\/\/dblp.uni-trier.de\/db\/journals\/eswa\/eswa37.html#AswanikumarS10","journal-title":"Expert Syst. Appl."},{"key":"9790_CR4","unstructured":"Borchmann, D., Hanika, T.: Some experimental results on randomly generating formal contexts. In: M. Huchard, S. Kuznetsov (eds.) CLA, CEUR Workshop Proceedings, vol. 1624, pp. 57\u201369. CEUR-WS.org. http:\/\/dblp.uni-trier.de\/db\/conf\/cla\/cla2016.html#BorchmannH16 (2016)"},{"key":"9790_CR5","unstructured":"Codocedo, V., Taramasco, C., Astudillo, H.: Cheating to achieve formal concept analysis over a large formal context. In: A. Napoli, V. Vychodil (eds.) CLA, vol. 959, pp. 349\u2013362. CEUR-WS.org. http:\/\/dblp.uni-trier.de\/db\/conf\/cla\/cla2011.html#CodocedoTA11 (2011)"},{"key":"9790_CR6","unstructured":"Degens, P., Hermes, H., Opitz, O. (eds.): Implikationen Und Abh\u00e4ngigkeiten Zwischen Merkmalen. Studien Zur Klassifikation. Indeks, Frankfurt (1986)"},{"issue":"6","key":"9790_CR7","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.dam.2010.12.004","volume":"159","author":"F Distel","year":"2011","unstructured":"Distel, F., Sertkaya, B.: On the complexity of enumerating pseudo-intents. Discrete Applied Mathematics 159(6), 450\u2013466 (2011). http:\/\/dblp.uni-trier.de\/db\/journals\/dam\/dam159.html#DistelS11","journal-title":"Discrete Applied Mathematics"},{"key":"9790_CR8","doi-asserted-by":"publisher","unstructured":"Doerfel, S., J\u00e4schke, R.: An analysis of tag-recommender evaluation procedures. In: In: Q. Yang, I. King, Q. Li, P. Pu, G. Karypis (eds.) RecSys \u201913, pp. 343\u2013346. ACM. https:\/\/doi.org\/10.1145\/2507157.2507222 (2013)","DOI":"10.1145\/2507157.2507222"},{"key":"9790_CR9","unstructured":"Dua, D., Graff, C.: UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml (2017)"},{"key":"9790_CR10","doi-asserted-by":"crossref","unstructured":"Fischer, J., Vreeken, J.: Sets of robust rules, and how to find them. In: ECML\/PKDD. https:\/\/ecmlpkdd2019.org\/downloads\/paper\/650.pdf (2019)","DOI":"10.1007\/978-3-030-46150-8_3"},{"key":"9790_CR11","doi-asserted-by":"publisher","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. In: L. Kwuida, B. Sertkaya (eds.) Formal Concept Analysis, LNCS, vol. 5986, pp. 312\u2013340. Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-11928-6\u2216_22 (2010)","DOI":"10.1007\/978-3-642-11928-6\u2216_22"},{"key":"9790_CR12","unstructured":"Ganter, B., Wille, R.: Implikationen Und Abhangigkeiten\u0308 Zwischen Merkmalen. In: Degens, P. O., Hermes, H. J. Opitz, O.(eds.) Die Klassifikation Und Ihr Umfeld, pp. 171-185. Indeks, Frankfurt (1986)"},{"key":"9790_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, Berlin (1999)"},{"issue":"1","key":"9790_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1097\/00007435-199701000-00009","volume":"24","author":"AC Ghani","year":"1997","unstructured":"Ghani, A. C., Swinton, J., Garnett, G.P.: The role of sexual partnership networks in the epidemiology of gonorrhea. Sexually transmitted diseases 24(1), 45\u201356 (1997)","journal-title":"Sexually transmitted diseases"},{"key":"9790_CR15","first-page":"5","volume":"95","author":"JL Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines 95, 5\u201318 (1986). http:\/\/eudml.org\/doc\/94331","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"9790_CR16","unstructured":"Hanika, T., Hirth, J.: Conexp-clj - a research tool for FCA. In: D. Cristea, F.L. Ber, R. Missaoui, L. Kwuida, B. Sertkaya (eds.) ICFCA (Supplements), vol. 2378, pp. 70\u201375. CEUR-WS.org. http:\/\/dblp.uni-trier.de\/db\/conf\/icfca\/icfca2019suppl.html#HanikaH19 (2019)"},{"key":"9790_CR17","doi-asserted-by":"publisher","unstructured":"Hanika, T., Koyda, M., Stumme, G.: Relevant attributes in formal contexts. In: D. Endres, M. Alam, D. Sotropa (eds.) ICCS, LNCS, vol. 11530, pp. 102\u2013116. Springer. https:\/\/doi.org\/10.1007\/978-3-030-23182-8_8 (2019)","DOI":"10.1007\/978-3-030-23182-8_8"},{"key":"9790_CR18","doi-asserted-by":"publisher","unstructured":"Hanika, T., Marx, M., Stumme, G.: Discovering implicational knowledge in wikidata. In: D. Cristea, F.L. Ber, B. Sertkaya (eds.) Formal Concept Analysis - 15th International Conference, ICFCA 2019, Proceedings, LNCS, vol. 11511, pp. 315\u2013323. Springer. https:\/\/doi.org\/10.1007\/978-3-030-21462-3_21 (2019)","DOI":"10.1007\/978-3-030-21462-3_21"},{"key":"9790_CR19","doi-asserted-by":"crossref","unstructured":"Healy, J., Janssen, J.C.M., Milios, E.E., Aiello, W.: Characterization of graphs using degree cores. In: W. Aiello, A.Z. Broder, J.C.M. Janssen, E.E. Milios (eds.) WAW, LNCS, vol. 4936, pp. 137\u2013148. Springer. http:\/\/dblp.uni-trier.de\/db\/conf\/waw\/waw2006.html#HealyJMA06 (2006)","DOI":"10.1007\/978-3-540-78808-9_13"},{"issue":"11","key":"9790_CR20","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nature Physics 6(11), 888\u2013893 (2010). https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nature Physics"},{"issue":"8","key":"9790_CR21","first-page":"927","volume":"10","author":"S Kuznetsov","year":"2004","unstructured":"Kuznetsov, S.: On the intractability of computing the Duquenne-Guigues base. Journal of Universal Computer Science 10(8), 927\u2013933 (2004)","journal-title":"Journal of Universal Computer Science"},{"key":"9790_CR22","doi-asserted-by":"publisher","unstructured":"Kuznetsov, S.O., Obiedkov, S.A., Roth, C.: Reducing the representation complexity of lattice-based taxonomies. In: U. Priss, S. Polovina, R. Hill (eds.) Conceptual Structures: Knowledge Architectures for Smart Applications, 15th International Conference on Conceptual Structures, ICCS 2007, Sheffield, UK, July 22-27, 2007, Proceedings, Lecture Notes in Computer Science, vol. 4604, pp. 241\u2013254. Springer. https:\/\/doi.org\/10.1007\/978-3-540-73681-3_18 (2007)","DOI":"10.1007\/978-3-540-73681-3_18"},{"key":"9790_CR23","volume-title":"Gew\u00fcrze : Das Standardwerk","author":"M Mahn","year":"2014","unstructured":"Mahn, M.: Gew\u00fcrze : Das Standardwerk. Christian Verlag GmbH, M\u00fcnchen (2014)"},{"issue":"3","key":"9790_CR24","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983). http:\/\/dblp.uni-trier.de\/db\/journals\/jacm\/jacm30.html#MatulaB83","journal-title":"J. ACM"},{"issue":"3","key":"9790_CR25","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1103\/RevModPhys.87.925","volume":"87","author":"R Pastor-Satorras","year":"2015","unstructured":"Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A.: Epidemic processes in complex networks. Reviews of Modern Physics 87 (3), 925\u2013979 (2015). https:\/\/doi.org\/10.1103\/RevModPhys.87.925","journal-title":"Reviews of Modern Physics"},{"issue":"2","key":"9790_CR26","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0129054108005735","volume":"19","author":"C Roth","year":"2008","unstructured":"Roth, C., Obiedkov, S.A., Kourie, D.G.: On succinct representation of knowledge community taxonomies with formal concept analysis. Int. J. Found. Comput. Sci. 19(2), 383\u2013404 (2008). http:\/\/dblp.uni-trier.de\/db\/journals\/ijfcs\/ijfcs19.html#RothOK08","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"9790_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Networks 5(3), 269\u2013287 (1983)","journal-title":"Soc. Networks"},{"key":"9790_CR28","doi-asserted-by":"publisher","unstructured":"Soldano, H., Santini, G., Bouthinon, D., Bary, S., Lazega, E.: Bi-pattern mining of two mode and directed networks. In: P. Champin, F.L. Gandon, M. Lalmas, P.G. Ipeirotis (eds.) WWW Companion, pp. 1287\u20131294. ACM. https:\/\/doi.org\/10.1145\/3184558.3191568 (2018)","DOI":"10.1145\/3184558.3191568"},{"key":"9790_CR29","doi-asserted-by":"crossref","unstructured":"Stumme, G.: Efficient Data Mining Based on Formal Concept Analysis DEXA, LNCS, vol. 2453, pp. 534\u2013546. Springer (2002)","DOI":"10.1007\/3-540-46146-9_53"},{"issue":"2","key":"9790_CR30","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 & Knowledge Engineering 42(2), 189\u2013222 (2002). https:\/\/doi.org\/10.1016\/S0169-023X(02)00057-5. http:\/\/portal.acm.org\/citation.cfm?id=606457","journal-title":"Data & Knowledge Engineering"},{"issue":"3","key":"9790_CR31","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/2656261","volume":"39","author":"N Tatti","year":"2014","unstructured":"Tatti, N., Moerchen, F., Calders, T.: Finding robust itemsets under subsampling. ACM Trans. Database Syst. 39(3), 20:1\u201320:27 (2014). https:\/\/doi.org\/10.1145\/2656261","journal-title":"ACM Trans. Database Syst."},{"key":"9790_CR32","doi-asserted-by":"publisher","unstructured":"Valtchev, P., Duquenne, V.: On the merge of factor canonical bases. In: R. Medina, S.A. Obiedkov (eds.) ICFCA, LNCS, vol. 4933, pp. 182\u2013198. Springer. https:\/\/doi.org\/10.1007\/978-3-540-78137-0_14 (2008)","DOI":"10.1007\/978-3-540-78137-0_14"},{"key":"9790_CR33","doi-asserted-by":"crossref","unstructured":"Wille, R.: Ordered Sets: Proc. of the NATO Adv. Study Institute Held at Banff, Canada, August 28 to September 12, 1981, Chap. Restructuring Lattice Theory1 An Approach Based on Hierarchies of Concepts, pp. 445\u2013470. Springer, Dordrecht (1982)","DOI":"10.1007\/978-94-009-7798-3_15"},{"issue":"4","key":"9790_CR34","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462\u2013478 (2005). https:\/\/doi.org\/10.1109\/TKDE.2005.60","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09790-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-022-09790-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09790-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T09:13:58Z","timestamp":1655802838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-022-09790-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,20]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9790"],"URL":"https:\/\/doi.org\/10.1007\/s10472-022-09790-6","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2022,4,20]]},"assertion":[{"value":"24 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflicts of interests\/Competing interests"}}]}}