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

Agglomerative Clustering Onvertically Partitioned Data Distributed Database Mining

R.Senkamalavalli,T.Bhuvaneswari

Page(s):   75-77 ISSN:   2278-2397
DOI:   10.20894/IJDMTA.102.004.002.006 Publisher:   Integrated Intelligent Research (IIR)


  1. J. Vaidya and C. Clifton,   "Privacy preserving K-means clustering over vertically partitioned data",   Proceedings of the ninth ACMSIGKDD international c
    View Artical

  2. H. Yu, J.Vaidya and X. Jiang,   "Privacy preserving SVM classification on vertically partitioned data",   AdvinKnowledge Disc Data Min   ,Vol.3918   ,2006
    View Artical

  3. J. Liu, J. Luo, J. Z. Huang and L. Xiong,   "Privacy preserving distributed DBSCAN clustering   ,Vol.6   ,2012
    View Artical

  4. A. Inan, S. Kaya, Y.Saygin, E.Savas, A.Hintoglu and A. Levi,   "Privacy preserving clustering on horizontally partitioneddata",   PDM   ,Vol.63   ,2006
    View Artical

  5. P. Krishna Prasad and C. PanduRangan,   "Privacy preserving BIRCH algorithm for clustering over arbitrarily partitioned databases   ,2007
    View Artical

  6. B.Pinkas,   "Cryptographic techniques for privacy preserving data mining",   Interntional Journal of Applied Cryptography (IJAC   ,2013
    View Artical

  7. J. S.Vaidya,   "A thesis on privacy preserving data mining over Vertically Partitioned Data
    View Artical

  8. P.KhatriNishant, G.PreetiandP. Tusal,   "Privacy preserving clustering on centralized data through scaling transfermation",   International journal of computer engineering&tech   ,Vol.4   ,Issue 3   ,2013
    View Artical

  9. R. Duda and P. E. Hart,   "Pattern classification and scene analysis",   Wiley,New York.   ,1973
    View Artical

  10. K. Fukunaga,   "Introduction to statistical pattern recognition   ,1990
    View Artical

  11. S. Paul,   "An optimized distributed association rule mining algorithm in parallel and distributed data mining W",   Int J Comp Sci Info Technol   ,Vol.2   ,2010
    View Artical

  12. R. J. Gil-Garcia, J. M. Badia-Contelles, and A. Pons-Porrata,   "Extended star clustering algorithm",   Lecture Notes Comp   ,Vol.2905   ,2003
    View Artical

  13. G. Lance and W.Williams,   "A general theory of classificatory sorting strategies",   1:Hierarchical systems   ,Vol.9   ,1967
    View Artical

  14. B. Larsen and C. Aone,   "Fast and effective text mining using linear-time document clustering",   KDD   ,Vol.99   ,1999
    View Artical

  15. A. Pons-Porrata, R. Berlanga-Llavori, and J. Ruiz-Shulcloper,   "On-line event and topic detection by using thecompact sets clustering algorithm",   J Intelli Fuzzy Sys   ,2002
    View Artical

  16. K. Wagstaff and C. Cardie,   "Clustering with instance-level constraints",   Proceedings of the 17th International Conference o   ,2000
    View Artical

  17. I. Davidson and S. S. Ravi,   "Clustering with constraints and the k-Means algorithm",   the 5th SIAM Data Mining   ,2005
    View Artical

  18. I. Davidson and S. S. Ravi,   "Hierarchical clustering with constraints: Theory and practice",   the 9th European Principles and Practice of KDD, P   ,2005
    View Artical

  19. I. Davidson and S. S. Ravi,   "Intractability and clustering with constraints",   Proceedings of the 24th international conference o   ,2007
    View Artical