1227 search results - page 93 / 246 » Approximate Kernel Clustering |
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
NIPS
2008
14 years 11 months ago
2008
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
ISCAPDCS
2003
14 years 11 months ago
2003
EnFuzion and MOSIX are two packages that represent different approaches to cluster management. EnFuzion is a user-level queuing system that can dispatch a predetermined number of ...