کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
531752 | 869875 | 2007 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A clustering algorithm based on maximal θθ-distant subtrees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A clustering algorithm based on maximal θθ-distant subtrees A clustering algorithm based on maximal θθ-distant subtrees](/preview/png/531752.png)
چکیده انگلیسی
This paper presents a clustering algorithm based on maximal θθ-distant subtrees, the basic idea of which is to find a set of maximal θθ-distant subtrees by threshold cutting from a minimal spanning tree and merge each of their vertex sets into a cluster, coupled with a post-processing step for merging small clusters. The proposed algorithm can detect any number of well-separated clusters with any shapes and indicate the inherent hierarchical nature of the clusters present in a data set. Moreover, it is able to detect elements of small clusters as outliers in a data set and group them into a new cluster if the number of outliers is relatively large. Some computer simulations demonstrate the effectiveness of the clustering scheme.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 40, Issue 5, May 2007, Pages 1425–1431
Journal: Pattern Recognition - Volume 40, Issue 5, May 2007, Pages 1425–1431
نویسندگان
Li Yujian,