Search
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Code Listing by Kaijun Wang

Code 1-6 of 6   






The searching process is necessary for the Affinity propagation clustering (AP) when one demands a clustering solution under given number of clusters.
The Fast AP uses multi-grid searching to reduce the calling times of AP, and improves the upper bound of preference parameter to reduce the searching scope, so that it can (largely) enhance the speed performance of AP under given number of clusters.



Affinity propagation clustering (AP) is a clustering algorithm proposed in "Brendan J. Frey and Delbert Dueck. Clustering by Passing Messages Between Data Points. Science 315, 972 (2007)". It has some advantages: speed, general...



Cluster validation is an important and necessary step in cluster analysis. This visual cluster validation tool CVAP based on GUI provides important tools and convenient analysis environment for validity evaluation of clustering solutions,...



Affinity propagation clustering (AP) is a clustering algorithm proposed in "Brendan J. Frey and Delbert

Dueck. Clustering by Passing Messages Between Data Points. Science 315, 972 (2007)". It has some advantages: speed,...



The geometric double-entity model method (GDEM) is proposed to gives far-near degrees between clusters (namely, GE distances), which integrate the absolute distance between nearest sample sets and the dense degrees of border regions of two...



(SE) is developed to estimate the number of clusters (NC) for PAM clustering algorithm. By inspecting whether it is stable that two potential clusters are separated or merged, SE focuses on the separability of two closest clusters among k...