Prediction and query evaluation using linguistic decision trees

  • Authors:
  • Zengchang Qin;Jonathan Lawry

  • Affiliations:
  • Robotics Institute, Carnegie Mellon University, USA and Intelligent Computing and Machine Learning Lab, School of Automation Science and Electrical Engineering, Beihang University, China;Intelligent Systems Laboratory, University of Bristol, UK

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract: Linguistic decision tree (LDT) is a tree-structured model based on a framework for ''Modelling with Words''. In previous research [15,17], an algorithm for learning LDTs was proposed and its performance on some benchmark classification problems were investigated and compared with a number of well known classifiers. In this paper, a methodology for extending LDTs to prediction problems is proposed and the performance of LDTs are compared with other state-of-art prediction algorithms such as a Support Vector Regression (SVR) system and Fuzzy Semi-Naive Bayes [13] on a variety of data sets. Finally, a method for linguistic query evaluation is discussed and supported with an example.