Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
EaseClouds Virtual File System SDK 2.1.1.2
dbForge SQL Decryptor 3.1
Fortune Gigs Script 2.03
Pricing Plans and Subscription Payment Script 1.0
PHP Image Resize Script 1.0
iTech Book Store Script 2.03
dbForge Event Profiler for SQL Server 1.3
iTech Question Answer Script 2.03
GZ Multi Hotel Booking System 1.0
iTech Video Tutorial Script 2.03
Uber App Clone 1.0
TeeChart NET for Xamarin.Forms 2017
JavaScript Framework Shield UI 1.7.33
SentiVeillance SDK Trial 6.0.171442
Instacart Clone 1.0
Top Code
Billing System 1.0.1
StreamChat 6.6
latgsqr 1.0
TAdvPicture 1.2
Simple Hill-Climbing 1.0
JNAerator / NativeLibs4Java 1.0
Best Spotify Clone 1.0
Revenue Auto Pilot 1.0
PostDate 2.4.40
CONVOLUTION IN MATLAB WITHOUT USING conv(x,h) 1.0
An SVG framework in C# and an SVG-GDI+ bridge
Readymade MLM Software 2.02
ASIO Proxy
JDrawingPanel 0.1
Javast 1.0
Top Rated
PHP Image Resize Script 1.0
Jango Clone Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
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
Sine Wave Using JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
Adaptive Affinity Propagation clustering 1.0
File ID: 80951






Adaptive Affinity Propagation clustering 1.0
Download Adaptive Affinity Propagation clustering 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 30.7 KB
Downloads: 54
Submit Rating:
Adaptive Affinity Propagation clustering 1.0 Description
Description: 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 applicability, and suitable for large number of clusters. AP has two limitations: it is hard to known what value of parameter d-de?preferenced-deOao can yield optimal clustering solutions, and oscillations cannot be eliminated automatically if occur.

Adaptive AP improves AP in these items: adaptive adjustment of the damping factor to eliminate oscillations (called adaptive damping), adaptive escaping oscillations, and adaptive searching the space of preference parameter to find out the optimal clustering solution suitable to a data set (called adaptive preference scanning). With these adaptive techniques, adaptive AP will outperform AP algorithm in clustering quality and oscillation elimination, and it will find optimal clustering solutions by Silhouette indices.

License: Shareware

Related: items, Adaptive, adjustment, Factor, damping, improves, oscillations

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 30.7 KB

Downloads: 54



More Similar Code

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,...



The Affinity Propagation (AP) clustering algorithm
proposed by Frey and Dueck (2007) provides an understandable,
nearly optimal summary of a data set. However,
it suffers two major shortcomings: i) the number of clusters is



Algorithm StrAP, is able to adaptively cluster data streams with Affinity Propagation. Several steps are made to build
StrAP. The first one (Weighted AP) extends AP to weighted items with
no loss of generality. The second one...



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...



It is application of the method of operator A of PDE linked to problem of Rc-network electrical propagation on cable.I will publish results computing online mathworks.



This model uses the NLMS adaptive filtering algorithm to suppress additive noise. It does not require a reference noise signal. However, the noise should be such that the auto-correlation of the noise be close to zero for some lag greater than a...



Companion software for the Direct Adaptive Control Algorithms: Theory and Applications, 2e book by Howard Kaufman, Itzhak Barkana & Kenneth Sobel



An implementation of "k-Means Projective Clustering" by P. K. Agarwal and N. H. Mustafa.

This method of clustering is based on finding few subspaces such that each point is close to a subspace.



This book is written for use as a textbook on adaptive systems at the senior undergraduate, or first and second graduate levels.

For a full book description and ordering information, please refer to...

User Review for Adaptive Affinity Propagation clustering
- required fields
     

Please enter text on the image