doi: 10.4304/jsw.6.11.2106-2113
Item Relational Structure Algorithm Based on Empirical Distribution Critical Value
- 1 Department of Bioinformatics and Medical Informatics, Asia University, Taichung, Taiwan; Graduate Institute of Acupuncture Science, China Medical University, Taichung, Taiwan
- 2 Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan
- 3 Department of General Education, Min-Hwei College, Tainan, Taiwan
Abstract
Takeya’s item relational structure theory is a well-known ordering algorithm. 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 relational structure indices between any two items, it is more sensitive and effective than the traditional fixed threshold for comparing the ordering relation of any two items. A computer program is developed for the proposed method. A Mathematics example is also provided in this paper to illustrate the advantages of the proposed methods.
Keywords
- item ordering theory
- item relational st
How to Cite
Hsiang-Chuan Liu, Shih-Neng Wu, and Chin-Chun Chen, "Item Relational Structure Algorithm Based on Empirical Distribution Critical Value," Journal of Software, vol. 6, no. 11, pp. 2106-2113, 2011. https://doi.org/ 10.4304/jsw.6.11.2106-2113
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).