Sciweavers

54 search results - page 11 / 11
» Analysis of approximate nearest neighbor searching with clus...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 5 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
IJCNN
2000
IEEE
13 years 9 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
BMCBI
2004
156views more  BMCBI 2004»
13 years 5 months ago
GeneXplorer: an interactive web application for microarray data visualization and analysis
Background: When publishing large-scale microarray datasets, it is of great value to create supplemental websites where either the full data, or selected subsets corresponding to ...
Christian A. Rees, Janos Demeter, John C. Matese, ...
PPOPP
2010
ACM
14 years 2 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...