The classification of electroencephalogram (EEG) signals derived from motor imagery (MI) has always been a hot topic in the field of brain–computer interfaces. Due to its ability to handle the nonstationary and uncertain information contained in EEG signals, the Takagi–Sugeno–Kang fuzzy system (TSK-FS) has become an advantageous classification algorithm. To train a fuzzy system with strong discrimination capabilities from EEG data interspersed with redundant information, this paper proposes a TSK-FS modeling method based on low-rank sparse subspace learning (TSK-LSSL). This method focuses on consequent parameter learning, which transforms the traditional consequent parameter learning strategy into low-rank subspace and sparse subspace learning processes. Low-rank subspace learning is used to mine the global structural information of data and effectively reduce the number of fuzzy rules. During sparse subspace learning, [Formula: see text]-norm regularization is used to constrain the consequent parameters and causes the number of redundant consequent parameters to be zero, thereby simplifying the fuzzy rules. In addition, a local boundary term based on graph matrices is embedded into the objective function to mine the local structural information of the given data. TSK-LSSL simplifies the number of rules and the consequent part of the fuzzy rules. It exhibits good classification performance on two BCI Competition databases.