Combined association rules for dealing with missing values

Journal of Information Science

Volumn 33, Issue 4, 2007, Pages 468-480

  Shen, Jau Ji ^a   Chang, Chin Chen ^b,c   Li, Yu Chiang ^c  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

^b FENG CHIA UNIVERSITY   (Taiwan)

^c NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Association rule; Data mining; Missing value; Relational database

Indexed keywords

DATA MINING; PROBLEM SOLVING; RELATIONAL DATABASE SYSTEMS; VALUE ENGINEERING;

MISSING VALUES; RELATIONAL DATABASE;

ASSOCIATION RULES;

EID: 34547458228     PISSN: 01655515     EISSN: 17416485     Source Type: Journal    
DOI: 10.1177/0165551506075329     Document Type: Article

References (25)

1. M.Y. Chen and A.P. Chen, Knowledge management performance evaluation: a decade review from 1995 to 2004, Journal of Information Science 32 (1) (2006) 17 38.
2. M.B. Nunes, F. Annansingh and B. Eaglestone, Knowledge management issues in knowledge-intensive SMEs, Journal of Documentation 62 (1) (2006) 101 19.
3. Y.B. Wu, Q. Li, R.S. Bot and X. Chen, Finding nuggets in documents: a machine learning approach, Journal of the American Society for Information Science and Technology (forthcoming).
4. J. Han and M. Kamber (eds), Data Mining: Concepts and Techniques ( Morgan Kaufmann, San Francisco, CA, 2000 ).
5. U. Fayyad, G. Piatetsky-Shapiro and P. Smyth, The KDD process for extracting useful knowledge from volumes of data, Communications of the ACM 39 (11) (1996) 27 34.
6. S. Zhang, C. Zhang and Q. Yang, Data preparation for data mining, Applied Artificial Intelligence 17 (5 6) (2003) 375 81.
7. S.Y. Chen and X. Liu, The contribution of data mining to information science, Journal of Information Science 30 (6) (2004) 550 8.
8. J.F. Hair, R.E. Anderson, R.L. Tatham and W. Black (eds), Multivariate Data Analysis ( Prentice Hall, London, 1998 ).
9. J.R. Quinlan, Unknown attribute values in induction. In: A.M. Segre (ed.), Proceedings of the 6th International Workshop on Machine Learning, Ithaca, New York, 1989 (Morgan Kaufmann, San Francisco, CA, 1989) 1648.
10. J.R. Quinlan (ed.), C4.5: Programs for Machine Learning ( Morgan Kaufmann, San Francisco, CA, 1993 ).
11. K. Lakshminarayan, S.A. Harp, R. Goldman and T. Samad, Imputation of missing data using machine learning techniques. In E. Simoudis, J. Han and U.M. Fayyad (eds), Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, August 1996 (AAAI Press, Menlo Park, CA, 1996) 1406.
12. W.Z. Liu, A.P. White, S.G. Thompson and M.A. Bramer, Techniques for dealing with missing values in classification. In: X. Liu, P.R. Cohen and M.R. Berthold (eds), Lecture Notes in Computer Science 1280 (Springer, Berlin, 1997) 527 36.
13. P. Wright, Knowledge discovery preprocessing: determining record usability. In: Proceedings of the 36th Annual Southeast Regional Conference, Marietta, GA, April 1998 (ACM Press, New York, 1998) 2838.
14. A. Ragel and B. Cremilleux, Treatment of missing values for association rules. In: X. Wu, K. Ramamohanarao and K.B. Korb (eds), Lecture Notes in Computer Science 1394 (Springer, Berlin, 1998) 258 70.
15. A. Ragel and B. Cremilleux, MVC a preprocessing method to deal with missing values, Knowledge-Based Systems, 12 (5 6) (1999) 285 91.
16. R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large database. In: P. Buneman and S. Jajodia (eds), Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 1993 (ACM Press, New York, 1993) 20716.
17. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases. In: J.B. Bocca, M. Jarke and C. Zaniolo (eds), Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, September 1994 (Morgan Kaufmann, San Francisco, CA, 1994) 48799.
18. J.S. Park, M.S. Chen and P.S. Yu, An effect hash-based algorithm for mining association rules. In: M.J. Carey and D.A. Schneider (eds), Proceedings of the ACM-SIGMOD International Conference on Management of Data, San Jose, CA, May 1995 (ACM Press, New York, 1995) 17586.
19. A. Savasere, E. Omiecinski and S. Navathe, An efficient algorithm for mining association rules in large databases. In: U. Dayal, P.M.D. Gray and S. Nishio (eds), Proceedings of the 21st International Conference on Very Large Data Bases, Zurich, Switzerland, September 1995 (Morgan Kaufmann, San Francisco, CA, 1995) 43244.
20. J. Han, J. Pei, Y. Yin and R. Mao, Mining frequent pattern without candidate generation: a frequent pattern tree approach, Data Mining and Knowledge Discovery 8 (1) 2004 53 87.
21. Y.C. Li and C.C. Chang, A new FP-tree algorithm for mining frequent itemsets. In C.H. Chi and K.Y. Lam (eds), Lecture Notes in Computer Science 3309 (Springer, Berlin, 2004) 266 77.
22. C.C. Chang and C.Y. Lin, Perfect hashing schemes for mining association rules, The Computer Journal 48 (2) (2005) 168 79.
23. R. Agrawal and R. Srikant, Mining quantitative association rules in large relational tables. In: H.V. Jagadish and I.S. Mumick (eds), Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 1996 (ACM Press, New York, 1996) 112.
24. R.J. Miller and Y. Yang, Association rules over interval data. In: J. Peckham (ed.), Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, May 1997 (ACM Press, New York, 1997) 45261.
25. D.J. Newman, S. Hettich, C.L. Blake, and C.J. Merz, UCI Machine Learning Repository (1998). Available at: www.ics.uci.edu/~mlearn/MLRepository.html (accessed 1 January 2005 ).