Show simple item record

dc.contributor.advisorDrew, Dan D.
dc.creatorKu, Long-Chia
dc.descriptionTypescript (photocopy).en
dc.description.abstractSeveral hierarchical clustering methods (including single-linkage, complete-linkage, centroid, and absolute overlap methods) are reviewed. The absolute overlap clustering method is selected for the design of systolic architecture mainly due to its simplicity. Two versions of systolic architectures for the absolute overlap hierarchical clustering algorithm are proposed. A one dimensional version that leads to the development of a two dimensional version which fully takes advantage of the underlying data structure of the problems. The two dimensional systolic architecture can achieve a time complexity of O(m + n) in comparison to the conventional computer implementation of a time complexity of O(m('2)*n).en
dc.format.extentix, 82 leavesen
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en
dc.subjectComputer Scienceen
dc.subject.classification1984 Dissertation K95
dc.subject.lcshCluster analysisen
dc.subject.lcshComputer architectureen
dc.titleThe systolic architecture for hierarchical clusteringen
dc.typeThesisen A&M Universityen of Philosophyen D. in Philosophyen
dc.contributor.committeeMemberFriesen, Donald K.
dc.contributor.committeeMemberNoe, Philip S.
dc.contributor.committeeMemberMorgan, Stephen M.
dc.format.digitalOriginreformatted digitalen
dc.publisher.digitalTexas A&M University. Libraries

Files in this item


This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access