Sciweavers

493 search results - page 18 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
CVPR
2000
IEEE
14 years 1 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
CIDM
2009
IEEE
14 years 21 days ago
Gender identification from E-mails
In this paper, we investigate the topic of gender identification for short length, multi-genre, content-free e-mails. We introduce for the first time (to our knowledge), psycholing...
Na Cheng, Xiaoling Chen, R. Chandramouli, K. P. Su...
CONCUR
2006
Springer
13 years 10 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
ECML
2007
Springer
14 years 2 months ago
Clustering Trees with Instance Level Constraints
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
Jan Struyf, Saso Dzeroski
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 10 months 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