Abstract
The health industry is facing increasing challenge with "big data" as traditional methods fail to manage the scale and complexity. This paper examines clustering of patient records for chronic diseases to facilitate a better construction of care plans. We solve this problem under the framework of subspace clustering. Our novel contribution lies in the exploitation of sparse representation to discover subspaces automatically and a domain-specific construction of weighting matrices for patient records. We show the new formulation is readily solved by extending existing ℓ1 -regularized optimization algorithms. Using a cohort of both diabetes and stroke data we show that we outperform existing benchmark clustering techniques in the literature.
Original language | English |
---|---|
Title of host publication | Advances in Knowledge Discovery and Data Mining - 17th Pacific-Asia Conference, PAKDD 2013, Proceedings |
Pages | 123-134 |
Number of pages | 12 |
Edition | PART 2 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Event | Pacific-Asia Conference on Knowledge Discovery and Data Mining 2013 - Gold Coast, Australia Duration: 14 Apr 2013 → 17 Apr 2013 Conference number: 17th https://link.springer.com/book/10.1007/978-3-642-37453-1 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Number | PART 2 |
Volume | 7819 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Pacific-Asia Conference on Knowledge Discovery and Data Mining 2013 |
---|---|
Abbreviated title | PAKDD 2013 |
Country/Territory | Australia |
City | Gold Coast |
Period | 14/04/13 → 17/04/13 |
Internet address |
|
Keywords
- Medical data
- Sparse representation
- Subspace clustering