Sciweavers

10457 search results - page 1976 / 2092
» Data Mapping as Search
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 1 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
GBRPR
2007
Springer
15 years 1 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 1 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
15 years 1 months ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
« Prev « First page 1976 / 2092 Last » Next »