80 search results - page 14 / 16 » Data reduction and exact algorithms for clique cover |
KDD
2000
ACM
13 years 11 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...
SISAP
2011
IEEE
12 years 10 months ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
JCP
2008
13 years 7 months ago
2008
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...