کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
530976 | 869803 | 2010 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
SEP/COP: An efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: SEP/COP: An efficient method to find the best partition in hierarchical clustering based on a new cluster validity index SEP/COP: An efficient method to find the best partition in hierarchical clustering based on a new cluster validity index](/preview/png/530976.png)
چکیده انگلیسی
Hierarchical clustering algorithms provide a set of nested partitions called a cluster hierarchy. Since the hierarchy is usually too complex it is reduced to a single partition by using cluster validity indices. We show that the classical method is often not useful and we propose SEP, a new method that efficiently searches in an extended partition set. Furthermore, we propose a new cluster validity index, COP, since many of the commonly used indices cannot be used with SEP. Experiments performed with 80 synthetic and 7 real datasets confirm that SEP/COP is superior to the method currently used and furthermore, it is less sensitive to noise.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 43, Issue 10, October 2010, Pages 3364–3373
Journal: Pattern Recognition - Volume 43, Issue 10, October 2010, Pages 3364–3373
نویسندگان
Ibai Gurrutxaga, Iñaki Albisua, Olatz Arbelaitz, José I. Martín, Javier Muguerza, Jesús M. Pérez, Iñigo Perona,