parallel subspace clustering
Publish place: 10th Annual Conference of Computer Society of Iran
Publish Year: 1383
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,210
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ACCSI10_030
تاریخ نمایه سازی: 25 آذر 1390
Abstract:
subspace clustering is an extension of traditional clustering that discovers clusters respected to the different subspaces within a data-set the time complexity of the algorithms to explore the high dimnsional spaces and find clusters in subspaces is exponential in the dimensionality o fthe data and is thus extremely computationally intensive . there for employing parallel algorithm for this problem can reduce its time complexity in this paper we propose and architecture for parallel implomentation of the locally adaptive clustering algorthm.
Keywords:
Authors