Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$

Should record linkage for nineteenth century census records be based on multiple pass algorithms using list unique records or are there more effective ways of establishing true matches? This paper considers both multiple pass algorithms and some alternatives, and finds that the alternatives can indeed be more effective.

Download Full-text

Record Linkage Theory and Practice: A Matter of Confidence

History and Computing ◽

10.3366/hac.1997.9.1-3.150 ◽

1997 ◽

Vol 9 (1-3) ◽

pp. 150-155

Author(s):

Peter Adman

Keyword(s):

Record Linkage ◽

Theory And Practice ◽

Recent Issue ◽

Parliamentary Elections ◽

Confidence Levels ◽

Multiple Pass ◽

Linkage Rate ◽

Paper Record ◽

The City

In a recent issue of this journal (Vol.8 no.2) the paper ‘Record linkage theory and practice: an experiment in the application of multiple pass linkage algorithms’ by Charles Harvey, Edmund Green and Penelope J. Corfield described the advances the authors have made on their previously published work. By using a multiple pass methodology they increased the linkage rate between two successive polls (1784 and 1788) from one-fifth to nearly three-fifths of the voters in the parliamentary elections for the City of Westminster. This critique examines the validity of their claims with regard to the confidence levels attained.

Download Full-text

Multiple-pass trajectories for an aeroassisted orbital transfer vehicle

10.2514/6.1984-407 ◽

1984 ◽

Cited By ~ 1

Author(s):

J. REHDER

Keyword(s):

Orbital Transfer ◽

Multiple Pass ◽

Aeroassisted Orbital Transfer

Download Full-text

Folded Layer Multiple-Pass Cavity

10.21236/ada244380 ◽

1991 ◽

Author(s):

Xu Yuguang ◽

Yu Qinyue ◽

Lyu Bo ◽

Chen Shouhau ◽

Rong Zhonghua

Keyword(s):

Multiple Pass

Download Full-text

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00040 ◽

2020 ◽

Author(s):

Sepehr Assadi ◽

Ran Raz

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Graph Streaming

Download Full-text

Load-Sharing Reliability Models with Different Component Sensitivities to Other Components’ Working States

Advances in Applied Probability ◽

10.1017/apr.2020.49 ◽

2021 ◽

Vol 53 (1) ◽

pp. 107-132

Author(s):

Tomasz Rychlik ◽

Fabio Spizzichino

Keyword(s):

Order Statistics ◽

Load Sharing ◽

Single Component ◽

Generalized Order Statistics ◽

Hazard Rates ◽

System Operation ◽

Reliability Models ◽

Mixtures Of Distributions ◽

Failure Times ◽

Generalized Order

AbstractWe study the distributions of component and system lifetimes under the time-homogeneous load-sharing model, where the multivariate conditional hazard rates of working components depend only on the set of failed components, and not on their failure moments or the time elapsed from the start of system operation. Then we analyze its time-heterogeneous extension, in which the distributions of consecutive failure times, single component lifetimes, and system lifetimes coincide with mixtures of distributions of generalized order statistics. Finally we focus on some specific forms of the time-nonhomogeneous load-sharing model.

Download Full-text