Sciweavers

507 search results - page 38 / 102
» Sizes of Ordered Decision Trees
Sort
View
PAA
2002
13 years 7 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 8 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
IPPS
1998
IEEE
14 years 4 days ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
CIDM
2009
IEEE
13 years 11 months ago
Clustering-based activity classification with a wrist-worn accelerometer using basic features
Abstract-- Automatic recognition of activities using time series data collected from exercise can facilitate development of applications that motivate people to exercise more frequ...
Pekka Siirtola, Perttu Laurinen, Eija Haapalainen,...
AAAI
2006
13 years 9 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos