This article proposes a new information-based subdata selection (IBOSS) algorithm, Squared Scaled Distance Algorithm (SSDA). It is based on the invariance of the determinant of the information matrix under orthogonal transformations, especially rotations. Extensive simulation results show that the new IBOSS algorithm retains nice asymptotic properties of IBOSS and gives a larger determinant of the subdata information matrix. It has the same order of time complexity as the D-optimal IBOSS algorithm.
Download count: 0
- Partial requirement for: M.S., Arizona State University, 2017Note typethesis
- Includes bibliographical references (page 40)Note typebibliography
- Field of study: Statistics