SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ohadi Negar; KAMANDI ALI; SHABANKHAH MAHMOOD; Fatemi Seyed Mohsen; HOSSEINI SEYED MOHSEN; MAHMOUDI ALIREZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2020 | Issue:6

Download Full-Text

View:

122

Download:

319

Information Seminar Paper

Title

SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets

Author(s)

Keywords

Data Mining

Clustering

DBSCAN

Density-based Clustering

Grid-based clustering

Abstract

Data Clustering aims to discover the underlying structure of data. it has many applications in data analysis and it is one of the most widely used tools in Data Mining. DBSCAN is one of the most famous Clustering algorithms. its advantages are to identify clusters of various shapes and define the number of clusters. Since DBSCAN is sensitive to its parameters which are ε and MinPts, it may perform poorly when the dataset is unbalanced. To solve this problem, this paper proposes a sliding window DBSCAN Clustering algorithm that uses Gridding and local parameters for unbalanced data which we will refer to as SW-DBSCAN. The algorithm divides the dataset into several grids. The size and shape of each gird depends on the specimen density specification. Then, for each grid, the parameters are adjusted for local Clustering and eventually merging data zones. Experimental results show that this algorithm can help to improve the performance of the DBSCAN algorithm and can deal with arbitrary data and asymmetric data.

Video

Cites

No record.

References

No record.

Cite

APA: Copy

Ohadi, Negar, KAMANDI, ALI, SHABANKHAH, MAHMOOD, Fatemi, Seyed Mohsen, HOSSEINI, SEYED MOHSEN, & MAHMOUDI, ALIREZA. (2020). SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949240/en

Vancouver: Copy

Ohadi Negar, KAMANDI ALI, SHABANKHAH MAHMOOD, Fatemi Seyed Mohsen, HOSSEINI SEYED MOHSEN, MAHMOUDI ALIREZA. SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets. 2020. Available from: https://sid.ir/paper/949240/en

IEEE: Copy

Negar Ohadi, ALI KAMANDI, MAHMOOD SHABANKHAH, Seyed Mohsen Fatemi, SEYED MOHSEN HOSSEINI, and ALIREZA MAHMOUDI, “SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2020, [Online]. Available: https://sid.ir/paper/949240/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops