5595 search results - page 415 / 1119 » Approximation Algorithms for Clustering Problems |
198
click to vote
AI
2005
Springer
16 years 11 days ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
186
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
207
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
210
click to vote
AIMSA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
201
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...