5046 search results - page 820 / 1010 » Non-redundant data clustering |
303
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a nov...
341
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 ...
227
click to vote
MICCAI
2007
Springer
16 years 8 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
189
click to vote
ICML
2007
IEEE
16 years 8 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...
208
click to vote
WWW
2008
ACM
16 years 8 months ago
2008
ACM
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...