11063 search results - page 2077 / 2213 » On the existence of universal models |
183
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
183
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
206
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
162
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
194
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...