Sciweavers

1248 search results - page 83 / 250
» Decision Tree Grafting
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
15 years 11 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
EMNLP
2007
15 years 5 months ago
A Comparative Evaluation of Deep and Shallow Approaches to the Automatic Detection of Common Grammatical Errors
This paper compares a deep and a shallow processing approach to the problem of classifying a sentence as grammatically wellformed or ill-formed. The deep processing approach uses ...
Joachim Wagner, Jennifer Foster, Josef van Genabit...
IWCIA
2004
Springer
15 years 9 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 9 months ago
Simplifying XML schema: single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
Wouter Gelade, Tomasz Idziaszek, Wim Martens, Fran...
AAAI
2006
15 years 5 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...