کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4944936 | 1438014 | 2016 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Approximate normalized cuts without Eigen-decomposition
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Approximate normalized cuts without Eigen-decomposition Approximate normalized cuts without Eigen-decomposition](/preview/png/4944936.png)
چکیده انگلیسی
Most traditional weighted graph clustering algorithms are solved by spectral method, which is only suitable for small scale datasets because of the high space and time complexity. How to reduce the computational complexity of graph cut clustering to process the massive complex data has become a challenging problem. To overcome this problem, we design an approximate normalized cuts algorithm without eigen-decomposition for large scale clustering. On the one hand, the space requirement of normalized cut is decreased by sampling a few data points to infer the global features of dataset instead of using the whole affinity matrix; on the other hand, the graph cut clustering procedure is accelerated in an iterative way that using the approximate weighted kernel k-means to optimize the objective function of normalized cut, which avoids the direct eigen-decomposition of Laplacian matrix. We also analyze the approximation error of the proposed algorithm and compare it with other state-of-the-arts clustering algorithms on several benchmark datasets. The experimental results demonstrate that our method can efficiently do the clustering when the number of data objects exceeds tens of thousands.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 374, 20 December 2016, Pages 135-150
Journal: Information Sciences - Volume 374, 20 December 2016, Pages 135-150
نویسندگان
Jia Hongjie, Ding Shifei, Du Mingjing, Xue Yu,