Park, D., Caramanis, C., & Sanghavi, S. (2016). Greedy subspace clustering (Report No. D-STOP/2016/111). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/32601
Park, Dohyung, Constantine Caramanis, and Sujay Sanghavi. Greedy subspace clustering. Report no. D-STOP/2016/111. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016. https://rosap.ntl.bts.gov/view/dot/32601.
Park, Dohyung, et al. Greedy subspace clustering. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016, Report no. D-STOP/2016/111, ROSA P. https://rosap.ntl.bts.gov/view/dot/32601.
We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets to estimate the subspaces. As the geometric structure of the clusters (linear subspaces) forbids proper performance of general distance based approaches such as K-means, many model-specific methods have been proposed. In this paper, we provide new simple and efficient algorithms for this problem. Our statistical analysis shows that the algorithms are guaranteed exact (perfect) clustering performance under certain conditions on the number of points and the affinity between subspaces. These conditions are weaker than those considered in the standard statistical literature. Experimental results on synthetic data generated from the standard unions of subspaces model demonstrate our theory. We also show that our algorithm performs competitively against state-of-the-art algorithms on real-world applications such as motion segmentation and face clustering, but with much simpler implementation and lower computational cost.
Park, D., Caramanis, C., & Sanghavi, S. (2016). Greedy subspace clustering (Report No. D-STOP/2016/111). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/32601
Park, Dohyung, Constantine Caramanis, and Sujay Sanghavi. Greedy subspace clustering. Report no. D-STOP/2016/111. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016. https://rosap.ntl.bts.gov/view/dot/32601.
Park, Dohyung, et al. Greedy subspace clustering. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016, Report no. D-STOP/2016/111, ROSA P. https://rosap.ntl.bts.gov/view/dot/32601.
ROSA P serves as an archival repository of USDOT-published products including scientific
findings, journal articles, guidelines, recommendations, or other information authored or co-authored by
USDOT or funded partners. As a repository, ROSA P retains documents in their original published format to
ensure public access to scientific information.
Links with this icon indicate that you are leaving a Bureau of Transportation
Statistics (BTS)/National Transportation Library (NTL)
Web-based service.
Thank you for visiting.
You are about to access a non-government link outside of
the U.S. Department of Transportation's National
Transportation Library.
Please note: While links to Web sites outside of DOT are
offered for your convenience, when you exit DOT Web sites,
Federal privacy policy and Section 508 of the Rehabilitation
Act (accessibility requirements) no longer apply. In
addition, DOT does not attest to the accuracy, relevance,
timeliness or completeness of information provided by linked
sites. Linking to a Web site does not constitute an
endorsement by DOT of the sponsors of the site or the
products presented on the site. For more information, please
view DOT's Web site linking policy.
To get back to the page you were previously viewing, click
your Cancel button.