847 search results - page 27 / 170 » Approximation algorithms for projective clustering |
ESANN
2004
15 years 14 days ago
2004
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...
SODA
2010
ACM
15 years 8 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
RECOMB
2008
Springer
15 years 11 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
143
Voted
BMCBI
2007
14 years 11 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
129
click to vote
KDD
2012
ACM
13 years 1 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...