Sciweavers

4095 search results - page 18 / 819
» How to test a tree
Sort
View
ECML
2005
Springer
15 years 3 months ago
Simple Test Strategies for Cost-Sensitive Decision Trees
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
Shengli Sheng, Charles X. Ling, Qiang Yang
CLA
2007
14 years 11 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
ICASSP
2008
IEEE
15 years 4 months ago
Separation of overlapping RFID signals by antenna arrays
— Radio Frequency Identi cation (RFID) is a technology to wirelessly transmit the identity of tagged objects. For long-range (UHF) systems with multiple tags, the tag replies may...
Asli F. Mindikoglu, Alle-Jan van der Veen
ICML
2003
IEEE
15 years 10 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...
ICML
2008
IEEE
15 years 10 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul