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.
| Original language | English |
|---|---|
| Pages (from-to) | 3916-3928 |
| Number of pages | 13 |
| Journal | Applied Soft Computing |
| Volume | 11 |
| Issue number | 5 |
| DOIs | |
| State | Published - Jul 2011 |
Keywords
- LID3
- Label semantics
- Linguistic decision tree
- Linguistic query
- Mass assignment
- Random set
Fingerprint
Dive into the research topics of 'Prediction and query evaluation using linguistic decision trees'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver