K-tree is a tree-like clustering algorithm. It is also called tree structure vector quantization (TSVQ). The goal of clustering analysis is in similar group objects. Each K-tree object represents a dimension vector space. All vectors in the tree must be the same number of dimensions.
K-tree provides a scalable clustering method combining B+-tree and K cluster algorithms. Clusters can be used to solve signal processing problems, using machine learning, and other environments. It has also recently been used to solve problems in the Wikipedia documentation cluster.
K-tree 0.4.1 This release releases the Python version for rapid prototyping and research.
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.