Sciweavers

1923 search results - page 134 / 385
» Weighted Decision Trees
Sort
View
CADE
2008
Springer
16 years 6 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
ICML
2003
IEEE
16 years 7 months ago
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Yuu Yamada, Einoshin Suzuki, Hideto Yokoi, Katsuhi...
IKE
2003
15 years 7 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
IJCV
2007
115views more  IJCV 2007»
15 years 6 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
FOCS
2008
IEEE
16 years 24 days ago
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
Yefim Dinitz, Michael Elkin, Shay Solomon