Potential energy cluster algorithm for automatically determining cluster center
An automatic determination and clustering algorithm technology, applied in the field of cluster analysis, can solve the problems of artificially setting the number of clusters and incomplete consideration of the allocation mechanism, and achieve good clustering effect, good clustering effect, and clustering accuracy high effect
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Publication Date
- 2017-04-05
- Estimated Expiration
- Not applicable · inactive patent
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention belongs to the technical field of cluster analysis, and relates to the improvement and optimization of a potential-based fast hierarchical clustering algorithm (Potential-based hierarchical agglomerative clustering, PHA). Specifically, it is a potential energy clustering algorithm for automatically determining cluster centers, which can be used in pattern recognition, data mining, image processing and other fields. Background technique
[0002] Clustering algorithm is an important branch of data mining, which gathers data through some similarity measure and clustering criterion without prior knowledge about potential data distribution. Cluster analysis plays an important role in many fields, including biology, artificial intelligence, customer relationship management, information retrieval, machine learning, etc.
[0003] However, there are many widely used clustering algorithms that cannot automatically determine the number of clusters....
Examples
Embodiment Construction
[0042] In order to clarify the purpose, technical solutions and advantages of the present invention, the present invention will be further described in detail below in conjunction with specific embodiments and accompanying drawings.
[0043] refer to figure 1 , the specific implementation process of the present invention comprises the following steps:
[0044] Step 1: first find the potential energy Φ of each data point i , where the potential energy Φ between every two points ij It is defined as follows:
[0045]
[0046] where r ij is the Euclidean distance between point i and point j, and δ is used to avoid the case where the denominator is zero. About δ:
[0047]
[0048] δ=mean(MinD i ) / S
[0049] where MinD i is the shortest distance from point i to other points, S is a scale factor, generally set to 10, and N is the number of data points. The potential energy Φ between every two points is calculated ij After that, the potential energy Φ of each point i ...