Sciweavers

1016 search results - page 80 / 204
» Generalized distances between rankings
Sort
View
ICALP
2001
Springer
15 years 5 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 1 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 1 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
CIKM
2007
Springer
15 years 5 months ago
A comparison of statistical significance tests for information retrieval evaluation
Information retrieval (IR) researchers commonly use three tests of statistical significance: the Student's paired t-test, the Wilcoxon signed rank test, and the sign test. Ot...
Mark D. Smucker, James Allan, Ben Carterette
WWW
2003
ACM
16 years 1 months ago
A system for principled matchmaking in an electronic marketplace
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match d...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....