19 search results - page 2 / 4 » Empirical Testing of Algorithms for Variable-Sized Label Pla... |
COR
2008
13 years 5 months ago
2008
Whether a given nonlinear solver can reach a feasible point for a set of nonlinear constraints depends heavily on the initial point provided. We develop a range of computationally...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
NIPS
2008
13 years 6 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
FLAIRS
2004
13 years 6 months ago
2004
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...