Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses

Yaxin Bi, Shengli Wu, Xuming Huang, Gongde Guo

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this paper, we propose a new method for measuring the closeness of multiple sets of rules that are combined using Dempster’s rule of combination to improve classification performance. The closeness provides an insight into combining multiple sets of rules in classification − in what circumambience the performance of combinations of some sets of rules using Dempster’s rule is better than that of others. Experiments have been carried out over the 20-newsgroups benchmark data collection, and the empirical results show that when the closeness between two sets of rules is higher than that of others, the performance of its combination using Dempster’s rule is better than the others.
LanguageEnglish
Title of host publicationPRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science
Pages1068-1072
Publication statusPublished - 2006

Fingerprint

Experiments

Cite this

Bi, Y., Wu, S., Huang, X., & Guo, G. (2006). Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses. In PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science (pp. 1068-1072)
Bi, Yaxin ; Wu, Shengli ; Huang, Xuming ; Guo, Gongde. / Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses. PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science. 2006. pp. 1068-1072
@inbook{303516a2629d4871945bb010dbd5b4de,
title = "Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses",
abstract = "In this paper, we propose a new method for measuring the closeness of multiple sets of rules that are combined using Dempster’s rule of combination to improve classification performance. The closeness provides an insight into combining multiple sets of rules in classification − in what circumambience the performance of combinations of some sets of rules using Dempster’s rule is better than that of others. Experiments have been carried out over the 20-newsgroups benchmark data collection, and the empirical results show that when the closeness between two sets of rules is higher than that of others, the performance of its combination using Dempster’s rule is better than the others.",
author = "Yaxin Bi and Shengli Wu and Xuming Huang and Gongde Guo",
year = "2006",
language = "English",
isbn = "978-3-540-36667-6",
pages = "1068--1072",
booktitle = "PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science",

}

Bi, Y, Wu, S, Huang, X & Guo, G 2006, Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses. in PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science. pp. 1068-1072.

Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses. / Bi, Yaxin; Wu, Shengli; Huang, Xuming; Guo, Gongde.

PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science. 2006. p. 1068-1072.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses

AU - Bi, Yaxin

AU - Wu, Shengli

AU - Huang, Xuming

AU - Guo, Gongde

PY - 2006

Y1 - 2006

N2 - In this paper, we propose a new method for measuring the closeness of multiple sets of rules that are combined using Dempster’s rule of combination to improve classification performance. The closeness provides an insight into combining multiple sets of rules in classification − in what circumambience the performance of combinations of some sets of rules using Dempster’s rule is better than that of others. Experiments have been carried out over the 20-newsgroups benchmark data collection, and the empirical results show that when the closeness between two sets of rules is higher than that of others, the performance of its combination using Dempster’s rule is better than the others.

AB - In this paper, we propose a new method for measuring the closeness of multiple sets of rules that are combined using Dempster’s rule of combination to improve classification performance. The closeness provides an insight into combining multiple sets of rules in classification − in what circumambience the performance of combinations of some sets of rules using Dempster’s rule is better than that of others. Experiments have been carried out over the 20-newsgroups benchmark data collection, and the empirical results show that when the closeness between two sets of rules is higher than that of others, the performance of its combination using Dempster’s rule is better than the others.

M3 - Chapter

SN - 978-3-540-36667-6

SP - 1068

EP - 1072

BT - PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science

ER -

Bi Y, Wu S, Huang X, Guo G. Combining Multiple Sets of Rules for Improving Classification Via Measuring Their Closenesses. In PRICAI 2006: Trends in Artificial Intelligence Lecture Notes in Computer Science. 2006. p. 1068-1072