3133 search results - page 453 / 627 » Representing clusters for retrieval |
315
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
267
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Nowadays, structured data such as sales and business forms are stored in data warehouses for decision makers to use. Further, unstructured data such as emails, html texts, images,...
173
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
181
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Nowadays, the increasing amount of semantic data available on the Web leads to a new stage in the potential of Semantic Web applications. However, it also introduces new issues du...
164
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...