1976 search results - page 234 / 396 » Predictive Graph Mining |
PAKDD
2004
ACM
14 years 3 months ago
2004
ACM
Abstract. In this paper we upgrade linear logistic regression and boosting to multi-instance data, where each example consists of a labeled bag of instances. This is done by connec...
ICDM
2003
IEEE
14 years 3 months ago
2003
IEEE
We propose and evaluate a family of methods for converting classifier learning algorithms and classification theory into cost-sensitive algorithms and theory. The proposed conve...
PAKDD
2001
ACM
14 years 2 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
KDD
1999
ACM
14 years 2 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
KDD
1998
ACM
14 years 2 months ago
1998
ACM
The goal of Active Template research is to create a single, unified environment that a data analyst can use to carry out a knowledge discovery project, and to deliver the resultin...