241 search results - page 4 / 49 » Flexible Grid-Based Clustering |
KDD
2009
ACM
14 years 9 months ago
2009
ACM
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
NIPS
2007
13 years 10 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
ML
2002
ACM
13 years 8 months ago
2002
ACM
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
BMCBI
2010
13 years 8 months ago
2010
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...