On the parallel complexity of hierarchical clustering and CC-complete problems
Complex data sets are often unmanageable unless they can be subdivided and simplified in an intelligent manner. Clustering is a technique that is used in data mining and scientific analysis for partitioning a data set into groups of similar or nearby items. Hierarchical clustering is an important an...
Saved in:
Main Authors: | Raymond Greenlaw, Sanpawat Kantabutra |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=60749115682&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60756 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
On the parallel complexity of hierarchical clustering and CC-complete problems
by: Greenlaw R., et al.
Published: (2014) -
On the parallel complexity of minimum sum of diameters clustering
by: Nopadon Juneam, et al.
Published: (2018) -
A mobility model for studying wireless communication and the complexity of problems in the model
by: Raymond Greenlaw, et al.
Published: (2018) -
The parallel complexities of the K-medians related problems
by: Sirion Vittayakorn, et al.
Published: (2018) -
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018)