Labels provide a quick and effective solution to obtain people interesting content from large-scale social network information. The current interest label extraction method based on the subgraph stream proves the feasibility of the subgraph stream for user label extraction. However, it is extremely time-consuming for constructing subgraphs. As an effective mathematical method to deal with fuzzy and uncertain information, rough set-based representations for subgraph stream construction are capable of capturing the uncertainties of the social network. Therefore, we propose an effective (...) approach called RS_UNITE_SS, which is suitable for large-scale social network user interest label extraction. Specifically, we first propose the subgraph division algorithm to construct a subgraph stream by incorporating a rough set. Then, the algorithm for user real-time interest label extraction based on upper approximation is proposed by using sequentially characteristics of the subgraph. Empirically, we evaluate RS_UNITE_SS over real-world datasets, and experimental results demonstrate that our proposed approach is more computationally efficient than existing methods while achieving higher precision value and MRR value. (shrink)