نتایج جستجو برای: k means
تعداد نتایج: 702376 فیلتر نتایج به سال:
This paper compares clusters of aligned Persian and English texts obtained from k-means method. Text clustering has many applications in various fields of natural language processing. So far, much English documents clustering research has been accomplished. Now this question arises, are the results of them extendable to other languages? Since the goal of document clustering is grouping of docum...
در سالهای اخیر داده کاوی برروی سریهای زمانی توجه بسیاری را به خود جلب کرده است. شاید بتوان گفت از میان تمام تکنیکهای به کار برده شده برروی سریهای زمانی، خوشه بندی پر استفاده ترین تکنیک می باشد. خوشه بندی سریهای زمانی می تواند به دلایل مختلفی مانند یافتن الگوهای پنهان در داده ها و جستجوی شباهتها انجام شود. سریهای زمانی معمولاً دارای ابعاد طولانی هستند که این امر کار پردازش آنها را چه از نظر حافظ...
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for selecting.This paper proposes a new algorithm for K-medoids clustering which runs like the. A new Kmedoids clustering method that should be fast and efficient.
The primary role of the thyroid gland is to help regulation of the body’s metabolism. The correct diagnosis of thyroid dysfunctions is very important and early diagnosis is the key factor in its successful treatment. In this article, we used four different kinds of classifiers, namely Bayesian, k-NN, k-Means and 2-D SOM to classify the thyroid gland data set. The robustness of classifiers with ...
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same answer, but is much faster in practice. Like Elkan’s accelerated algorithm [8], our algorithm avoids distance computations using distance bounds and the triangle inequality. Our algorithm uses one novel lower bound for ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید