Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
ACM Computing Surveys (CSUR)
Learning from Data: Concepts, Theory, and Methods
Learning from Data: Concepts, Theory, and Methods
Digital Image Processing
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Case-based estimation of the risk of enterobiasis
Artificial Intelligence in Medicine
Artificial Intelligence in Medicine
An approach to model building for accelerated cooling process using instance-based learning
Expert Systems with Applications: An International Journal
Learning Instance-Specific Predictive Models
The Journal of Machine Learning Research
Instance-based classifiers applied to medical databases: Diagnosis and knowledge extraction
Artificial Intelligence in Medicine
Hi-index | 0.00 |
Objective: : Acute cerebral stroke is a frequent cause of death and the major cause of adult neurological disability in the western world. Thrombolysis is the only established treatment of ischemic stroke; however, its use carries a substantial risk of symptomatic intracerebral hemorrhage. A clinical tool to guide the use of thrombolysis would be very valuable. One of the major goals of such a tool would be the identification of potentially salvageable tissue. This requires an accurate prediction of the extent of infarction if untreated. In this study, we investigate the applicability of highly flexible instance-based (IB) methods for such predictions. Methods and materials: : Based on information obtained from magnetic resonance imaging of 14 patients with acute stroke, we explored three different implementations of the IB method: k-NN, Gaussian weighted, and constant radius search classification. Receiver operating characteristics analysis, in particular area under the curve (AUC), was used as performance measure. Results: : We found no significant difference (P = 0.48) in performance for the optimal k-NN (k = 164, AUC = 0.814 +/- 0.001) and Gaussian weight (@s = 0.17, AUC = 0.813 +/- 0.001) implementations, while they were both significantly better (P