With the rapid increase in the use of databases, the problem of missing values inevitably arises. The techniques developed to recover these missing values effectively should be highly precise in order to estimate the missing values completely. The mining of association rules can effectively establish the relationship among items in databases. Therefore, discovered association rules are usually applied to recover the missing values in databases. This study presents a Fast Recycle Combined Association Rules (FRCAR) method to fill in the missing values. FRCAR applies a technique to recycle sub-frequent itemsets and bit-arrays to discover more association rules than the Missing Value Completion (MVC) approach. The experimental result demonstrates that FRCAR results in a higher recovery rate and higher recovery accuracy for missing values.
M.Y. Chen and A.P. Chen, Knowledge management performance evaluation: a decade review from 1995 to 2004, Journal of Information Science32(1) (2006) 17—38.
2.
M.B. Nunes, F. Annansingh and B. Eaglestone, Knowledge management issues in knowledge-intensive SMEs, Journal of Documentation62(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 ACM39(11) (1996) 27—34.
6.
S. Zhang, C. Zhang and Q. Yang, Data preparation for data mining, AppliedArtificial Intelligence17(5—6) (2003) 375—81.
7.
S.Y. Chen and X. Liu, The contribution of data mining to information science, Journal of Information Science30(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) 164—8.
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) 140—6.
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 Science1280 (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) 283—8.
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 Science1394 (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) 207—16.
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) 487—99.
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) 175—86.
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) 432—44.
20.
J. Han, J. Pei, Y. Yin and R. Mao, Mining frequent pattern without candidate generation: a frequent pattern tree approach, Data Mining and KnowledgeDiscovery8(1) 200453—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 Science3309 (Springer, Berlin , 2004) 266—77.
22.
C.C. Chang and C.Y. Lin, Perfect hashing schemes for mining association rules, The Computer Journal48(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) 1—12.
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) 452—61.
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).
