The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
Learning Spectral Clustering, With Application To Speech Separation
Abstract
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same cluster having high similarity and points in different clusters having low similarity. In this paper, we derive new cost functions for spectral clustering based on measures of error between a given partition and a solution of the spectral relaxation of a minimum normalized cut problem. Minimizing these cost functions with respect to the partition leads to new spectral clustering algorithms. Minimizing with respect to the similarity matrix leads to algorithms for learning the similarity matrix from fully labelled datasets. We apply our learning algorithm to the blind one-microphone speech separation problem, casting the problem as one of segmentation of the spectrogram.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
Cited by
Supervised Speech Separation Based on Deep Learning: An Overview
Wang, D., & Chen, J. (2018) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2018.2842159 · Cited by 1,524
Deep clustering: Discriminative embeddings for segmentation and separation
Hershey, J. R., Chen, Z., Le Roux, J., & Watanabe, S. (2016) · 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2016.7471631 · Cited by 1,354
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Social big data: recent achievements and new challenges
Bello-Orgaz, G., Jung, J. J., & Camacho, D. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.08.005 · Cited by 846
Learning a Mahalanobis distance metric for data clustering and classification
Xiang, S., Nie, F., & Zhang, C. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.05.018 · Cited by 621
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
Self-citationAnalyzing communities and their evolutions in dynamic social networks
Lin, Y.-R., Chi, Y., Zhu, S., Sundaram, H., & Tseng, B. L. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1514888.1514891 · Cited by 296
Matrix Backpropagation for Deep Networks with Structured Layers
Ionescu, C., Vantzos, O., & Sminchisescu, C. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.339 · Cited by 281
Speaker-Independent Speech Separation With Deep Attractor Network
Luo, Y., Chen, Z., & Mesgarani, N. (2018) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2018.2795749 · Cited by 260
Metadata
- Authors
- Bach, F., & Jordan, M. I.
- Published
- 2006-12-01
- Volume
- 7
- Issue
- 71
- Pages
- 1963-2001
- DOI
- 10.5555/1248547.1248618
- OpenAlex
- W2129116669
- Cited by
- 245
- References
- 1
- FWCI
- 19.90
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.