Polytomous ordering theory algorithm based on empirical distribution critical value

Hsiang Chuan Liu, Shih Neng Wu, Hsien-Chang Tsai, Yih Chang Ou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Liu's polytomous ordering theory algorithm can be used for any testing with homogeneous or heterogeneous polytomous response. It is more useful than other well known polytomous ordering theory. However, its threshold limit value is a fixed value, lacking of statistical meaning, In this paper, the authors provide an improved threshold limit value by using the empirical distribution critical value of all the values of the ordering indices between any two items. For comparing the performance of two ordering theory models, a calculus test with polytomous items of Chung Chou Institute of Technology is conducted. The experimental results show that the new method has the better performance. A computer program is developed for the proposed method.

Original languageEnglish
Title of host publicationProceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
Pages1101-1106
Number of pages6
DOIs
Publication statusPublished - 2011 Nov 7
Event2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 - Guilin, Guangxi, China
Duration: 2011 Jul 102011 Jul 13

Publication series

NameProceedings - International Conference on Machine Learning and Cybernetics
Volume3
ISSN (Print)2160-133X
ISSN (Electronic)2160-1348

Other

Other2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
CountryChina
CityGuilin, Guangxi
Period11-07-1011-07-13

Fingerprint

Computer program listings
Testing

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Human-Computer Interaction

Cite this

Liu, H. C., Wu, S. N., Tsai, H-C., & Ou, Y. C. (2011). Polytomous ordering theory algorithm based on empirical distribution critical value. In Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 (pp. 1101-1106). [6016891] (Proceedings - International Conference on Machine Learning and Cybernetics; Vol. 3). https://doi.org/10.1109/ICMLC.2011.6016891
Liu, Hsiang Chuan ; Wu, Shih Neng ; Tsai, Hsien-Chang ; Ou, Yih Chang. / Polytomous ordering theory algorithm based on empirical distribution critical value. Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. 2011. pp. 1101-1106 (Proceedings - International Conference on Machine Learning and Cybernetics).
@inproceedings{742213be36d94fa893ef4a9ebb0f2b83,
title = "Polytomous ordering theory algorithm based on empirical distribution critical value",
abstract = "Liu's polytomous ordering theory algorithm can be used for any testing with homogeneous or heterogeneous polytomous response. It is more useful than other well known polytomous ordering theory. However, its threshold limit value is a fixed value, lacking of statistical meaning, In this paper, the authors provide an improved threshold limit value by using the empirical distribution critical value of all the values of the ordering indices between any two items. For comparing the performance of two ordering theory models, a calculus test with polytomous items of Chung Chou Institute of Technology is conducted. The experimental results show that the new method has the better performance. A computer program is developed for the proposed method.",
author = "Liu, {Hsiang Chuan} and Wu, {Shih Neng} and Hsien-Chang Tsai and Ou, {Yih Chang}",
year = "2011",
month = "11",
day = "7",
doi = "10.1109/ICMLC.2011.6016891",
language = "English",
isbn = "9781457703065",
series = "Proceedings - International Conference on Machine Learning and Cybernetics",
pages = "1101--1106",
booktitle = "Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011",

}

Liu, HC, Wu, SN, Tsai, H-C & Ou, YC 2011, Polytomous ordering theory algorithm based on empirical distribution critical value. in Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011., 6016891, Proceedings - International Conference on Machine Learning and Cybernetics, vol. 3, pp. 1101-1106, 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011, Guilin, Guangxi, China, 11-07-10. https://doi.org/10.1109/ICMLC.2011.6016891

Polytomous ordering theory algorithm based on empirical distribution critical value. / Liu, Hsiang Chuan; Wu, Shih Neng; Tsai, Hsien-Chang; Ou, Yih Chang.

Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. 2011. p. 1101-1106 6016891 (Proceedings - International Conference on Machine Learning and Cybernetics; Vol. 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Polytomous ordering theory algorithm based on empirical distribution critical value

AU - Liu, Hsiang Chuan

AU - Wu, Shih Neng

AU - Tsai, Hsien-Chang

AU - Ou, Yih Chang

PY - 2011/11/7

Y1 - 2011/11/7

N2 - Liu's polytomous ordering theory algorithm can be used for any testing with homogeneous or heterogeneous polytomous response. It is more useful than other well known polytomous ordering theory. However, its threshold limit value is a fixed value, lacking of statistical meaning, In this paper, the authors provide an improved threshold limit value by using the empirical distribution critical value of all the values of the ordering indices between any two items. For comparing the performance of two ordering theory models, a calculus test with polytomous items of Chung Chou Institute of Technology is conducted. The experimental results show that the new method has the better performance. A computer program is developed for the proposed method.

AB - Liu's polytomous ordering theory algorithm can be used for any testing with homogeneous or heterogeneous polytomous response. It is more useful than other well known polytomous ordering theory. However, its threshold limit value is a fixed value, lacking of statistical meaning, In this paper, the authors provide an improved threshold limit value by using the empirical distribution critical value of all the values of the ordering indices between any two items. For comparing the performance of two ordering theory models, a calculus test with polytomous items of Chung Chou Institute of Technology is conducted. The experimental results show that the new method has the better performance. A computer program is developed for the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=80155194263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80155194263&partnerID=8YFLogxK

U2 - 10.1109/ICMLC.2011.6016891

DO - 10.1109/ICMLC.2011.6016891

M3 - Conference contribution

SN - 9781457703065

T3 - Proceedings - International Conference on Machine Learning and Cybernetics

SP - 1101

EP - 1106

BT - Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011

ER -

Liu HC, Wu SN, Tsai H-C, Ou YC. Polytomous ordering theory algorithm based on empirical distribution critical value. In Proceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011. 2011. p. 1101-1106. 6016891. (Proceedings - International Conference on Machine Learning and Cybernetics). https://doi.org/10.1109/ICMLC.2011.6016891