Guo Ji-dong

Yili Normal University

Papers

1

Total Citations

34

H-Index

1

About

Guo Ji-dong is a computer scientist whose work has advanced the theory and practice of density-based clustering. His most influential contribution reimagines the classic DBSCAN algorithm by replacing the traditional R*-tree spatial index with a Greedy algorithm approach. This innovation, detailed in his 2004 paper "Using Greedy algorithm: DBSCAN revisited II" (34 citations), offers distinct advantages in clustering efficiency and scalability. By rethinking how data points are indexed and grouped, Guo’s method reduces computational overhead while preserving the core strengths of density-based clustering—namely, the ability to discover arbitrarily shaped clusters and handle noise. His work speaks directly to researchers and practitioners in data mining, machine learning, and spatial data analysis who seek more practical, resource-conscious alternatives to established techniques. While his citation count reflects a focused, specialized impact, the conceptual clarity of his contribution has made it a reference point for those refining clustering algorithms. Guo Ji-dong’s research exemplifies how a targeted algorithmic improvement can resonate within a niche but critical area of computational science.

Research Focus

Key Achievements

1
H-Index
1
Papers
34
Total Citations
34
Avg Citations/Paper
🏆 Most Cited Paper
Using Greedy algorithm: DBSCAN revisited II
34 citations · 2004
📈 Most Prolific Year: 2004 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: Yili Normal University

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 22 days ago