spectral clustering has been playing a vital role in various research areas. most traditional spectral clustering algorithms comprise two independent stages (e.g., first learning continuous labels and then rounding the learned labels into discrete ones), which may cause unpredictable deviation of resultant cluster labels from genuine ones, thereby leading to severe information loss and performance degradation. in this work, we study how to achieve discrete clustering as well as reliably generalize to unseen data. we propose a novel spectral clustering scheme which deeply explores cluster label properties, including discreteness, nonnegativity, and discrimination, as well as learns robust out-of-sample prediction functions. specifically, we explicitly enforce a discrete transformation on the intermediate continuous labels, which leads to a tractable optimization problem with a discrete solution. besides, we preserve the natural nonnegative characteristic of the clustering labels to enhance the interpretability of the results. moreover, to further compensate the unreliability of the learned clustering labels, we integrate an adaptive robust module with l(2,p) loss to learn prediction function for grouping unseen data. we also show that the out-of-sample component can inject discriminative knowledge into the learning of cluster labels under certain conditions. extensive experiments conducted on various data sets have demonstrated the superiority of our proposal as compared to several existing clustering approaches.