کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
535130 | 870323 | 2009 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Clustering constrained symbolic data
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Clustering constrained symbolic data Clustering constrained symbolic data](/preview/png/535130.png)
چکیده انگلیسی
Dealing with multi-valued data has become quite common in both the framework of databases as well as data analysis. Such data can be constrained by domain knowledge provided by relations between the variables and these relations are expressed by rules. However, such knowledge can introduce a combinatorial increase in the computation time depending on the number of rules. In this paper, we present a way to cluster such data in polynomial time. The method is based on the following: a decomposition of the data according to the rules, a suitable dissimilarity function and a clustering algorithm based on dissimilarities.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 30, Issue 11, 1 August 2009, Pages 1037–1045
Journal: Pattern Recognition Letters - Volume 30, Issue 11, 1 August 2009, Pages 1037–1045
نویسندگان
Francisco de A.T. de Carvalho, Marc Csernel, Yves Lechevallier,