A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA

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.

Faroughi Azadeh; JAVIDAN REZA

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

Journal Paper

Paper Information

Journal: International Journal of Information and Communication Technology Research Year:2017 | Volume:9 | Issue:2 Page(s): 27-34

Download Full-Text

View:

213

Download:

Cites:

Information Journal Paper

Title

A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA

Author(s)

Faroughi Azadeh | JAVIDAN REZA | Issue Writer Certificate

Keywords

nearest_neighbor density estimator

farthest neighbor

subgroups

principal component analysis(PCA)

Abstract

Common nearest-neighbor density estimators usually do not work well for high dimensional datasets. Moreover, they have high time complexity of )(2nO and require high memory usage especially when indexing is used. In order to overcome these limitations, we proposed a new method that calculates distances to nearest and farthest neighbor nodes to create dataset subgroups. Therefore computational time complexity becomes of )log(nnO and space complexity becomes constant. After subgroup formation, assembling technique is used to derive correct clusters. In order to overcome high dimensional datasets problem, Principal Component Analysis (PCA) in the clustering method is used, which preprocesses high-dimensional data. Many experiments on synthetic data sets are carried out to demonstrate the feasibility of the proposed method. Furthermore we compared this algorithm to the similar algorithm – DBSCAN-on real-world datasets and the results showed significantly higher accuracy of the proposed method.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Faroughi, Azadeh, & JAVIDAN, REZA. (2017). A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH, 9(2), 27-34. SID. https://sid.ir/paper/315198/en

Vancouver: Copy

Faroughi Azadeh, JAVIDAN REZA. A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH[Internet]. 2017;9(2):27-34. Available from: https://sid.ir/paper/315198/en

IEEE: Copy

Azadeh Faroughi, and REZA JAVIDAN, “A Novel Density based Clustering Method using Nearest and Farthest Neighbor with PCA,” INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH, vol. 9, no. 2, pp. 27–34, 2017, [Online]. Available: https://sid.ir/paper/315198/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops