Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets

DOI10.1080/00949655.2013.787534zbMATH Open1453.62528OpenAlexW2025320472MaRDI QIDQ5219487FDOQ5219487

Authors: Lysiane Charest, Jean-François Plante 

Publication date: 12 March 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2013.787534

Recommendations

• Estimating the number of clusters in a ranking data context
• An efficient approach for the rank aggregation problem
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Approximate rank aggregation (preliminary version)
• Approximate Condorcet partitioning: solving large-scale rank aggregation problems
• An agglomerative hierarchical clustering algorithm for linear ordinal rankings
• Efficient estimation for rank-based regression with clustered data
• Approximate and dynamic rank aggregation

zbMATH Keywords

correlationrank statisticsKendall's \(\tau \)Spearman's \(\rho \)massive datasetBIRCH

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Measures of association (correlation, canonical correlation, etc.) (62H20)

Cites Work

• On nonparametric measures of dependence for random variables
• A Primer on Copulas for Count Data
• A NEW MEASURE OF RANK CORRELATION
• An introduction to copulas.
• Testing for equality between two copulas
• A semiparametric estimation procedure of dependence parameters in multivariate families of distributions
• THE TREATMENT OF TIES IN RANKING PROBLEMS
• Title not available (Why is that?)
• The Estimation and Comparison of Strengths of Association in Contingency Tables
• Finding approximate solutions to combinatorial problems with very large data sets using BIRCH
• Rank Correlation when There are Equal Variates

Cited In (2)

• Finding approximate solutions to combinatorial problems with very large data sets using BIRCH
• Robust and efficient subsampling algorithms for massive data logistic regression

Uses Software

• UCI-ml
• copula
• TwoCop
• copula
• birch

This page was built for publication: Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219487)