Data Clustering: Algorithms and Applications
The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Abstract
Research on the problem of clustering tends to be fragmented across the pattern recognition, database, data mining, and machine learning communities. Addressing this problem in a unified way, Data Clustering: Algorithms and Applications provides complete coverage of the entire area of clustering, from basic methods to more refined and complex data clustering approaches. It pays special attention to recent issues in graphs, social networks, and other domains. The book focuses on three primary aspects of data clustering: Methods, describing key techniques commonly used for clustering, such as feature selection, agglomerative clustering, partitional clustering, density-based clustering, probabilistic clustering, grid-based clustering, spectral clustering, and nonnegative matrix factorization Domains, covering methods used for different domains of data, such as categorical data, text data, multimedia data, graph data, biological data, stream data, uncertain data, time series clustering, high-dimensional clustering, and big data Variations and Insights, discussing important variations of the clustering process, such as semisupervised clustering, interactive clustering, multiview clustering, cluster ensembles, and cluster validation In this book, top researchers from around the world explore the characteristics of clustering problems in a variety of application areas. They also explain how to glean detailed insight from the clustering processincluding how to verify the quality of the underlying clustersthrough supervision, human intervention, or the automated generation of alternative clusters.
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
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
(1996) · Cited by 20,179
Cluster analysis and display of genome-wide expression patterns
Eisen, M. B., Spellman, P. T., Brown, P. O., & Botstein, D. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.25.14863 · Cited by 16,184
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Cited by
Unsupervised deep embedding for clustering analysis
Xie, J., Girshick, R., & Farhadi, A. (2015) · arXiv · doi:10.48550/arxiv.1511.06335 · Cited by 2,476
Multi-view clustering: A survey
Yang, Y., & Wang, H. (2018) · Big Data Mining and Analytics · doi:10.26599/bdma.2018.9020003 · Cited by 506
Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoders
Dilokthanakul, N., Mediano, P. A. M., Garnelo, M., Lee, M. C. H., Salimbeni, H., Arulkumaran, K., & Shanahan, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.02648 · Cited by 458
A survey on platforms for big data analytics
Singh, D., & Reddy, C. K. (2015) · Journal of Big Data · doi:10.1186/s40537-014-0008-6 · Cited by 433
Detection and tracking of pedestrians and vehicles using roadside LiDAR sensors
Zhao, J., Xu, H., Liu, H., Wu, J., Zheng, Y., & Wu, D. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.01.007 · Cited by 358
COVIDSenti: A Large-Scale Benchmark Twitter Data Set for COVID-19 Sentiment Analysis
Naseem, U., Razzak, I., Khushi, M., Eklund, P. W., & Kim, J. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3051189 · Cited by 343
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Learning to Discover Novel Visual Categories via Deep Transfer Clustering
Han, K., Vedaldi, A., & Zisserman, A. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00849 · Cited by 303
Multi-view clustering via multi-manifold regularized non-negative matrix factorization
Zong, L., Zhang, X., Zhao, L., Yu, H., & Zhao, Q. (2017) · Neural Networks · doi:10.1016/j.neunet.2017.02.003 · Cited by 281
A survey of density based clustering algorithms
Bhattacharjee, P., & Mitra, P. (2021) · Frontiers of Computer Science · doi:10.1007/s11704-019-9059-3 · Cited by 271
X-Ray Tomography for Lithium Ion Battery Research: A Practical Guide
Pietsch, P., & Wood, V. (2017) · Annual Review of Materials Research · doi:10.1146/annurev-matsci-070616-123957 · Cited by 255
Shirkhorshidi, A. S., Aghabozorgi, S., Wah, T. Y., & Herawan, T. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-09156-3_49 · Cited by 230
Adjusting for Chance Clustering Comparison Measures
Romano, S., Vinh, N. X., Bailey, J., & Verspoor, K. M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.01286 · Cited by 192
Naseem, U., Razzak, I., Khan, S. K., & Prasad, M. (2021) · ACM Transactions on Asian and Low-Resource Language Information Processing · doi:10.1145/3434237 · Cited by 194
“Over the years text has been used in various applications such as email filtering [20], Irony and sarcasm detection [113] document organization [46], sentiment and opinion mining prediction [107, 115], hate speech detection [105, 106, 110, 114], question answering [44], content mining [2], biomedical text mining [109,…”
MethodMapping and classifying molecules from a high-throughput structural database
De, S., Musil, F., Ingram, T., Baldauf, C., & Ceriotti, M. (2017) · Journal of Cheminformatics · doi:10.1186/s13321-017-0192-4 · Cited by 42
Metadata
- Venue
- Chapman & Hall/CRC eBooks
- Publisher
- Chapman and Hall/CRC
- Published
- 2018-09-03
- OpenAlex
- W1531910981
- Cited by
- 756
- References
- 60
- FWCI
- 34.58
- Type
- book
- 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.