The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Novel Density-Based Clustering Framework by Using Level Set Method
Abstract
In this paper, a new density-based clustering framework is proposed by adopting the assumption that the cluster centers in data space can be regarded as target objects in image space. First, the level set evolution is adopted to find an approximation of cluster centers by using a new initial boundary formation scheme. Accordingly, three types of initial boundaries are defined so that each of them can evolve to approach the cluster centers in different ways. To avoid the long iteration time of level set evolution in data space, an efficient termination criterion is presented to stop the evolution process in the circumstance that no more cluster centers can be found. Then, a new effective density representation called level set density (LSD) is constructed from the evolution results. Finally, the valley seeking clustering is used to group data points into corresponding clusters based on the LSD. The experiments on some synthetic and real data sets have demonstrated the efficiency and effectiveness of the proposed clustering framework. The comparisons with DBSCAN method, OPTICS method, and valley seeking clustering method further show that the proposed framework can successfully avoid the overfitting phenomenon and solve the confusion problem of cluster boundary points and outliers.
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
Review the state-of-the-art technologies of semantic segmentation based on deep learning
Mo, Y., Wu, Y., Yang, X., Liu, F., & Liao, Y. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.01.005 · Cited by 632
Computer vision and deep learning techniques for pedestrian detection and tracking: A survey
Brunetti, A., Buongiorno, D., Trotta, G. F., & Bevilacqua, V. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.01.092 · Cited by 536
Comprehensive survey of image steganography: Techniques, Evaluations, and trends in future research
Kadhim, I. J., Premaratne, P., Vial, P. J., & Halloran, B. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.06.075 · Cited by 452
Recent advances on image edge detection: A comprehensive review
Jing, J., Liu, S., Wang, G., Zhang, W., & Sun, C. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.06.083 · Cited by 298
Image compression techniques: A survey in lossless and lossy algorithms
Hussain, A. J., Al-Fayadh, A., & Radi, N. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.02.094 · Cited by 275
Metadata
- Authors
- Wang, X.-F., & Huang, D.-S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2009-11
- Volume
- 21
- Issue
- 11
- Pages
- 1515-1531
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2106442491
- Cited by
- 194
- References
- 1
- FWCI
- 3.25
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Novel Density-Based Clustering Framework by Using Level Set Method. https://app.cochat.ai/papers/10.1109/tkde.2009.21
- The paper
- Wang, X.-F., & Huang, D.-S. (2009). A Novel Density-Based Clustering Framework by Using Level Set Method. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2009.21
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.