DOI:10.20894/IJDMTA.
Periodicity: Bi Annual.
Impact Factor:
SJIF:4.893 & GIF:0.787
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJDMTA provides online manuscript tracking system.

Every issue of Journal of IJDMTA is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJDMTA special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJDMTA website. For complete procedure, contact us at admin@iirgroups.org

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 8 Issue 1 Date of Publication:   June 2019

Review on Density Based Clustering Algorithms for Big Data

T.Miranda Lakshmi,R.Josephine Sahana, V.Prasanna Venkatesan

Page(s):   25-32 ISSN:   2278-2397
DOI:   10.20894/IJDMTA.102.008.001.005 Publisher:   Integrated Intelligent Research (IIR)

Big data is termed as huge volume of both structured and unstructured dataset. When dealing with these huge dataset several challenges are encountered by the users such as analysis, capture, storage, search, transfer, sharing, and visualization. To handle these complex data sets numerous technologies have been developed such as data mining, web mining, machine learning and optimization methods. From the above technologies data mining technology is considered in this paper. Data mining technology contains various techniques such as classification, prediction and clustering etc., This paper reviews the basic concepts and clustering approaches used for big data and also a comparison study is carried out in DBSCAN, DENCLUE, and OPTICS algorithms. Each of these methods has its own pros and cons. This paper reveals that DBSCAN is efficient than the other algorithms because of its simplicity.