Adaptive Initialization Method Based on Spatial Local Information fork-Means Algorithm
نویسندگان
چکیده
منابع مشابه
Effective Information Retrieval Method Based on Matching Adaptive Genetic Algorithm
Information Retrieval (IR) System is very complex in nature due to the complex interactions between documents and queries, which means that the matching of document representations and query representations is not straightforward. The Genetic Algorithm (GA) is widely used in IR systems to improve the effectiveness such systems. This study uses the Vector Space Model (VSM) and the Extended Boole...
متن کاملHistogram-Based Method for Effective Initialization of the K-Means Clustering Algorithm
K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, this algorithm is highly sensitive to the initial selection of the cluster centers. Numerous initialization methods have been proposed to address this drawback. Many of these methods, however, have superlinear complexity in the number of data points, which makes them impractical for large data sets. On ...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملSuppressed Fuzzy C Means with Adaptive Non Local Spatial Information for segmentation of Noisy Images
Article history: Received 20 January 2015 Accepted 02 April 2015 Published 20 May 2015
متن کاملCommunity Detection Algorithm Based on Local Expansion K-means
Community structure implies some features in various real-world networks, and these features can help us to analysis structural and functional properties in the complex system. It has been proved that the classic k-means algorithm can efficiently cluster nodes into communities. However, initial seeds decide the efficiency of the k-means, especially when detecting communities with different size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/761468