Abstract
ABSTRACTAnalysis with principal points is a useful statistical tool for summarizing large data. In this paper, we propose a subgradient-based algorithm to calculate a set of principal points for multivariate binary data by the formulating it as a p-median problem. This enables us to find a globally optimal set of principal points or an ε-optimal solution in the middle of the calculation by combining an upper bound found using the greedy method. This algorithm is an iterative procedure where each iteration can be calculated in an efficient manner. We investigate the applicability of the proposed framework with questionnaire data and arXiv co-authors data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
