3766 search results - page 585 / 754 » Projection for pattern recognition |
KDD
2008
ACM
15 years 11 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...
99
Voted
KDD
2008
ACM
15 years 11 months ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
KDD
2007
ACM
15 years 11 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...
117
click to vote
KDD
2007
ACM
15 years 11 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 ...
KDD
2006
ACM
15 years 11 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...