1227 search results - page 150 / 246 » Approximate Kernel Clustering |
178
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
ECCV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we describe an unsupervised learning framework to segment a scene into semantic regions and to build semantic scene models from longterm observations of mo...
PR
2008
14 years 9 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...