Sciweavers

165 search results - page 28 / 33
» Measuring the Diversity of a Test Set With Distance Entropy
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 12 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
15 years 9 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng
CORR
2004
Springer
133views Education» more  CORR 2004»
14 years 11 months ago
Information theory, multivariate dependence, and genetic network inference
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
Ilya Nemenman
ISMB
1996
15 years 26 days ago
A Knowledge-Based Method for Protein Structure Refinement and Prediction
The native conformation of a protein, in a given environment, is determined entirely by the various interatomic interactions dictated by the amino acid sequence (1-3). We describe...
Shankar Subramaniam, David K. Tcheng, James M. Fen...
ECCV
2006
Springer
16 years 1 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada