A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

810 indexed citations

Abstract

loading...

About

This paper, published in 1996, received 810 indexed citations. Written by Martin Ester, Hans‐Peter Kriegel, Jörg Sander and Xiaowei Xu covering the research area of Information Systems, Artificial Intelligence and Signal Processing. It is primarily cited by scholars working on Artificial Intelligence (333 citations), Signal Processing (219 citations) and Computer Vision and Pattern Recognition (186 citations). Published in Knowledge Discovery and Data Mining.

In The Last Decade

doi.org/w6094878 →

Countries where authors are citing A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

Specialization
Citations

This map shows the geographic impact of A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise more than expected).

Fields of papers citing A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

This paper is also available at doi.org/w6094878.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026