Sciweavers

62 search results - page 5 / 13
» Induced trees in triangle-free graphs
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 7 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
NIPS
2001
13 years 8 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
13 years 11 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
13 years 11 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
ILP
2003
Springer
14 years 16 days ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba