Abstract
Compared with the rule form in traditional data mining techniques, expressing knowledge in the form of rank list can avoid many disadvantages, and may be applied for the investigation of targeted marketing widely, identifying potential market values of customers or products. Based on the rough sets theory in granular computing, this paper proposes a Granular Ranking Algorithm with the time complexity O(nm), gives the framework of algorithm and the concrete algorithm steps. The core of new algorithm is the construction of Granular Ranking Function r G (x) , which guides instances in the testing dataset finish ranking. The ranked result has a strong readability. The new algorithm improves the computation efficiency further relative to existing algorithms, e.g. the Market Value Function. The experiment result shows that the computation accuracy of granular ranking algorithm approaches to the market value function. Meanwhile, the time consumption of the former one is much less than the latter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp. 207–216. ACM Press, New York (1993)
Han, J.W., Kamber, M.: Data mining concepts and techniques. Morgan Kaufmann, San Francisco (2001)
Ling, C.X., Li, C.: Data mining for direct marketing: problems and solutions. In: Proceedings of KDD’98, pp. 73–79 (1998)
Liu, Q.: Rough sets and rough reasoning. Science Press, Beijing (2001)
Salton, G., McGill, M.H.: Introduction to modern information retrieval. McGraw-Hill, New York (1983)
Sparck Jones, K., Willett, P.: Readings in information retrieval. Morgan Kaufmann, San Francisco (1997)
Yao, Y.Y.: On modeling data mining with granular computing. In: Proceedings of COMPSAC’01, pp. 638–643 (2001)
Yao, Y.Y., Zhong, N.: Mining market value functions for targeted marketing. In: Proceedings of COMPSAC’01, pp. 517–522 (2001)
Yao, Y.Y., et al.: Using market value functions for targeted marketing data mining. International Journal of Pattern Recognition and Artificial Intelligence 16(8), 1117–1131 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Z., Wang, X. (2007). Granular Ranking Algorithm Based on Rough Sets. In: Cao, BY. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71441-5_91
Download citation
DOI: https://doi.org/10.1007/978-3-540-71441-5_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71440-8
Online ISBN: 978-3-540-71441-5
eBook Packages: EngineeringEngineering (R0)