The DOI matches its Crossref record; 114 of the 114 references it cites were found in a registry or an index.
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
Abstract
As a prolific research area in data mining, subspace clustering and related problems induced a vast quantity of proposed solutions. However, many publications compare a new proposition—if at all—with one or two competitors, or even with a so-called “naïve” ad hoc solution, but fail to clarify the exact problem definition. As a consequence, even if two solutions are thoroughly compared experimentally, it will often remain unclear whether both solutions tackle the same problem or, if they do, whether they agree in certain tacit assumptions and how such assumptions may influence the outcome of an algorithm. In this survey, we try to clarify: (i) the different problem definitions related to subspace clustering in general; (ii) the specific difficulties encountered in this field of research; (iii) the varying assumptions, heuristics, and intuitions forming the basis of different approaches; and (iv) how several prominent solutions tackle different problems.
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
(1979) · Cited by 43,841
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
(1996) · Cited by 20,179
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
Witten, I. H. (2008) · Cited by 9,143
(2006) · Springer eBooks · Cited by 8,123
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Use of the hough transformation to detect lines and curves in pictures
Duda, R. O., & Hart, P. E. (1972) · Communications of the ACM · doi:10.1145/361237.361242 · Cited by 6,633
Data Mining - Concepts and Techniques.
Perner, P. (2002) · Künstliche Intell. · Cited by 4,886
Formal Concept Analysis: Mathematical Foundations
Ganter, B., Wille, R., & Franzke, C. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,245
Data Mining: Concepts and Techniques
Thamaraiselvi, G., & Kaliammal, A. (2014) · Journal of Information and Knowledge · Cited by 4,088
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Hand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Adaptive Control Processes: A Guided Tour.
Page, E. S., & Bellman, R. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343225 · Cited by 2,185
Biclustering of expression data.
Cheng, Y., & Church, G. M. (2000) · PubMed · Cited by 2,098
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
Wille, R. (1999) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(04)00049-6 · Cited by 1,890
Introduction to Data Mining, (First Edition)
Tan, P., Steinbach, M. S., & Kumar, V. (2005) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,889
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Subspace clustering for high dimensional data: a review
Parsons, L., Haque, E., & Liu, H. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007731 · Cited by 1,346
OPTICS: ordering points to identify the clustering structure
Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304187 · Cited by 1,335
Self-citationCluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
Direct Clustering of a Data Matrix
Hartigan, J. A. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481214 · Cited by 1,165
Berchtold, S., Keim, D. A., & Kriegel, H.-P. (2002) · Readings in Multimedia Computing and Networking · doi:10.1016/b978-155860651-7/50124-8 · Cited by 1,118
Self-citationBansal, N., Blum, A., & Chawla, S. (2004) · Machine Learning · doi:10.1023/b:mach.0000033116.57574.95 · Cited by 1,075
Adaptive Control Processes: A Guided Tour
Morgenstern, D., & Bellman, R. (1962) · Econometrica · doi:10.2307/1909901 · Cited by 992
(2002) · Springer Series in Statistics · doi:10.1007/b98835 · Cited by 919
A systematic comparison and evaluation of biclustering methods for gene expression data
Prelić, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., & Zitzler, E. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl060 · Cited by 910
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304188 · Cited by 900
Discovering statistically significant biclusters in gene expression data
Tanay, A., Sharan, R., & Shamir, R. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_1.s136 · Cited by 855
The SR-tree: an index structure for high-dimensional nearest neighbor queries
Katayama, N., & Satoh, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253347 · Cited by 817
Coupled two-way clustering analysis of gene microarray data
Getz, G., Levine, E., & Domany, E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.210134797 · Cited by 813
An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Jing, L., Ng, M. K., & Huang, J. Z. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1048 · Cited by 625
Mathematical Classification and Clustering
Mirkin, B. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600836 · Cited by 563
Entropy-based subspace clustering for mining numerical data
Cheng, C.-H., Fu, A. W., & Zhang, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312199 · Cited by 543
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335383 · Cited by 530
Parsons, S. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888904220203 · Cited by 520
What Is the Nearest Neighbor in High Dimensional Spaces
Hinneburg, A., Aggarwal, C. C., & Keim, D. A. (2000) · KOPS (University of Konstanz) · Cited by 505
The TV-tree: An index structure for high-dimensional data
Lin, K.-I., Jagadish, H. V., & Faloutsos, C. (1994) · The VLDB Journal · doi:10.1007/bf01231606 · Cited by 494
Clustering by pattern similarity in large data sets
Wang, H., Wang, W., Yang, J., & Yu, P. S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564737 · Cited by 484
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304188 · Cited by 484
Mathematical Classification and Clustering
Mirkin, B. (1996) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0457-9 · Cited by 464
Proceedings of the 26th International Conference on Data Engineering, ICDE 2010
Li, F., Moro, M. M., Ghandeharizadeh, S., Haritsa, J. R., Weikum, G., Carey, M. J., Casati, F., Chang, E. Y., Manolescu, I., Mehrotra, S., et al. (2010) · Max Planck Institute for Plasma Physics · Cited by 452
Clustering Objects on Subsets of Attributes (with Discussion)
Friedman, J. H., & Meulman, J. J. (2004) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2004.02059.x · Cited by 418
Berchtold, S., Böhm, C., & Kriegal, H.-P. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276318 · Cited by 402
Density-Connected Subspace Clustering for High-Dimensional Data
Kailing, K., Kriegel, H., & Kröger, P. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.23 · Cited by 384
Self-citationHigh-dimensional data clustering
Bouveyron, C., Girard, S., & Schmid, C. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2007.02.009 · Cited by 382
EXTRACTING CONSERVED GENE EXPRESSION MOTIFS FROM GENE EXPRESSION DATA
MURALI, T. M., & KASIF, S. (2002) · Biocomputing 2003 · doi:10.1142/9789812776303_0008 · Cited by 379
A Monte Carlo algorithm for fast projective clustering
Procopiuc, C. M., Jones, M., Agarwal, P. K., & Murali, T. M. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564739 · Cited by 340
Defining transcription modules using large-scale gene expression data
Ihmels, J., Bergmann, S., & Barkai, N. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth166 · Cited by 338
Proceedings of the 19th International Conference on Extending Database Technology, EDBT
Pitoura, E., Maabout, S., Koutrika, G., et al. (2016) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 337
δ-clusters: capturing subspace correlation in a large data set
Yang, J., Wang, W., Wang, H., & Yu, P. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994771 · Cited by 300
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335383 · Cited by 295
Minimum Sum-Squared Residue Co-clustering of Gene Expression Data
Cho, H., Dhillon, I. S., Guan, Y., & Sra, S. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.11 · Cited by 293
Independent quantization: an index compression technique for high-dimensional data spaces
Berchtold, S., Bohm, C., Jagadish, H. V., Kriegel, H.-P., & Sander, J. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839456 · Cited by 291
Self-citationRich probabilistic models for gene expression
Segal, E., Taskar, B., Gasch, A., Friedman, N., & Koller, D. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.suppl_1.s243 · Cited by 255
Beyond uniformity and independence
Faloutsos, C., & Kamel, I. (1994) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/182591.182593 · Cited by 239
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Chakrabarti, K., & Mehrotra, S. (2000) · Cited by 230
Clustering through decision tree construction
Liu, B., Xia, Y., & Yu, P. S. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354775 · Cited by 225
On the "dimensionality curse" and the "self-similarity blessing"
Korn, F., Pagel, B.-U., & Faloutsos, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908983 · Cited by 220
Biclustering microarray data by Gibbs sampling
Sheng, Q., Moreau, Y., & De Moor, B. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1078 · Cited by 220
Discovering local structure in gene expression data: the order-preserving submatrix problem
Ben-Dor, A., Chor, B., Karp, R., & Yakhini, Z. (2002) · Proceedings of the sixth annual international conference on Computational biology · doi:10.1145/565196.565203 · Cited by 200
Biclustering Algorithms: A Survey
(2005) · Handbook of Computational Molecular Biology · doi:10.1201/9781420036275-40 · Cited by 200
OP-cluster: clustering by tendency in high dimensional space
Liu, J., & Wang, W. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250919 · Cited by 199
Two-mode clustering methods: astructuredoverview
Van Mechelen, I., Bock, H.-H., & De Boeck, P. (2004) · Statistical Methods in Medical Research · doi:10.1191/0962280204sm373ra · Cited by 194
Analysis of gene expression microarrays for phenotype classification.
Califano, A., Stolovitzky, G. A., & Tu, Y. (2000) · PubMed · Cited by 184
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
Belussi, A., & Faloutsos, C. (2018) · University Libraries (University of Maryland) · doi:10.1184/r1/6605282 · Cited by 173
Computing Clusters of Correlation Connected objects
Böhm, C., Kailing, K., Kröger, P., & Zimek, A. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007620 · Cited by 168
Self-citationSubspace Clustering of High Dimensional Data
Domeniconi, C., Papadopoulos, D., Gunopulos, D., & Ma, S. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.58 · Cited by 166
Density Connected Clustering with Local Subspace Preferences
Bohm, C., Kailing, K., Kriegel, H.-P., & Kroger, P. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10087 · Cited by 162
Self-citationHARP: a practical projected clustering algorithm
Yip, K. Y., Cheung, D. W., & Ng, M. K. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.74 · Cited by 160
Fast nearest neighbor search in high-dimensional space
Berchtold, S., Ertl, B., Keim, D. A., et al. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1998.655779 · Cited by 155
FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting
Woo, K.-G., Lee, J.-H., Kim, M., & Yoon-Joon, L. E. E. (2003) · Information and Software Technology · doi:10.1016/j.infsof.2003.07.003 · Cited by 147
Using the fractal dimension to cluster datasets
Barbará, D., & Chen, P. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347145 · Cited by 147
A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data
Kriegel, H.-P., Kröger, P., Renz, M., & Wurst, S. (2006) · Proceedings · doi:10.1109/icdm.2005.5 · Cited by 137
Self-citationDUSC: Dimensionality Unbiased Subspace Clustering
Assent, I., Krieger, R., Müller, E., & Seidl, T. (2007) · Proceedings · doi:10.1109/icdm.2007.49 · Cited by 126
Moise, G., & Sander, J. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401956 · Cited by 123
Deflating the dimensionality curse using multiple fractal dimensions
Pagel, B.-U., Korn, F. R., & Faloutsos, C. (2002) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2000.839457 · Cited by 107
MaPle: a fast algorithm for maximal pattern-based clustering
Pei, J., Zhang, X., Cho, M., Wang, H., & Yu, P. S. (2004) · Proceedings · doi:10.1109/icdm.2003.1250928 · Cited by 107
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
Kriegel, H., Kröger, P., Schubert, E., & Zimek, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69497-7_27 · Cited by 104
Self-citationDiscovering associations with numeric variables
Webb, G. I. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502569 · Cited by 93
P3C: A Robust Projected Clustering Algorithm
Moise, G., Sander, J., & Ester, M. (2006) · Proceedings · doi:10.1109/icdm.2006.123 · Cited by 91
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
Achtert, E., Kriegel, H., & Zimek, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69497-7_41 · Cited by 90
Self-citationCURLER: finding and visualizing nonlinear correlation clusters
Tung, A. K. H., Xu, X., & Ooi, B. C. (2005) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1066157.1066211 · Cited by 78
Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012
Zhou, T., Shan, H., Banerjee, A., & Sapiro, G. (2012) · SIAM International Conference on Data Mining · Cited by 78
Ling, T. W., & Masunaga, Y. (1995) · Cited by 76
Detection and Visualization of Subspace Cluster Hierarchies
Achtert, E., Böhm, C., Kriegel, H., Kröger, P., Müller-Gorman, I., & Zimek, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-71703-4_15 · Cited by 73
Self-citationOn data mining, compression, and Kolmogorov complexity
Faloutsos, C., & Megalooikonomou, V. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0057-3 · Cited by 73
Frequent-pattern based iterative projected clustering
Yiu, M. L., & Mamoulis, N. (2004) · Proceedings · doi:10.1109/icdm.2003.1251009 · Cited by 73
Iterative projected clustering by subspace mining
Yiu, M. L., & Mamoulis, N. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.29 · Cited by 72
Robust, Complete, and Efficient Correlation Clustering
Achtert, E., Böhm, C., Kriegel, H., Kröger, P., & Zimek, A. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.37 · Cited by 71
Self-citationMoise, G., Sander, J., & Ester, M. (2007) · Knowledge and Information Systems · doi:10.1007/s10115-007-0090-6 · Cited by 70
Gionis, A., Hinneburg, A., Papadimitriou, S., & Tsaparas, P. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081880 · Cited by 61
On Discovery of Extremely Low-Dimensional Clusters Using Semi-Supervised Projected Clustering
Yip, K. Y.-L., Cheung, D. W.-L., & Ng, M. (2005) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2005.96 · Cited by 61
On Exploring Complex Relationships of Correlation Clusters
Achtert, E., Böhm, C., Kriegel, H., Kröger, P., & Zimek, A. (2007) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdbm.2007.21 · Cited by 58
Self-citationAssent, I., Krieger, R., Müller, E., & Seidl, T. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345451 · Cited by 54
Ip, L., JagadishH., V., & FaloutsosChristos (1994) · Very Large Data Bases · doi:10.5555/615204.615210 · Cited by 53
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Liu, G., Li, J., Sim, K., & Wong, L. (2007) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2007.368985 · Cited by 50
Mining Hierarchies of Correlation Clusters
Achtert, E., Böhm, C., Kröger, P., & Zimek, A. (2006) · International Conference on Scientific and Statistical Database Management · doi:10.1109/ssdbm.2006.35 · Cited by 45
Self-citationDeriving quantitative models for correlation clusters
Achtert, E., Böhm, C., Kriegel, H., Kröger, P., & Zimek, A. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150408 · Cited by 40
Self-citationSCHISM: a new approach to interesting subspace mining
Sequeira, K., & Zaki, M. J. (2005) · International Journal of Business Intelligence and Data Mining · doi:10.1504/ijbidm.2005.008360 · Cited by 29
Cited by
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
Kriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Self-citationA survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Self-citationData Clustering: Algorithms and Applications
(2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315373515 · Cited by 756
Metadata
- Authors
- Kriegel, H.-P., Kröger, P., & Zimek, A.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2009-03
- Volume
- 3
- Issue
- 1
- Pages
- 1-58
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2079361215
- Cited by
- 1,093
- References
- 114
- FWCI
- 77.35
- 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.