论文信息 - Approximate Seriation Problem in Formal Context Analysis

Approximate Seriation Problem in Formal Context Analysis

In this paper we present a method (linear in the size of the formal context) to solve the seriation problem for formal contexts. We show that any maximal solution can be represented by a PQ-Tree. Moreover, the set of PQ-Trees can be seen as a distributive lattice. This lattice yields a consensus method which deals with the multiple solutions.

François Brucker | Pascal Préa | P. Préa | François Brucker

[1] S. Benzer. The fine structure of the gene. , 1962, Scientific American.

[2] L. Boneva. Seriation with applications in philology , 1980 .

[3] Gianmarco Alberti. Making Sense of Contingency Tables in Archaeology: the Aid of Correspondence Analysis to Intra-Site Activity Areas Research , 2013, Journal of Data Science.

[4] Gilles Caraux,et al. PermutMatrix: a graphical environment to arrange gene expression profiles in optimal linear order , 2005, Bioinform..

[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[6] Joydeep Ghosh,et al. Relationship-Based Clustering and Visualization for High-Dimensional Data Mining , 2003, INFORMS J. Comput..

[7] Prabhakar Raghavan,et al. Sparse matrix reordering schemes for browsing hypertext , 1996 .

[8] David Halperin. Musical chronology by seriation , 1994, Comput. Humanit..

[9] Chun-Houh Chen,et al. Matrix Visualization and Information Mining , 2004 .

[10] W. M. Flinders Petrie,et al. Sequences in Prehistoric Remains , 1899 .