The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
(1996) · Cited by 20,179
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
ROSENTHALER, L. (2007) · The Focal Encyclopedia of Photography · doi:10.1016/b978-0-240-80740-9.50068-4 · Cited by 2,312
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
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
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
Ciaccia, P., Patella, M., & Zezula, P. (1997) · Cited by 1,527
Sibson, R., & Hartigan, J. A. (1976) · Applied Statistics · doi:10.2307/2346526 · Cited by 1,435
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
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
Natural Scales in Geographical Patterns
Menezes, T., & Roth, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01036 · Cited by 1,120
The relative neighbourhood graph of a finite planar set
Toussaint, G. T. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90066-7 · Cited by 1,008
Mercer kernel-based clustering in feature space
Girolami, M. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1000150 · Cited by 903
An introduction to spatial database systems
G�ting, R. H. (1994) · The VLDB Journal · doi:10.1007/bf01231602 · Cited by 724
Scheffer, T. (2005) · Encyclopedia of Data Warehousing and Mining · doi:10.4018/978-1-59140-557-3.ch192 · Cited by 624
Pattern Recognition, Third Edition
Theodoridis, S., & Koutroumbas, K. (2006) · Academic Press, Inc. eBooks · Cited by 582
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
Yu, J., Rui, Y., & Tao, D. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2311377 · Cited by 550
Multidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Step-Wise Clustering Procedures
King, B. (1967) · Journal of the American Statistical Association · doi:10.1080/01621459.1967.10482890 · Cited by 386
A Dynamic Index Structure for Spatial Searching
Guttman, A. (1984) · Medical Entomology and Zoology · Cited by 334
State of the art in pattern recognition
Nagy, G. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6414 · Cited by 293
Large-Margin Multi-ViewInformation Bottleneck
Xu, C., Tao, D., & Xu, C. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.2296528 · Cited by 257
Minimum Spanning Tree Based Clustering Algorithms
Grygorash, O., Zhou, Y., & Jorgensen, Z. (2006) · 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06) · doi:10.1109/ictai.2006.83 · Cited by 212
Rough-DBSCAN: A fast hybrid density based clustering method for large data sets
Pulabaigari, V., & Babu, V. S. (2009) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.08.008 · Cited by 147
Low-Rank Multi-View Learning in Matrix Completion for Multi-Label Image Classification
Liu, M., Luo, Y., Tao, D., Xu, C., & Wen, Y. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9547 · Cited by 144
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure
Patwary, M. M. A., Palsetia, D., Agrawal, A., Liao, W., Fredrik Manne, C., & Choudhary, A. (2012) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2012.9 · Cited by 128
Density-based clustering using graphics processors
Böhm, C., Noll, R., Plant, C., & Wackersreuther, B. (2009) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1645953.1646038 · Cited by 104
Image clustering based on sparse patch alignment framework
Yu, J., Hong, R., Wang, M., & You, J. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.05.002 · Cited by 103
Mixture Modeling by Affinity Propagation
Frey, B. J., & Dueck, D. (2005) · Cited by 100
Combining multiple clusterings using similarity graph
Mimaroglu, S., & Erdil, E. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.008 · Cited by 86
MULTISTRATEGY LEARNING FOR DOCUMENT RECOGNITION
Esposito, F., Malerba, D., & Semeraro, G. M. (1994) · Applied Artificial Intelligence · doi:10.1080/08839519408945432 · Cited by 78
Parallel DBSCAN with Priority R-tree
Chen, M., Gao, X., & Li, H. (2010) · International Conference on Information Management and Engineering (ICIME) · doi:10.1109/icime.2010.5477926 · Cited by 65
Cited by
Lu, Z., Shen, X., Li, D., Chen, Y., & Li, D. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2021.3072122 · Cited by 24
Metadata
- Authors
- Mahesh Kumar, K., & Rama Mohan Reddy, A.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2016-10
- Volume
- 58
- Pages
- 39-48
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2297788108
- Cited by
- 308
- References
- 46
- FWCI
- 24.34
- 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.