Sciweavers

Share
SFP
2001
8 years 11 months ago
Infinite Pretty-printing in eXene
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
Allen Stoughton
NETWORKING
2004
8 years 11 months ago
A Case for Mesh-Tree-Interaction in End System Multicasting
Abstract. End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree firs...
Anirban Chakrabarti, Govindarasu Manimaran
ESANN
2006
8 years 11 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
AAAI
2006
8 years 11 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
SBBD
2007
126views Database» more  SBBD 2007»
8 years 11 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
9 years 5 days ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
PRICAI
2000
Springer
9 years 1 months ago
The Lumberjack Algorithm for Learning Linked Decision Forests
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
William T. B. Uther, Manuela M. Veloso
JOBIM
2000
9 years 1 months ago
Can We Have Confidence in a Tree Representation?
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
Alain Guénoche, Henri Garreta
ALT
2003
Springer
9 years 1 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
DAWAK
2006
Springer
9 years 1 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
books