Advances in Computational Intelligence Systems

Volume 513 of the series Advances in Intelligent Systems and Computing pp 107-123


TSK Inference with Sparse Rule Bases

  • Jie LiAffiliated withFaculty of Engineering and Environment, Northumbria University Email author 
  • , Yanpeng QuAffiliated withInformation Science and Technology College, Dalian Maritime University
  • , Hubert P. H. ShumAffiliated withFaculty of Engineering and Environment, Northumbria University
  • , Longzhi YangAffiliated withFaculty of Engineering and Environment, Northumbria University Email author 

* Final gross prices may vary according to local VAT.

Get Access


The Mamdani and TSK fuzzy models are fuzzy inference engines which have been most widely applied in real-world problems. Compared to the Mamdani approach, the TSK approach is more convenient when the crisp outputs are required. Common to both approaches, when a given observation does not overlap with any rule antecedent in the rule base (which usually termed as a sparse rule base), no rule can be fired, and thus no result can be generated. Fuzzy rule interpolation was proposed to address such issue. Although a number of important fuzzy rule interpolation approaches have been proposed in the literature, all of them were developed for Mamdani inference approach, which leads to the fuzzy outputs. This paper extends the traditional TSK fuzzy inference approach to allow inferences on sparse TSK fuzzy rule bases with crisp outputs directly generated. This extension firstly calculates the similarity degrees between a given observation and every individual rule in the rule base, such that the similarity degrees between the observation and all rule antecedents are greater than 0 even when they do not overlap. Then the TSK fuzzy model is extended using the generated matching degrees to derive crisp inference results. The experimentation shows the promising of the approach in enhancing the TSK inference engine when the knowledge represented in the rule base is not complete.