373 search results - page 55 / 75 » A Better Fit - Characterising the Stakeholders |
98
Voted
NIPS
2004
15 years 1 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
103
click to vote
SFP
2001
15 years 1 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
ICML
2010
IEEE
15 years 25 days ago
2010
IEEE
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for nonexchangeability. This class can be used to...
110
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...