Efficient non-convex graph clustering for big data
2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)(2018)
Abstract
Big data analysis is a fundamental research topic with extensive technical obstacles yet to be overcome. Graph clustering has shown promise in addressing big data challenges by categorizing otherwise unlabeled data-thus giving them meaning. In this paper, we propose a set of non-convex programs, generally referred to as Hard and Soft Clustering programs, that rely on matrix factorization formulations for enhanced computational performance. Based on such formulations, we devise clustering algorithms that allow for large data analysis in a more efficient manner than traditional convex clustering techniques. Numerical results confirm the usefulness of the proposed algorithms for clustering purposes and reveal their potential for usage in big data applications.
MoreTranslated text
Key words
Big Data,Non-Convex Methods,Graph Clustering,Soft/Hard Clustering,Matrix Factorization
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined