Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Using Greedy algorithm: DBSCAN revisited II.

Shi-hong Yue1, Ping Li, Ji-dong Guo

  • 1Institute of Industrial Process Control, Zhejiang University, Hangzhou 310027, China; Shyue@iipc.zju.edu.cn.

Journal of Zhejiang University. Science
|October 21, 2004
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Retrograde intrarenal surgery combined with flexible vacuum-assisted ureteral access sheath versus traditional ureteral access sheath for 1-2 cm lower calyceal renal stones: a prospective, randomized controlled study.

American journal of clinical and experimental urology·2025
Same author

Single-access mini-PCNL with flexible cystoscopy vs. multi-access mini-PCNL for complex renal stones in prospective study.

Scientific reports·2025
Same author

Neural connectivity of oxytocin receptor-expressing neurons in the nucleus accumbens and their role in social attachment.

Hormones and behavior·2025
Same author

Efficacy and safety of sacral nerve root magnetic stimulation combined with solifenacin in female patients with overactive bladder.

American journal of translational research·2025
Same author

Developmental pyrethroid exposure causes a neurodevelopmental disorder phenotype in mice.

PNAS nexus·2023
Same author

Ghrelin infusion into the basolateral amygdala suppresses CTA memory formation in rats via the PI3K/Akt/mTOR and PLC/PKC signaling pathways.

Acta pharmacologica Sinica·2022
Same journal

Enhancing the quality metric of protein microarray image.

Journal of Zhejiang University. Science·2004
Same journal

Mathematical modeling of salt-gradient ion-exchange simulated moving bed chromatography for protein separations.

Journal of Zhejiang University. Science·2004
Same journal

Characterization of cellulose acetate micropore membrane immobilized acylase I.

Journal of Zhejiang University. Science·2004
Same journal

Research on the rheological properties of pesticide suspension concentrate.

Journal of Zhejiang University. Science·2004
Same journal

Ant colony system algorithm for the optimization of beer fermentation control.

Journal of Zhejiang University. Science·2004
Same journal

Scale-up of rifamycin B fermentation with Amycolatoposis mediterranei.

Journal of Zhejiang University. Science·2004
See all related articles

This study introduces an improved density-based clustering algorithm that enhances efficiency by using a greedy algorithm and a novel merging condition. The new method effectively identifies arbitrary-shaped clusters in large spatial datasets, outperforming traditional approaches.

Area of Science:

  • Computer Science
  • Data Mining
  • Artificial Intelligence

Background:

  • Traditional density-based clustering algorithms like DBSCAN face challenges with computational efficiency and accurately identifying clusters of varying shapes and densities.
  • Indexing spatial data using structures like R(*)-trees can be computationally intensive and increase memory load.

Purpose of the Study:

  • To present a novel density-based clustering algorithm that improves upon DBSCAN.
  • To enhance the efficiency and accuracy of spatial data clustering, particularly for arbitrary-shaped and density-skewed clusters.
  • To validate the algorithm's performance in a real-world application, such as robotic navigation.

Main Methods:

  • A greedy algorithm is employed for indexing the clustering space, replacing the R(*)-tree used in DBSCAN.

Related Experiment Videos

  • A carefully designed merging condition is introduced to accurately identify arbitrary-shaped clusters using a single threshold.
  • The algorithm's effectiveness and efficiency are evaluated using two artificial datasets and a robotic navigation scenario.

    • Main Results:

    • The proposed algorithm significantly reduces clustering time cost and I/O memory load compared to DBSCAN.
    • The novel merging condition successfully distinguishes all clusters in large spatial datasets, even those with density variations.
    • Experimental results demonstrate the algorithm's effectiveness and efficiency in practical applications.

    Conclusions:

    • The developed density-based clustering algorithm offers a more efficient and accurate alternative to DBSCAN for spatial data analysis.
    • The use of a greedy algorithm and an improved merging condition addresses key limitations of existing methods.
    • The algorithm shows promise for applications requiring robust and efficient spatial clustering, such as robotic navigation.