Shadowed set-based rough-fuzzy clustering using random feature mapping
Kong L.; Chen L.
Source Publication2017 International Conference on Security, Pattern Analysis, and Cybernetics, SPAC 2017
AbstractThe shadowed set-based rough fuzzy clustering (SRFCM) methods have shown great performance on the data with outliers. But for the data with non-spherical clusters, the SRFC approaches cannot produce good results. The reason is the SRFCM, just like classical fuzzy c-means algorithms, works on the original data space and assures the linear separability of different clusters. The kernel methods can be combined with fuzzy clustering to deal with the non-spherical problem, but the size of kernel matrix is the square of the number of the input data, which makes the kernel fuzzy clustering is not suitable for very large data. But if we approximate the kernel space by using Fourier random feature mappings, the SRFC can be directly applied over the random features generated by data. This approach combines the advantages of SRFCM in handling outliers and the random features in processing non-spherical clusters. The experimental results show good performance of the SRFCM in the random feature space.
Keywordc-Means algorithm Fuzzy sets Random Fourier Features Rough sets Shadowed sets
URLView the original
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionUniversity of Macau
AffiliationUniversidade de Macau
Recommended Citation
GB/T 7714
Kong L.,Chen L.. Shadowed set-based rough-fuzzy clustering using random feature mapping[C],2018:400-405.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Kong L.]'s Articles
[Chen L.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Kong L.]'s Articles
[Chen L.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Kong L.]'s Articles
[Chen L.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.