John L. Pfaltz  Home/Search
Context Related
| virginia.edu/~jlp/gtvm.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: virginia.edu/~j...losure.overview (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we take a more limited view and simply regard R as an observation of a set of attributes A associated with a set of objects O. In our formulation, objects are denoted by numbered rows and attributes denoted by lettered columns. "Formal Concept Analysis" [5] has been developed by Rudolf Wille [15], Bernard Ganter and their colleagues at Darmstadt. In their approach the construction and visual display of concept lattices, that is partially ordered sets of concepts, is crucial. The... (Update)
Context of citations to this paper: More
.... data sets have shown (a) that updates are local , in the sense that they are confined to a relatively small portion of the lattice [25, 28]; b) that the number of closed concepts is typically one to two orders of magnitude fewer than frequent sets [39] c) that extraction...
.... de nitions are given later on) from the data and then constructing implications on the basis of the generators of the closed sets [7], 8] 9] corresponds exactly to that most common form of Knowledge Compilation. Indeed, we formally prove that the logical formulas...
Cited by: More
Discrete Deterministic Data Mining as Knowledge Compilation - Balcázar, Baixeries (2003) (Correct)
Current State of Data Mining - Drewry, Gu, Hocking, Kang, Schutt.. (2002) (Correct)
Active bibliography (related documents): More All
0.7: Closure Spaces in the Plane - Pfaltz (1999) (Correct)
0.3: Closed Set Mining of Biological Data - John Pfaltz Univ (2002) (Correct)
0.3: Process Representation in Temporal Concept Analysis - Wolff (Correct)
Similar documents based on text: More All
0.4: A Scalable DBMS for Large Scientific Simulations - Pfaltz, Orlandic (1999) (Correct)
0.2: Obtaining and Maintaining Polynomial-Sized Concept Lattices - Berry, Sigayret (2002) (Correct)
0.1: Declarative Composition of Stack Frames - Christian Lindig And (Correct)
BibTeX entry: (Update)
John L. Pfaltz. Transformations of Concept Graphs: An Approach to Empirical Induction . In 2nd International Workshop on Graph Transformation and Visual Modeling Techniques, pages 320--326, Crete, Greece, July 2001. http://citeseer.ist.psu.edu/pfaltz01transformations.html More
@inproceedings{ pfaltzpfaltztransformations,
author = "John L. Pfaltz",
title = "Transformations of Concept Graphs: An Approach to Empirical Induction",
pages = "320--326",
url = "citeseer.ist.psu.edu/pfaltz01transformations.html" }
Citations (may not include all citations):152 Restructuring lattice theory: An approach based on hierarchi.. (context) - Wille - 1982
129 Formal Concept Analysis - Mathematical Foundations (context) - Ganter, Wille - 1999
47 Relational Methods in Computer Science - Brink, Kahl et al. - 1997
45 Assessing Modular Structure of Legacy Code Based on Mathemat.. (context) - Lindig, Snelting - 1997
43 Reengineering Class Hierarchies Using Concept Analysis - Snelting, Tip - 1998
18 Meet-Distributive Lattices and the Anti-exchange Closure (context) - Edelman - 1980
11 Algebra and Discrete Methods (context) - Farber, Jamison et al. - 1986
10 Discrete Mathematics (context) - Pfaltz - 1996
5 Closure Systems and their Structure - Pfaltz, Jamison - 2000
3 and Systems (context) - Wolff, States - 1999
2 Transformations of Antimatroid Closure Spaces - Pfaltz, Karro - 1998
1 Actually is not quite a lattice homomorphism (context) - Edelman, Jamison et al. - 1985
1 The Effects of Uncertainity on Plan Success in a Simulated M.. (context) - Gunderson, Martin - 2000
1 Closure Spaces that are not Uniquely Generated - Jamison, Pfaltz - 2000
1 Closure Spaces and Knowledge Discovery (context) - Pfaltz - 2001
1 Deletion Transformations in Antimatroid Closure Spaces (context) - Pfaltz - 1998
Documents on the same site (http://www.cs.virginia.edu/~jlp/closure.overview.html): More
Distance in Anti-Matroids - Pfaltz, Karro, McCulloch (1997) (Correct)
Evaluating the binary partition function when N=2 n - Pfaltz (1995) (Correct)
Partition Coefficients of Acyclic Graphs - Pfaltz (1995) (Correct)
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