Rina Dechter, Judea Pearl  Home/Search
Context Related
| uci.edu/~csp/R22.ps Cached: 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.
PS.gz PS Image Update HelpFrom: uci.edu/~dechter/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents several investigations into the prospects for identifying meaningful structures in empirical data, namely, structures permitting effective organization of the data to meet requirements of future queries. We propose a general framework whereby the notion of identifiability is given a precise formal definition similar to that of learnability. Using this framework, we then explore if a tractable procedure exists for deciding whether a given relation is decomposable into... (Update)
Cited by: More
Consistency Techniques for Linear Arithmetic and Functional.. - Zhang (1998) (Correct)
Compiling Relational Data into Disjunctive Structure.. - Dechter, Schwalb (1994) (Correct)
Abduction and the Dualization Problem - Eiter, Makino (2003) (Correct)
Active bibliography (related documents): More All
0.8: Uncovering Trees in Constraint Networks - Dechter, Meiri, Pearl (1996) (Correct)
0.5: Horn Approximations of Empirical Data - Kautz, Kearns, Selman (1995) (Correct)
0.5: Constraint Networks - Dechter (1992) (Correct)
Similar documents based on text: More All
0.4: Compiling Relational Data into Disjunctive Structure.. - Dechter, Schwalb (1994) (Correct)
0.3: Identifying Independencies in Causal Graphs with Feedback - Pearl, Dechter (1996) (Correct)
0.2: Directional Resolution: The Davis-Putnam Procedure, Revisited - Dechter, Rish (1994) (Correct)
Related documents from co-citation: More All
27: Horn approximations of empirical data - Kautz, Kearns et al. - 1995
25: Knowledge compilation using Horn approximations - Selman, Kautz - 1991
21: Reasoning with characteristic models - Kautz, Kearns et al. - 1993
BibTeX entry: (Update)
Dechter, R. & Pearl, J., "Structure identification in relational data", Artificial Intelligence 58 (1992) pp. 237--270. http://citeseer.ist.psu.edu/dechter97structure.html More
@article{ dechter92structure,
author = "Rina Dechter and Judea Pearl",
title = "Structure Identification in Relational Data",
journal = "Artificial Intelligence",
volume = "58",
number = "1-3",
pages = "237-270",
year = "1992",
url = "citeseer.ist.psu.edu/dechter97structure.html" }
Citations (may not include all citations):1543 Probabilistic Reasoning in Intelligent Systems: Networks of .. (context) - Pearl - 1988
1359 Induction of decision trees (context) - Quinlan - 1986
534 The complexity of theorem-proving procedures (context) - Cook - 1971
493 Communications of the ACM (context) - Valiant, of et al. - 1984
441 Queries and concept learning (context) - Angluin - 1988
267 Network-based heuristics for constraintsatisfaction problems (context) - Dechter, Pearl - 1987
208 Approximating discrete probability distributions with depend.. (context) - Chow, Liu - 1968
200 The Theory of Relational Databases (context) - Maier - 1983
191 Linear time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
104 A theory of inferred causation - Pearl, Verma - 1991
97 Knowledge compilation using Horn approximation - Selman, Kautz - 1991
87 Multilevel logic synthesis (context) - Brayton, Hachtel et al. - 1990
84 the desirability of acyclic database schemes (context) - Beeri, Fagin et al.
84 Learning conjunctions of Horn Clauses - Angluin, Frazier et al. - 1990
49 Horn Approximations of Empirical Data - Kautz, Kearns et al.
32 Discovering Causal Structure (context) - Glymour, Scheines et al. - 1987
29 Encyclopedia of Artificial Intelligence (context) - Dechter, networks - 1992
25 On learning Boolean functions (context) - Natarajan - 1987
21 Tree-clustering schemes for constraint- processing (context) - Dechter, Pearl - 1989
18 Decomposing a relation into a tree of binary relations (context) - Dechter - 1990
18 Latent structure analysis (context) - Lazarsfeld - 1966
9 Tree decomposition with applications to constraint processin.. (context) - Meiri, Dechter et al. - 1990
5 Fundamental properties of networks of constraints: A new for.. (context) - Montanarri, Rossi - 1988
4 personal communication (context) - Ullman - 1991
2 The complexity of finding all solutions (context) - Dechter, Itai - 1991
2 structured constraint satisfaction problems (context) - Freuder, k- - 1990
2 fundamental properties and applications to picture processin.. (context) - Montanari, constraints - 1974
2 Tractability through theory approximation (context) - Selman, Kautz - 1992
2 Learnability and the Vapnik-Chervonekis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
1 Efficient algorithms for combinatorial graphs with bounded d.. (context) - Arnborg - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001) (Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001) (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