%0 Journal Article %1 Hanika2022 %A Hanika, Tom %A Hirth, Johannes %D 2022 %J Annals of Mathematics and Artificial Intelligence %K 2022 bigdata bipartite cores fca itegpub k-cores kde kdepub myown publist %N 6 %P 537--567 %R 10.1007/s10472-022-09790-6 %T Knowledge cores in large formal contexts %U https://doi.org/10.1007/s10472-022-09790-6 %V 90 %X 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 k-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 k-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.

@article{Hanika2022, abstract = {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 k-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 k-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.}, added-at = {2022-04-28T15:11:13.000+0200}, author = {Hanika, Tom and Hirth, Johannes}, biburl = {https://www.bibsonomy.org/bibtex/20a621f4c0749385cfebf7b44efdf3a03/tomhanika}, day = 20, doi = {10.1007/s10472-022-09790-6}, interhash = {e916c95990333eb38c0d2cca30f44a97}, intrahash = {0a621f4c0749385cfebf7b44efdf3a03}, issn = {1573-7470}, journal = {Annals of Mathematics and Artificial Intelligence}, keywords = {2022 bigdata bipartite cores fca itegpub k-cores kde kdepub myown publist}, month = apr, number = 6, pages = {537--567}, timestamp = {2022-12-04T19:38:04.000+0100}, title = {Knowledge cores in large formal contexts}, url = {https://doi.org/10.1007/s10472-022-09790-6}, volume = 90, year = 2022 }