Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICTAI.2007.98
Title: | Prediction of cerebral aneurysm rupture | Authors: | Qiangfeng, P.L. Hsu, W. Mong, L.L. Mao, Y. Chen, L. |
Issue Date: | 2007 | Citation: | Qiangfeng, P.L., Hsu, W., Mong, L.L., Mao, Y., Chen, L. (2007). Prediction of cerebral aneurysm rupture. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI 1 : 350-357. ScholarBank@NUS Repository. https://doi.org/10.1109/ICTAI.2007.98 | Abstract: | Cerebral aneurysms are weak or thin spots on blood vessels in the brain that balloon out. While the majority of aneurysms do not burst, those that do would lead to serious complications including hemorrhagic stroke, permanent nerve damage, or death. Yet, surgical options for treating cerebral aneurysms carry high risk to the patient. It is vital for the doctors to accurately diagnose aneurysms that have high probabilities of rupturing. In this application, the patient dataset has many attributes, ranging from patient profile to results from diagnostic test and features extracted from brain images. Many of the attributes are discrete and have missing values. The dataset is also highly biased, with 15% unrupture cases and 85% rupture cases. Building a classifier that unerringly predicts the unrupture (rare) class is a challenge. In this paper, we describe a systematic approach to build such a classifier through suitable combination of data mining algorithms. Our approach automatically determines the optimal combination of these algorithms for a dataset. The system has an accuracy of 92% and is currently being deployed at the Huashan Hospital. © 2007 IEEE. | Source Title: | Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI | URI: | http://scholarbank.nus.edu.sg/handle/10635/40924 | ISBN: | 076953015X | ISSN: | 10823409 | DOI: | 10.1109/ICTAI.2007.98 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.