Abstract
In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, a semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization (FEO-SAP) was proposed in this study. The algorithm adjusts the similarity matrix by utilizing the known pair wise constraints, and performs affinity propagation on this basis. The idea of fireworks explosion was introduced into the iteration process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm's global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the simulation experiments validated that the proposed algorithm has better clustering performance comparing with conventional AP and semi-supervised AP (SAP).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
