Sciweavers

1275 search results - page 135 / 255
» Chunking with Decision Trees
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 11 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
IDA
2007
Springer
15 years 5 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
IEAAIE
2004
Springer
15 years 4 months ago
Data Mining Approach for Analyzing Call Center Performance
Abstract. The aim of our research was to apply well-known data mining techniques (such as linear neural networks, multi-layered perceptrons, probabilistic neural networks, classifi...
Marcin Paprzycki, Ajith Abraham, Ruiyuan Guo, Srin...
82
Voted
VCIP
2003
184views Communications» more  VCIP 2003»
15 years 12 days ago
On the detection of pornographic digital images
The paper addresses the problem of distinguishing between pornographic and non-pornographic photographs, for the design of semantic filters for the web. Both, decision forests of ...
Raimondo Schettini, Carla Brambilla, Claudio Cusan...
FUIN
2007
86views more  FUIN 2007»
14 years 11 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska