Sciweavers

290 search results - page 58 / 58
» Measuring similarity between collection of values
Sort
View
ICML
2004
IEEE
14 years 5 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
WEBI
2005
Springer
13 years 10 months ago
Metadata Propagation in the Web Using Co-Citations
Given the large heterogeneity of the World Wide Web, using metadata on the search engines side seems to be a useful track for information retrieval. Though, because a manual quali...
Camille Prime-Claverie, Michel Beigbeder, Thierry ...
SBBD
2008
256views Database» more  SBBD 2008»
13 years 6 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
BMCBI
2011
12 years 8 months ago
Assessing the functional coherence of modules found in multiple-evidence networks from Arabidopsis
Background: Combining multiple evidence-types from different information sources has the potential to reveal new relationships in biological systems. The integrated information ca...
Artem Lysenko, Michael Defoin-Platel, Keywan Hassa...
WWW
2005
ACM
14 years 5 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth