2382 search results - page 64 / 477 » Generating Seeded Trees from Data Sets |
131
click to vote
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
131
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
169
click to vote
COCOON
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
168
click to vote
MCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
147
click to vote
LACL
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...