The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
High-Dimensional Cluster Analysis with the Masked EM Algorithm
Open accessAbstract
Cluster analysis faces two problems in high dimensions: the “curse of dimensionality” that can lead to overfitting and poor generalization performance and the sheer time taken for conventional algorithms to process large amounts of high-dimensional data. We describe a solution to these problems, designed for the application of spike sorting for next-generation, high-channel-count neural probes. In this problem, only a small subset of features provides information about the cluster membership of any one data vector, but this informative feature subset is not the same for all data points, rendering classical feature selection ineffective. We introduce a “masked EM” algorithm that allows accurate and time-efficient clustering of up to millions of points in thousands of dimensions. We demonstrate its applicability to synthetic data and to real-world high-channel-count spike sorting data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Model-Based Clustering, Discriminant Analysis, and Density Estimation
Fraley, C., & Raftery, A. E. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502760047131 · Cited by 4,257
Unsupervised spike detection and sorting with wavelets and superparamagnetic clustering
Quiroga, R. Q., Nadasdy, Z., & Ben-Shaul, Y. (2004) · Neural Computation · doi:10.1162/089976604774201631 · Cited by 2,119
A review of methods for spike sorting: the detection and classification of neural action potentials
Lewicki, M. S. (1998) · Network Computation in Neural Systems · doi:10.1088/0954-898x/9/4/001 · Cited by 1,370
Harris, K. D., Henze, D. A., Csicsvari, J., Hirase, H., & Buzsáki, G. (2000) · Journal of Neurophysiology · doi:10.1152/jn.2000.84.1.401 · Cited by 1,151
Self-citationComparing Clusterings by the Variation of Information
Meilă, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_14 · Cited by 604
The EM algorithm for mixtures of factor analyzers
Ghahramani, Z., & Hinton, G. E. (1996) · Cambridge University Engineering Department Publications Database · Cited by 583
Cited by
Arousal and Locomotion Make Distinct Contributions to Cortical Activity Patterns and Visual Encoding
Vinck, M., Batista-Brito, R., Knoblich, U., & Cardin, J. A. (2015) · Neuron · doi:10.1016/j.neuron.2015.03.028 · Cited by 819
Spike sorting for large, dense electrode arrays
Rossant, C., Kadir, S. N., Goodman, D. F. M., Schulman, J., Hunter, M. L. D., Saleem, A. B., Grosmark, A., Belluscio, M., Denfield, G. H., Ecker, A. S., et al. (2016) · Nature Neuroscience · doi:10.1038/nn.4268 · Cited by 785
Self-citationKilosort: realtime spike-sorting for extracellular electrophysiology with hundreds of channels
Pachitariu, M., Steinmetz, N., Kadir, S., Carandini, M., & Kenneth D., H. (2016) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/061481 · Cited by 740
Self-citationA Fully Automated Approach to Spike Sorting
Chung, J. E., Magland, J. F., Barnett, A. H., Tolosa, V. M., Tooker, A. C., Lee, K. Y., Shah, K. G., Felix, S. H., Frank, L. M., & Greengard, L. F. (2017) · Neuron · doi:10.1016/j.neuron.2017.08.030 · Cited by 490
Sliced Human Cortical Organoids for Modeling Distinct Cortical Layer Formation
Qian, X., Su, Y., Adam, C. D., Deutschmann, A. U., Pather, S. R., Goldberg, E. M., Su, K., Li, S., Lu, L., Jacob, F., et al. (2020) · Cell Stem Cell · doi:10.1016/j.stem.2020.02.002 · Cited by 479
Metadata
- Authors
- Kadir, S. N., Goodman, D. F. M., & Harris, K. D.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2014-11-01
- Volume
- 26
- Issue
- 11
- Pages
- 2379-2394
- ISSN
- 0899-7667 (ISSN-L)
- OpenAlex
- W2153886236
- Cited by
- 291
- References
- 27
- FWCI
- 31.69
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: High-Dimensional Cluster Analysis with the Masked EM Algorithm. https://app.cochat.ai/papers/10.1162/neco_a_00661
- The paper
- Kadir, S. N., Goodman, D. F. M., & Harris, K. D. (2014). High-Dimensional Cluster Analysis with the Masked EM Algorithm. Neural Computation. https://doi.org/10.1162/neco_a_00661
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.