Abstract
In applications where preferences are sought it is desirable to order instances of important phenomenon rather than classify them. Here we consider the problem of learning how to order instances based on spatial partitioning. We seek statements to the effect that one instance should be ranked ahead of another.
A two-stage approach to data ranking is proposed in this paper. The first learns to partition the spatial areas using the largest irregular area to represent the same rank data recursively, and gets a series of spatial areas (rules). The second stage learns a binary preference function indicating whether it is advisable to rank one instance before another according to the rules obtained from the first stage. The proposed method is evaluated using real world stock market data set. The results from initial experiments are quite remarkable and the testing accuracy is up to 71.15%.
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
William W. Cohen, Robert E. Schapire, Yoram Singer. Learning to order things. Journal of Artificial Intelligence Research 10(1999) 243–270.
Brian T. Bartell, Garrison W. Cottrell, Richard K. Belew. Learning the optimal parameters in a ranked retrieval system using multi-query relevance feedback. In Proceedings of the Symposium on Document Analysis and Information Retrieval, Las Vegas, 1994.
Brian T. Bartell. Optimizing Ranking Functions: A Connectionist Approach to Adaptive Information Retrieval. PhD thesis, Department of Computer Science & Engineering, The University of California, San Diego, 1994.
Hui Wang, Ivo Duntsch, David Bell. Data reduction based on hyper relations. In Proceedings of KDD98, New York, pages 349–353, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, G., Wang, H., Bell, D. (2000). Data Ranking Based on Spatial Partitioning. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-44491-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41450-6
Online ISBN: 978-3-540-44491-6
eBook Packages: Springer Book Archive