Comparing top k lists

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 1, 2003, Pages 134-160

  Fagin, Ronald ^a   Kumar, Ravi ^a   Sivakumar, D ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Distance measures; Metric; Near metric; Polygonal inequality; Rank aggregation; Top k list; Triangle inequality

Indexed keywords

DISTANCE MEASURES; POLYGONAL INEQUALITY; RANK AGGREGATION; TOP K LIST; TRIANGLE INEQUALITY;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; POLYNOMIALS; STATISTICAL METHODS; WORLD WIDE WEB;

SEARCH ENGINES;

EID: 1442355935     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102412856     Document Type: Article

References (16)

1. [AB95] T. ANDREAE AND H.-J. BANDELT, Performance guarantees for approximation algorithms depending on parametrized triangle inequalities, SIAM J. Discrete Math., 8 (1995), pp. 1-16.
2. [BC00] M. A. BENDER AND C. CHEKURI, Performance guarantees for the TSP with a parameterized triangle inequality, Inform. Process. Lett., 73 (2000), pp. 17-21.
3. [CCF+01] D. CARMEL, D. COHEN, R. FAGIN, E. FARCHI, M. HERSCOVICI, Y. MAAREK, AND A. SOFFER, Static index pruning for information retrieval systems, in Proceedings of the 24th ACM SIGIR Conference on Research and Development in Information Retrieval, 2001, pp. 43-50.
4. [CCF02] M. CHARIKAR, K. CHEN, AND M. FARACH-COLTON, Finding frequent items in data streams, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 693-703.
5. [Cri80] D. E. CRITCHLOW, Metric Methods for Analyzing Partially Ranked Data, Lecture Notes in Statist. 34, Springer-Verlag, Berlin, 1980.
6. [DG77] P. DIACONIS AND R. GRAHAM, Spearman's footrule as a measure of disarray, J. Roy. Statist. Soc., Ser. B, 39 (1977), pp. 262-268.
7. [Dia88] P. DIACONIS, Group Representation in Probability and Statistics, IMS Lecture Notes Monogr. Ser. 11, Institute of Mathematical Statistics, Hayward, CA, 1988.
8. [DKNS01] C. DWORK, R. KUMAR, M. NAOR, AND D. SIVAKUMAR, Rank aggregation methods for the web, in Proceedings of the 10th International World Wide Web Conference, ACM, New York, 2001, pp. 613-622.
9. [Dug66] J. DUGUNDJI, Topology, Allyn and Bacon, Boston, 1966.
10. [FKS03] R. FAGIN, R. KUMAR, AND D. SIVAKUMAR, Comparing top k lists, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2003, pp. 28-36.
11. [FS98] R. FAGIN AND L. STOCKMEYER, Relaxing the triangle inequality in pattern matching, Int. J. Comput. Vision, 30 (1998), pp. 219-231.
12. [GK54] L. A. GOODMAN AND W. H. KRUSKAL, Measures of association for cross classifications, J. Amer. Statist. Assoc., 49 (1954), pp. 732-764.
13. [KG90] M. KENDALL AND J. D. GIBBONS, Rank Correlation Methods, Edward Arnold, London, 1990.
14. [KHMG03] S. KAMVAR, T. HAVELIWALA, C. MANNING, AND G. GOLUB, Extrapolation methods for accelerating PageRank computations, in Proceedings of the 12th International World Wide Web Conference, ACM, New York, 2003, pp. 261-270.
15. [Lee95] J. H. LEE, Combining multiple evidence from different properties of weighting schemes, in Proceedings of the 18th ACM SIGIR Conference on Research and Development in Information Retrieval. 1995, pp. 180-188.
16. [Lee97] J. H. LEE, Combining multiple evidence from different relevant feedback methods, in Database Systems for Advanced Applications '97, World Scientific, Singapore, 1997, pp. 421-430.