Andrian Marcus
Jonathan I. Maletic
King-Ip Lin
ABSTRACT
A new extension of the Boolean association rules, ordinal association rules, that incorporates ordinal relationships among data items, is introduced. One use for ordinal rules is to identify possible errors in data. A method that finds these rules and identifies potential errors in data is proposed.
- Agrawal, R., Imielinski, T. and Swami, A., Mining Association rules between Sets of Items in Large Databases. In ACM SIGMOD International Conference on Management of Data, (Washington D.C., 1993), 207--216. Google Scholar
Digital Library
- Buchter, O. and Wirth, R. Exploration of Ordinal Data Using Association Rules. Knowledge and Information Systems, 1 (4).Google Scholar
- Galhardas, H., Florescu, D., Shasha, D. and Simon, E. An Extensible Framework for Data Cleaning, Institute National de Recherche en Informatique ét en Automatique, 1999.Google Scholar
- Guillaume, S., Khenchaf, A. and Briand, H., Generalizing Association Rules to Ordinal Rules. In The Conference on Information Quality (IQ2000), (MIT, Boston, MA, 2000), 268--282.Google Scholar
- Hernandez, M. and Stolfo, S. Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem. Data Mining and Knowledge Discovery, 2 (1). 9--37. Google ScholarDigital Library
- Hipp, J., Guntzer, U. and Nakhaeizadeh, G. Algorithms for Association Rule Mining - A General Survey and Comparison. SIGKDD Explorations, 2 (1). 58--64. Google ScholarDigital Library
- Korn, F., Labrinidis, A., Yannis, K. and Faloustsos, C., Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining. In 24th VLDB Conference, (New York, 1998), 582--593. Google ScholarDigital Library
- Maletic, J.I. and Marcus, A., Data Cleansing: Beyond Integrity Checking. In The Conference on Information Quality (IQ2000), (MIT, Boston, MA, 2000), 200--209.Google Scholar
- Miller, R.J. and Yang, Y. Association Rules over Interval Data. ACM SIGMOD, 26 (2). 452--461. Google ScholarDigital Library
- Ng, R.T., Lakshmanan, S., L.V., Han, J. and Pang, A., Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In ACM SIGMOD, (Seattle, Washington, 1998), 13--24. Google ScholarDigital Library
- Raman, V. and Hellerstein, J.M., Potter's wheel: an interactive data cleaning system. In 27th International Conference on Very Large Databases, (Rome, 2001), To appear. Google ScholarDigital Library
- Srikant, R., Vu, Q. and Agrawal, R., Mining Association Rules with Item Constraints. In SIGMOD International Conference on Management of Data, (Montreal, Canada, 1996), 1--12. Google ScholarDigital Library
Index Terms
- Ordinal association rules for error identification in data sets
Recommendations
Mining association rules from imprecise ordinal data
Categorical data can generally be classified into ordinal data and nominal data. Although there have been numerous studies on finding association rules from nominal data, few have tried to do so from ordinal data. Additionally, previous mining ...
Discovering association rules change from large databases
AICI'11: Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part IDiscovering association rules and association rules change (ARC) from existing large databases is an important problem. This paper presents an approach based on multi-hash chain structures to mine association rules change from large database with ...
Mining changes in association rules: a fuzzy approach
Association rule mining is concerned with the discovery of interesting association relationships hidden in databases. Existing algorithms typically assume that data characteristics are stable over time. Their main focus is therefore to mine association ...
Comments