This chapter presents four applications of data mining in social security. The first is an application of decision tree and association rules to find the demographic patterns of customers. Sequence mining is used in the second application to find activity sequence patterns related to debt occurrence. In the third application, combined association rules are mined from heterogeneous data sources to discover patterns of slow payers and quick payers. In the last application, clustering and analysis of variance are employed to check the effectiveness of a new policy.
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
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487–499, Santiago, Chile, September 1994.
L. Cao, Y. Zhao, and C. Zhang. Mining impact-targeted activity patterns in im-balanced data. Accepted by IEEE Transactions on Knowledge and Data Engineering in July 2007. IEEE Computer Society Digital Library. IEEE Computer Society, http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190635.
Centrelink. Centrelink fraud statistics and centrelink facts and figures, url: http://www.centrelink.gov.au/internet/internet.nsf/about_us/fraud_stats.htm, http://www. centrelink.gov.au/internet/internet.nsf/about_us/facts.htm Accessed in May 2006.
J. Chattratichat, J. Darlington, Y. Guo, S. Hedvall, M. Köler, and J. Syed. An architecture for distributed enterprise data mining. In HPCN Europe '99: Proceedings of the 7th International Conference on High-Performance Computing and Networking, pages 573–582, London, UK, 1999. Springer-Verlag.
V. Crestana-Jensen and N. Soparkar. Frequent itemset counting across multiple tables. In PAKDD'00: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications, pages 49–61, London, UK, 2000. Springer-Verlag.
L. Cristofor and D. Simovici. Mining association rules in entity-relationship modeled databases. Technical report, University of Massachusetts Boston, 2001.
P. Domingos. Prospects and challenges for multi-relational data mining. SIGKDD Explor. Newsl., 5(1):80–83, 2003.
G. Dong and J. Li. Efficient mining of emerging patterns: discovering trends and differences. In KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 43–52, New York, NY, USA, 1999. ACM.
S. Dzeroski. Multi-relational data mining: an introduction. SIGKDD Explor. Newsl., 5(1):1– 16, 2003.
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226–231, 1996.
H. Guo and H. L. Viktor. Learning from imbalanced data sets with boosting and data generation: the databoost-im approach. SIGKDD Explor. Newsl., 6(1):30–39, 2004.
B. Park and H. Kargupta. Distributed data mining: Algorithms, systems, and applications. In N. Ye, editor, Data Mining Handbook. 2002.
J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Transactions on Knowledge and Data Engineering, 16(11):1424–1440, 2004.
F. Provost. Distributed data mining: Scaling up and beyond. In Advances in Distributed and Parallel Knowledge Discovery. MIT Press, 2000.
A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 8(6):970–974, 1996.
Q. Yang, J. Yin, C. X. Ling, and T. Chen. Postprocessing decision trees to extract actionable knowledge. In ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining, page 685, Washington, DC, USA, 2003. IEEE Computer Society.
M. Zaki. Mining non-redundant association rules. Data Mining and Knowledge Discovery, 9:223–248, 2004.
H. Zhang, Y. Zhao, L. Cao, and C. Zhang. Combined association rule mining. In T. Washio, E. Suzuki, K. M. Ting, and A. Inokuchi, editors, PAKDD, volume 5012 of Lecture Notes in Computer Science, pages 1069–1074. Springer, 2008.
J. Zhang, E. Bloedorn, L. Rosen, and D. Venese. Learning rules from highly unbalanced data sets. In ICDM '04: Proceedings of the Fourth IEEE International Conference on Data Mining, pages 571–574, Washington, DC, USA, 2004. IEEE Computer Society.
Y. Zhao, L. Cao, Y. Morrow, Y. Ou, J. Ni, and C. Zhang. Discovering debtor patterns of centrelink customers. In Proc. of The Australasian Data Mining Conference: AusDM 2006, Sydney, Australia, November 2006.
Y. Zhao, H. Zhang, F. Figueiredo, L. Cao, and C. Zhang. Mining for combined association rules on multiple datasets. In Proc. of 2007 ACM SIGKDD Workshop on Domain Driven Data Mining (DDDM 07), pages 18–23, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Zhao, Y. et al. (2009). Data Mining Applications in Social Security. In: Cao, L., Yu, P.S., Zhang, C., Zhang, H. (eds) Data Mining for Business Applications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-79420-4_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-79420-4_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-79419-8
Online ISBN: 978-0-387-79420-4
eBook Packages: Computer ScienceComputer Science (R0)