|
| Mining of Prevalent Ailments in a Health Database Using Fp-Growth Algorithm
|
|
Full
text: |
 PDF(430.5KB) |
|
|
Source |
International Journal of Data Engineering (IJDE) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(2.52MB) |
|
Volume: 2 Issue: 2 |
| |
Pages: 27-92 |
|
Publication
Date: May / June 2011 |
|
ISSN
(Online): 2180-1274 |
|
|
|
|
|
Pages |
75 - 83 |
|
Author(s) |
|
|
|
Published
Date |
31-05-2011 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: FP-Ail, Frequent Pattern, Health Database, Knowledge |
|
|
| |
|
|
| This Manuscript is indexed in the following databases/websites:- |
|
| 1. Scribd |
| 2. Docstoc |
| |
|
| |
|
|
| Health databases are characterised by large number of attributes such as personal biological and diagnosis information, health history, prescription, billing information and so on. The increasing need for providing enhanced medical system has necessitated the need for adopting an efficient data mining technique for extracting hidden and useful information from health database. In the past, many data mining algorithms such as Apriori, Eclat, H-Mine have been developed with deficiency in time-space trade off. In this work, an enhanced FP-growth frequent pattern mining algorithm coined FP-Ail is applied to students’ health database with a view to provide information about prevalent ailments and suggestions for managing the identified ailments. FP-Ail is tested on a student’s health database of a tertiary institution in Nigeria and the results obtained could be used by the management of the health centre for enhanced strategic decision making about health care. FP-Ail also provides the possibility to refine the minimum support threshold interactively, and to see the changes instantly. |
| |
|
| |
|
| |
| 1 |
B. Abdelghani, P. David, C. Yidong, G. Abdel (2004). ”E-CAST: A Data Mining Algorithm For Gene Expression Data”. BIOKDD02: Workshop on Data Mining in Bioinformatics with SIGKDD02 Conference.
|
|
|
| 2 |
R. Agrawal and R. Srikant (1994). ”Fast Algorithms for mining association rules”, Proceedings 20th International Conference on Very Large Data Bases, pages 487- 499. Morgan Kaufmann.
|
|
|
| 3 |
R. Agrawal and R. Srikant (1995). “Mining sequential patterns”. ICDE’95.
|
|
|
| 4 |
R. Ali, M. ElHelw, L. Atallah, B. Lo, Y. Guang-Zhong. (2008). ”Pattern mining for routine behaviour discovery in pervasive healthcare environments”. International Conference on Technology and Applications in Biomedicine, 2008. ITAB 2008.
|
|
|
| 5 |
S. A. Ibrahim, O. Folorunso, O. B. Ajayi (2005). ”Knowledge Discovery of Closed Frequent Calling Patterns in a Telecommunication Database”. Proceedings of the 2005 Information Science and IT Education Joint Conference. Flagstaff, Arizona, USA. June 16-19.
|
|
|
| 6 |
J. Han, J. Pei, and Y. Yin. (2000). “Mining Frequent Patterns without Candidate Generation”. Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD’00)
|
|
|
| 7 |
J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, & M. C. Hsu (2001). ”Prefix-Span: Mining sequential patterns efficiently by prefix-projected pattern growth”. Proceedings 2001International Conference Data Engineering (ICDE’01).
|
|
|
| 8 |
J. Ruoming, A. Gagan (2004). ”A Systematic Approach for Optimizing Complex Mining Tasks on Multiple Databases”. Department of Computer Science and Engineering, Ohio State University, Columbus OH 43210.
|
|
|
| 9 |
T. Semenova (2003). “Episode-Based Conceptual Mining of Large Health Collections” Lecture notes in Computer Science, Vol. 2813/2003, Publisher: Springer Berlin / Heidelberg.
|
|
|
| |
|
| |
|
| |
| |
|
| |
|
| |
| |
|
| |
|
| |
|
| Onashoga, S. A. : Colleagues
|
|
| Sodiya, A. S. : Colleagues
|
|
| Akinwale, A. T. : Colleagues
|
|
| Falola, O. E. : Colleagues
|
|
