Abstract
The main mission of the variable precision rough set is to solve the problem of non-functional of properties or the classification in uncertain relationship data. FP-TREE of Association rule is one of the important research areas in data mining. Its goal is to discover previously unknown, interesting relationships among attributes from large databases. This paper presents FP-tree of association rules algorithms based on variable precision rough set model in e-commerce. The experiments show the algorithm could flexibly and the experimental results indicate that this method has great promise.
This is a preview of subscription content, log in via an institution to check access.
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
Mi, J.-S., Wu, W.-Z., Zhang, W.-X.: Approaches to knowledge reduction based on variable precision rough set model. Information Sciences 159, 255–272 (2004)
Marcus, A., Maletic, J.I., Lin, K.: Ordinal Association Rules for Error Identification in Data Sets. In: CIKM, pp. 589–591 (2001)
Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: IEEE ICDM 2003 Workshop FIMI 2003 (November 2003)
Beynon, M.: Reduces within the variable precision rough sets model: A further investigation. European Journal of Operational Research 134(3), 592–605 (2001)
Beynon, M.: An Investigation of -β Reduct Selection within the Variable Precision Rough Sets Model, pp. 114–122. Springer, Berlin (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Qian, S., Zhang, Z. (2012). Using Variable Precision Rough Set Model to Build FP-Tree of Association Rules. In: Jin, D., Lin, S. (eds) Advances in Computer Science and Information Engineering. Advances in Intelligent and Soft Computing, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30126-1_98
Download citation
DOI: https://doi.org/10.1007/978-3-642-30126-1_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30125-4
Online ISBN: 978-3-642-30126-1
eBook Packages: EngineeringEngineering (R0)