705 search results - page 34 / 141 » Proximity Cluster Trees |
NIPS
2007
13 years 9 months ago
2007
We introduce a new Bayesian model for hierarchical clustering based on a prior over trees called Kingman’s coalescent. We develop novel greedy and sequential Monte Carlo inferen...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
: se the concept of visualizing general abstract data by intermediate projection into the hyperbolic space. Its favorable properties were reported earlier and led to the "hype...
PAKDD
2009
ACM
14 years 4 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
WISE
2009
Springer
14 years 2 months ago
2009
Springer
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...