FCA in a Logical Programming Setting for Visualization-oriented Graph Compression

International audienceMolecular biology produces and accumulates huge amountsof data that are generally integrated within graphs of molecules linkedby various interactions. Exploring potentially interesting substructures(clusters, motifs) within such graphs requires proper abstraction andvisualization methods. Most layout techniques (edge and nodes spatialorganization) prove insufficient in this case. Royer et al. introduced in2008 Power graph analysis, a dedicated program using classes of nodeswith similar properties and classes of edges linking node classes to achievea lossless graph compression. The contributions of this paper are twofold.First, we formulate and study this issue in the framework of FormalConcept Analysis. This leads to a generalized view of the initial problemoffering new variants and solving approaches. Second, we state the FCAmodeling problem in a logical setting, Answer Set programming, whichprovides a great flexibility for the specification of concept search spaces

Workshop Notes of the Sixth International Workshop "What can FCA do for Artificial Intelligence?"

International audienc