The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
MR-DBSCAN: An Efficient Parallel Density-Based Clustering Algorithm Using MapReduce
Abstract
Data clustering is an important data mining technology that plays a crucial role in numerous scientific applications. However, it is challenging due to the size of datasets has been growing rapidly to extra-large scale in the real world. Meanwhile, MapReduce is a desirable parallel programming platform that is widely applied in kinds of data process fields. In this paper, we propose an efficient parallel density-based clustering algorithm and implement it by a 4-stages MapReduce paradigm. Furthermore, we adopt a quick partitioning strategy for large scale non-indexed data. We study the metric of merge among bordering partitions and make optimizations on it. At last, we evaluate our work on real large scale datasets using Hadoop platform. Results reveal that the speedup and scale up of our work are very efficient.
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
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Cited by
RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates
Bryant, A., & Cios, K. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2787640 · Cited by 273
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
Metadata
- Authors
- He, Y., Tan, H., Luo, W., Mao, H., Ma, D., Feng, S., & Fan, J.
- Venue
- 2011 IEEE 17th International Conference on Parallel and Distributed Systems
- Publisher
- IEEE
- Published
- 2011-12
- Pages
- 473-480
- OpenAlex
- W2061051181
- Cited by
- 209
- References
- 1
- FWCI
- 4.27
- Type
- conference paper
- 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.