1314 search results - page 227 / 263 » Approximate data mining in very large relational data |
109
click to vote
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we introduce a novel objective function for the hierarchical clustering of data from distance matrices, a very relevant task in Bioinformatics. To test the robustnes...
125
Voted
TKDE
2008
15 years 1 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
128
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
121
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
132
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...