119 search results - page 2 / 24 » Sparse kernel methods for high-dimensional survival data |
PAKDD
2009
ACM
14 years 2 days ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
ICDM
2009
IEEE
13 years 12 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
ICDE
2002
IEEE
13 years 10 months ago
2002
IEEE
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
DEXA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
ICANN
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...