Incremental PDDP for the Clustering of Large Data Sets
Authors
Published Date
Publisher
Type
Abstract
Principal Direction Divisive Partitioning (PDDP) is an unsupervised method for partitioning data into clusters. The original method was designed to be applied to the entire data set at once, and for good performance required the entire data set be present in core memory. This paper introduces a variant of PDDP which allows a PDDP tree representing the entire data set to be built in sections. This permits the construction of PDDP trees on large data sets even with limited memory. The performance of the resulting Incremental PDDP tree is comparable to a basic PDDP tree.
Keywords
Description
Related to
item.page.replaces
License
Series/Report Number
Technical Report; 01-016
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Littau, David; Boley, Daniel. (2001). Incremental PDDP for the Clustering of Large Data Sets. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215463.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.