dc.contributor.author | Friedman, Alexander | |
dc.contributor.author | Keselman, Michael D. | |
dc.contributor.author | Gibb, Leif G. | |
dc.contributor.author | Graybiel, Ann M. | |
dc.date.accessioned | 2015-10-01T12:37:33Z | |
dc.date.available | 2015-10-01T12:37:33Z | |
dc.date.issued | 2015-04 | |
dc.date.submitted | 2015-01 | |
dc.identifier.issn | 0027-8424 | |
dc.identifier.issn | 1091-6490 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/99117 | |
dc.description.abstract | A critical problem faced in many scientific fields is the adequate separation of data derived from individual sources. Often, such datasets require analysis of multiple features in a highly multidimensional space, with overlap of features and sources. The datasets generated by simultaneous recording from hundreds of neurons emitting phasic action potentials have produced the challenge of separating the recorded signals into independent data subsets (clusters) corresponding to individual signal-generating neurons. Mathematical methods have been developed over the past three decades to achieve such spike clustering, but a complete solution with fully automated cluster identification has not been achieved. We propose here a fully automated mathematical approach that identifies clusters in multidimensional space through recursion, which combats the multidimensionality of the data. Recursion is paired with an approach to dimensional evaluation, in which each dimension of a dataset is examined for its informational importance for clustering. The dimensions offering greater informational importance are given added weight during recursive clustering. To combat strong background activity, our algorithm takes an iterative approach of data filtering according to a signal-to-noise ratio metric. The algorithm finds cluster cores, which are thereafter expanded to include complete clusters. This mathematical approach can be extended from its prototype context of spike sorting to other datasets that suffer from high dimensionality and background activity. | en_US |
dc.description.sponsorship | National Institutes of Health (U.S.) (Grant R01 MH060379) | en_US |
dc.description.sponsorship | United States. Defense Advanced Research Projects Agency | en_US |
dc.description.sponsorship | United States. Army Research Office (Grant W911NF-10-1-0059) | en_US |
dc.description.sponsorship | Cure Huntington’s Disease Initiative, Inc. (Grant A-5552) | en_US |
dc.language.iso | en_US | |
dc.publisher | National Academy of Sciences (U.S.) | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1073/pnas.1503940112 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | National Academy of Sciences (U.S.) | en_US |
dc.title | A multistage mathematical approach to automated clustering of high-dimensional noisy data | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Friedman, Alexander, Michael D. Keselman, Leif G. Gibb, and Ann M. Graybiel. “A Multistage Mathematical Approach to Automated Clustering of High-Dimensional Noisy Data.” Proc Natl Acad Sci USA 112, no. 14 (March 23, 2015): 4477–4482. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Brain and Cognitive Sciences | en_US |
dc.contributor.department | McGovern Institute for Brain Research at MIT | en_US |
dc.contributor.mitauthor | Friedman, Alexander | en_US |
dc.contributor.mitauthor | Keselman, Michael D. | en_US |
dc.contributor.mitauthor | Gibb, Leif G. | en_US |
dc.contributor.mitauthor | Graybiel, Ann M. | en_US |
dc.relation.journal | Proceedings of the National Academy of Sciences | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Friedman, Alexander; Keselman, Michael D.; Gibb, Leif G.; Graybiel, Ann M. | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-4326-7720 | |
mit.license | PUBLISHER_POLICY | en_US |
mit.metadata.status | Complete | |