847 search results - page 48 / 170 » Approximation algorithms for projective clustering |
122
Voted
KDD
1997
ACM
15 years 4 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
130
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
113
Voted
BMCBI
2006
15 years 20 days ago
2006
Background: Recent advances in genome technologies have provided an excellent opportunity to determine the complete biological characteristics of neoplastic tissues, resulting in ...
118
Voted
KDD
2000
ACM
15 years 4 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
101
Voted
MM
2004
ACM
15 years 6 months ago
2004
ACM
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...