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

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 3 Issue 2 Date of Publication:   December 2014

Robust Clustering Algorithm Based on Complete Link Applied To Selection ofBio-Basis forAmino Acid Sequence Analysis

Mohamed A. Mahfouz

Page(s):   81- 88 ISSN:   2278-2397
DOI:   10.20894/IJDMTA. Publisher:   Integrated Intelligent Research (IIR)

Robust Clustering methods are aimed at avoiding unsatisfactory results resulting from the presence of certainamount of outlying observations in the input data of many practical applications such as biological sequences analysis or gene expressions analysis. This paper presents an algorithm termed as rough possibilistic complete link clustering algorithm (RPLINK) that maximizes the average similarity between pairs of patterns within the same cluster and at the same time the size of a cluster is maximized by computing the zeros of the derivative of appropriate objective function. The proposed algorithm is comprised of a judicious integration of the principles of rough sets, Complete Link and possibilistic clustering paradigm. This integration enables robust selection of the minimum set of the most informative bio-bases from the lower bound of the produced clusters. RPLINK along with the proposed initialization procedure with a few less sensitive input parameters shows a high outliers rejection capability as it makes their membership very low furthermore it does not requires the number of clusters to be known in advance and it can discover clusters of non convex shape. The effectiveness and robustness of the proposed algorithms, along with a comparison with other algorithms, have been demonstrated on different types of protein data sets.