Abstract
People are usually more interested in ranking a group of interrelated objects than the actual scores of them. In this paper, we presented an improved relative evaluation criterion, which is suitable for such task and can solve those problems that are difficult to deal with by common absolute criterion. We put forward the improvement algorithm and realize its function approximation by means of BP algorithm. Furthermore, we tested this criterion with the statistic data of SARS. The experimental results indicated that our improved criterion is effective in comparing a set of correlative objects objectively. Finally, we made a conclusion about the goal and efficiency of relative criterion.
This research was supported by NSFC (No.60435010), NSFB (No.4052025) and National Great Basic Research Program (973 project No.2003CB317000)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, J.: The Theory Research of Relative Criterion Method in Scatter Quantity System. In: Proceedings of Join Faculty of Computer Scientific Research, ICT&CNU, pp. 14–18 (2004)
Hornik, K., Stinchcombe, M., White, H.: Multilayer Feedforward Networks Are Universal Approximators. Neural Networks 2, 359–366 (1989)
Hagan, M.T., et al.: Neural Network Design. PWS Publishing Company (1995)
Yuan, C.: Artificial Neural Networks and Applications. Tsinghua University (1999)
http://www.mathworks.com/access/helpdesk/help/techdoc/matlab.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Liu, J., Shi, Z. (2005). An Improved Relative Criterion Using BP Algorithm. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_94
Download citation
DOI: https://doi.org/10.1007/11427391_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25912-1
Online ISBN: 978-3-540-32065-4
eBook Packages: Computer ScienceComputer Science (R0)