Sciweavers

2277 search results - page 385 / 456
» Clustering by pattern similarity in large data sets
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
BMCBI
2010
105views more  BMCBI 2010»
15 years 6 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 6 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 6 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
IJCAI
2003
15 years 7 months ago
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
Craig Boutilier, Rajarshi Das, Jeffrey O. Kephart,...