Sciweavers

321 search results - page 59 / 65
» Modeling liaison in French by using decision trees
Sort
View
IFIP12
2008
13 years 8 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
CLIMA
2004
13 years 8 months ago
Learning in BDI Multi-agent Systems
Abstract. This paper deals with the issue of learning in multi-agent systems (MAS). Particularly, we are interested in BDI (Belief, Desire, Intention) agents. Despite the relevance...
Alejandro Guerra-Hernández, Amal El Fallah-...
INFOCOM
2010
IEEE
13 years 5 months ago
Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks
—In-network aggregation has become a promising technique for improving the energy efficiency of wireless sensor networks. Aggregating data at various nodes in the network result...
Changhee Joo, Jin-Ghoo Choi, Ness B. Shroff
ESANN
2006
13 years 8 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite