2259 search results - page 350 / 452 » Mining Actionable Patterns |
123
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
130
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
151
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
114
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Many applications in text processing require significant human effort for either labeling large document collections (when learning statistical models) or extrapolating rules from...
107
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...