A. Berry and A. Sigayret. Representing a concept lattice by a graph. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11-13 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Maintaining Class Membership Information - Berry, Sigayret (2002) Self-citation (Berry Sigayret) (Correct)
No context found.
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11-13 2002.
Concept Lattices and Undirected Graphs - Berry (2004) Self-citation (Berry) (Correct)
No context found.
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Proceedings of DM&DM'02 (Discrete Maths and Data Mining Workshop), 2nd SIAM Conference on Data Mining (Arlington, VA, April 2002); to appear in Discrete Applied Mathematics. 21
Graph Extremities and Minimal Separation - Berry (2003) Self-citation (Berry) (Correct)
No context found.
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Proceedings Workshop on Discrete Mathematics and Data Mining, Second SIAM Conference on Data Mining, 2002.
Concepts Can't Afford to Stammer - Berry, Bordat, Sigayret Self-citation (Berry Sigayret) (Correct)
No context found.
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Proceedings of Discrete Maths and Data Mining Workshop, 2nd SIAM Conference on Data Mining (SDM'02), Arlington (VA), April 2002, submitted to Discrete Applied Mathematics.
Weaving through a Crowd of Minimal Separators - Berry (2003) Self-citation (Berry) (Correct)
No context found.
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Proceedings Workshop on Discrete Mathematics and Data Mining (DM&DM 2002), Arlington (VA), April 11-13, 200, 2nd SIAM Conf. on Data Mining, 2002, 2002.
Obtaining and Maintaining Polynomial-Sized Concept Lattices - Berry, Sigayret (2002) Self-citation (Berry Sigayret) (Correct)
....chordal graphs, a family of graphs which is a direct generalization of trees, has recently given rise to a consistent body of research, with many new results for a variety of graph classes, and even in the general case for arbitrary graphs. In a recent contribution in the Data Mining area (see [7]) we introduce a new encoding for a given binary relation, by using a graph constructed on the complement of the relation. We show that there is a one to one correspondence between the concepts defined by the relation and the minimal separators defined by this underlying graph. LIMOS UMR CNRS ....
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Workshop on Discrete Mathematics for Data Mining, Proc. 2nd SIAM Workshop on Data Mining, Arlington (VA), April 11--13, 2002.
Efficient Concept Generation - Berry, Bordat, Sigayret Self-citation (Berry Sigayret) (Correct)
....of bytes, as a concept lattice, though it may be exponentially large, is of small height (O(n) Moreover, the fashion in which we compute the cover of each concept is di erent. Our approach is based on our experience on graphs. In [7] Bordat used a bipartite graph to handle the relation. In [4], Berry and Sigayret proposed a di erent encoding into a co bipartite graph for which they established a one to one correspondence between the concepts of the lattice and the minimal separators of the graph. This is algorithmically interesting because, in the past decade, much research has been ....
.... interesting because, in the past decade, much research has been done on using minimal separators to eciently solve various graph problems such as chordal embedding ( 19] 2] and in particular several papers deal with the ecient enumeration of minimal separators ( 14] 21] 20] 3] [4] pointed out that, using the underlying co bipartite graph and these recent results on the emerging theory of minimal separation, the current best algorithms for generating concepts could easily be matched both in terms of time and space. In this paper, we use graph properties to improve these. ....
[Article contains additional citation context not shown here]
A. Berry and A. Sigayret. Representing a concept lattice by a graph. Proceedings of Discrete Maths and Data Mining Workshop, 2nd SIAM Conference on Data Mining (SDM'02), Arlington (VA), April 2002, submitted to Discrete Applied Mathematics.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC