Abstract
Ever since Data Mining first appeared, a considerable amount of algorithms, methods and techniques have been developed. As a result of research, most of these algorithms have proved to be more effective and efficient. For solving problems different algorithms are often compared. However, algorithms that use different approaches are not very often applied jointly to obtain better results. An approach based on the joining of a predictive model (rough sets) together with a link analysis model (the Apriori algorithm) is presented in this paper.
This work has been partially supported by UPM under project ”Design of a Data Warehouse to be integrated with a Data Mining system”
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
Agrawal R., Imielinski T., Swami A. Mining association rules between sets of Item in large Databases, Proceedings of ACM SIGMOD, pages 207–216, May 1993.
J. Bazan Dynamic Reducts and statistical inference IPMU'96 1147–1151
Grzymala-Busse J. W. LERS: A system for learning from examples based on Rough Sets In Slowinski, R. (ed.) Intelligent Decision Support: Handbook of applicactions and advances of Rough Set theory. Kluwer Netherlands pp. 3–18
Fernandez C., Menasalvas E., J.Pena J., Castano M. A newapproac h for efficient calculus of reducts in large databases Joint Conference of Information Sciences, 1997, pp.340–343
Chen R., Lin T. Y. Finding Reducts in Very Large DataBases Joint Conference of Information Sciences, 1997, pp.350–352
Michalski R., Carbonell J. Mitchell T. M. Machine Learning: An Artificial Intelligence Approach, vol. 1, Tioga Publishing, Palo Alto CA. 1986
Z. Pawlak, Rough Sets-Theoretical Aspects of Reasoning about Data, Kluwer, 1991.
J.R. Quinlan Induction of decision Trees Machine Learning 1: 81–106, 1986, Kluwer Academic Publisher
Shan N. W. Ziarko, An incremental learning algorithm for constructing decision rules Rough Sets, Fuzzy Sets and Knowledge Discovery. W. Ziarko ed. Springer Verlag 1994 pp. 326–334
Shan N. W. Ziarko, Data-Base acquisition an incremental modification of classification rules pp. 357–368 Computational Intelligence, vol. 11 n. 2, 1995.pp. 357-369.
Shan N., Rule Discovery from Data using decision matrices Master degree Thesis. University of Regina. 1995
Skowron A., Extracting laws from decision tables: A Rough Set approach Computational Intelligence, vol. 11 n. 2, 1995.pp. 371–387
Skowron A., The discernibility matrices and functions in Information Systems Decision Support by Experience, R. Slowinski (Ed.) Kluwer Academic Publishers, 1992
W. Ziarko The discovery, analysis, and representation of data dependencies in databases KDD-93 pp. 195–209
W. Ziarko Rough Sets and Knowledge Discovery: An Overview In Rough Sets, Fuzzy Sets and knowledge Discovery.W. Ziarko (ed.). Springer-Verlag 1994 pp.11–15
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-Baizán, M.C., >Menasalvas Ruiz, E., Peña Sánchez, J.M., Sarrías, J.F.M., Millán, S. (2001). Using the Apriori Algorithm to Improve Rough Sets Results. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_35
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive