421 search results - page 47 / 85 » A probabilistic framework for relational clustering |
109
Voted
WEBNET
2001
15 years 3 months ago
2001
: The Web is huge, unstructured and diverse in quality, which makes searching for information difficult. In practice, few of the documents returned by a search engine are valuable ...
148
click to vote
TKDE
2011
14 years 8 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
153
click to vote
ICTAI
2009
IEEE
14 years 11 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
120
Voted
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
123
click to vote
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...