Sciweavers

150 search results - page 8 / 30
» Jogging over a distance: supporting a
Sort
View
ACSC
2003
IEEE
14 years 10 hour ago
A Unifying Semantic Distance Model for Determining the Similarity of Attribute Values
The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing...
John F. Roddick, Kathleen Hornsby, Denise de Vries
BMCBI
2007
95views more  BMCBI 2007»
13 years 6 months ago
Phylogenetic tree information aids supervised learning for predicting protein-protein interaction based on distance matrices
Background: Protein-protein interactions are critical for cellular functions. Recently developed computational approaches for predicting protein-protein interactions utilize co-ev...
Roger A. Craig, Li Liao
NIPS
2001
13 years 8 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 7 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 6 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav