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. 2 Issue 2 Date of Publication:   December 2013

Improve the Performance of Clustering Using Combination of Multiple Clustering Algorithms

Kommineni Jenni,Sabahath Khatoon, Sehrish Aqeel

Page(s):   59-63 ISSN:   2278-2397
DOI:   10.20894/IJDMTA.102.002.002.005 Publisher:   Integrated Intelligent Research (IIR)

The ever-increasing availability of textual documents has lead to a growing challenge for information systems to effectively manage and retrieve the information comprised in large collections of texts according to the user�s information needs. There is no clustering method that can adequately handle all sorts of cluster structures and properties (e.g. shape, size, overlapping, and density). Combining multiple clustering methods is an approach to overcome the deficiency of single algorithms and further enhance their performances. A disadvantage of the cluster ensemble is the highly computational load of combing the clustering results especially for large and high dimensional datasets. In this paper we propose a multiclustering algorithm , it is a combination of Cooperative Hard-Fuzzy Clustering model based on intermediate cooperation between the hard k-means (KM) and fuzzy c-means (FCM) to produce better intermediate clusters and ant colony algorithm. This proposed method gives better result than individual clusters.