Effective pruning for the discovery of conditional functional dependencies

Computer Journal

Volumn 56, Issue 3, 2013, Pages 378-392

  Li, Jiuyong ^a   Liu, Jixue ^a   Toivonen, Hannu ^b   Yong, Jianming ^c  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b UNIVERSITY OF HELSINKI   (Finland)

^c UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL FUNCTIONAL DEPENDENCIES; DISCOVERY ALGORITHM; FAST ALGORITHMS; FUNCTIONAL DEPENDENCY; INCONSISTENT DATA; MINIMAL GENERATORS; SEARCH SPACES; SEMANTIC RULES;

REPAIR; SEMANTICS; VIRTUAL REALITY;

ALGORITHMS;

EID: 84874831275     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxs082     Document Type: Article

References (23)

1. Chiang, F. and Miller, R.J. (2008) Discovering Data Quality Rules. Proc. VLDB Endowment, 1, 1166-1177.
2. Fan,W., Geerts, F., Jia, X. and Kementsietsidis, A. (2008) Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst., 33, 1-48.
3. Fan,W. (2008) Dependencies Revisited for Improving Data Quality. Proc. ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS), Vancouver, Canada, June 9-11, pp. 159-170. ACM, NewYork.
4. Golab, L., Karloff, H., Korn, F., Srivastava, D. andYu, B. (2008) On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endowment, 1, 376-390.
5. Fan, W., Geerts, F., Li, J. and Xiong, M. (2011) Discovering conditional functional dependencies. IEEE Trans. Knowl. Data Eng., 23, 683-698.
6. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H andVerkamo, A. I. (1996) Fast Discovery of Association Rules. In Fayyad, U. M. and Piatetsky-Shapiro, G. and Smyth, P. and Uthurusamy, R. (eds) Advances in Knowledge Discovery and Data Mining,AAAI Press, Menlo Park, CA, USA
7. Li, H., Li, J., Wong, L., Feng, M. and Tan,Y.-P. (2005) Relative Risk and Odds Ratio: a Data Mining Perspective. Proc. ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS), Baltimore, MD, USA, June 13-15, pp. 368- 377. ACM, NewYork, USA (Pubitemid 43275499)
8. Balcázar, J.L. (2010) Redundancy, deduction schemes, and minimum-size bases for association rules. Logical Methods Comput. Sci., 6(2), 1-33.
9. Zaki, M.J. (2004) Mining non-redundant association rules. Data Mining Knowl. Discov. J., 9, 223-248. (Pubitemid 39193158)
10. Agrawal, R., Imieli'nski, T. and Swami, A. (1993) Mining Association Rules between Sets of Items in Large Databases. Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD), Washington, DC, USA, May 26-28, pp. 207-216. ACM, NewYork, USA
11. Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. and Lakhal, L. (2005) Generating a condensed representation for association rules. J. Intell. Inf. Syst., 24, 29-60. (Pubitemid 40536188)
12. Pei, J., Han, J. and Mao, R. (2000) Closet:An Efficient Algorithm for Mining Frequent Closed Itemsets. Proc. ACM SIGMOD Int. Workshop on Data Mining and Knowledge Discovery (DMKD), Dallas, TX, USA, May 14, pp. 21-30. ACM, NewYork, USA
13. Wang, J., Han, J. and Pei, J. (2003) Closet+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In ACMSIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD), Washington, DC, USA, August 24-27, pp. 236-245. ACM, NewYork.
14. Pasquier, N., Bastide, Y., Taouil, R. and Lakhal, L. (1999) Efficient mining of association rules using closed itemset lattices. J. Inf. Syst., 24, 25-46.
15. Pasquier, N., Bastide, Y., Taouil, R. and Lakhal, L. (1999) Discovering Frequent Closed Itemsets for Association rules. Proc. Int. Conf. on Database Theory (ICDT), Jerusalem, Israel, January 10-12, pp. 398-416. Springer, London, UK
16. Yahia, S.B., Hamrouni, T. and Nguifo, E.M. (2006) Frequent closed itemset based algorithms: a thorough structural and analytical survey. SIGKDD Exploration Newsletter, 8, 93-104.
17. Li, J. (2006) On optimal rule discovery. IEEE Trans. Knowl. Data Eng., 18, 460-471. (Pubitemid 43327096)
18. Le Bras, Y., Lenca, P. and Lallich, S. (2009) On Optimal Rule Mining:A Framework and a Necessary and Sufficient Condition of Antimonotonicity. Proc. Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD), Bangkok, Thailand, April 27-30, pp. 705-712. Springer, Berlin, Germany.
19. Han, J., Pei, J., Yin, Y. and Mao, R. (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. J., 8, 53-87. (Pubitemid 39019971)
20. Megiddo, N. and Srikant, R. (1998) Discovering Predictive Association Rules. Proc. Int. Conf. on Knowledge Discovery and Data Mining (KDD), New York, NY, USA, August 27-31, pp. 274-278. AAAI Press, Menlo Park, CA, USA
21. Triola, M.M. and Triola, M.F. (2005) Biostatistics for the Biological and Health Sciences (2nd edn). Addison-Wesley, Boston, USA
22. Frank, A. and Asuncion, A. (2010) UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences. http://archive.ics.uci.edu/ml.
23. Fan,W., Geerts, F. and Jia, X. (2009) Conditional Dependencies: A Principled Approach to Improving Data Quality. British National Conf. on Databases (BNCOD), Birmingham, UK, July 7-9, pp. 8-20. Springer, Berlin, Germany.