An Algorithm for Partitioning a Tree Into Sibling Subtree Clusters Weighted in a Given Range.
Hao ChenGuangchun LuoKe QinNingduo PengWen HaoPublished in: PDCAT (2012)
Keyphrases
- tree structure
- input data
- objective function
- k means
- np hard
- clustering algorithm
- graph structure
- data clustering
- binary tree
- maximum weight
- worst case
- preprocessing
- computational complexity
- learning algorithm
- unordered trees
- partitioning algorithm
- tree construction
- dense regions
- matching algorithm
- clustering method
- detection algorithm
- expectation maximization
- simulated annealing
- data structure