CALL FOR PAPERS

CERTIFICATE

IMPACT FACTOR 2018

Subject Area

  • Life Sciences / Biology
  • Architecture / Building Management
  • Asian Studies
  • Business & Management
  • Chemistry
  • Computer Science
  • Economics & Finance
  • Engineering / Acoustics
  • Environmental Science
  • Agricultural Sciences
  • Pharmaceutical Sciences
  • General Sciences
  • Materials Science
  • Mathematics
  • Medicine
  • Nanotechnology & Nanoscience
  • Nonlinear Science
  • Chaos & Dynamical Systems
  • Physics
  • Social Sciences & Humanities

Why Us? >>

  • Open Access
  • Peer Reviewed
  • Rapid Publication
  • Life time hosting
  • Free promotion service
  • Free indexing service
  • More citations
  • Search engine friendly

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

Efficient clustering of big data using graph method

Author: 
Kameshwaran, K. and Malarvizhi, K.
Subject Area: 
Physical Sciences and Engineering
Abstract: 

The data mining process is to extract the information from a large data set and transform the extracted data into an understandable structure for further use. Clustering is a main task of exploratory data analysis and data mining applications. Clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar to each other than to those in other groups (clusters). Power Iteration Clustering (PIC) algorithm is recently identified algorithm which helps to create a good quality of cluster. PIC is simple and scalable graph clustering technique. In PIC the embedding is an approximation to a eigen value-weighted linear combination of all the eigenvectors of an normalized similarity matrix. This embedding turns out to be very effective for clustering. This work shows that PIC consistently outperformed when the process is parallelized and it achieves fault tolerance by branch and bound algorithm. Parallelization minimizes computation cost, this algorithm works on all lower end commodity computers.

PDF file: 

IJMCE RECOMMENDATION

ONLINE PAYPAL PAYMENT

CURRENT ISSUE

NEWS

CHIEF EDITOR
Rosane Cavalcante Fragoso, Brasil
ASSOCIATE CHIEF EDITOR

   

Jean-Marc SABATIER
Chief Scientific Officer and Head of a Research Group
France

Advantages of IJCR

  • Rapid Publishing
  • Professional publishing practices
  • Indexing in leading database
  • High level of citation
  • High Qualitiy reader base
  • High level author suport

EDITORIAL BOARD

Luai Farhan Zghair
Iraq
Hasan Ali Abed Al-Zu’bi
Jordanian
Fredrick OJIJA
Tanzanian
Firuza M. Tursunkhodjaeva
Uzbekistan
Faraz Ahmed Farooqi
Saudi Arabia
Eric Randy Reyes Politud
Philippines
Elsadig Gasoom FadelAlla Elbashir
Sudan
Eapen, Asha Sarah
United State
Dr.Arun Kumar A
India
Dr. Zafar Iqbal
Pakistan
Dr. SHAHERA S.PATEL
India
Dr. Ruchika Khanna
India
Dr. Recep TAS
Turkey
Dr. Rasha Ali Eldeeb
Egypt
Dr. Pralhad Kanhaiyalal Rahangdale
India
DR. PATRICK D. CERNA
Philippines
Dr. Nicolas Padilla- Raygoza
Mexico
Dr. Mustafa Y. G. Younis
Libiya
Dr. Muhammad shoaib Ahmedani
Saudi Arabia
DR. MUHAMMAD ISMAIL MOHMAND
United State
DR. MAHESH SHIVAJI CHAVAN
India
DR. M. ARUNA
India
Dr. Lim Gee Nee
Malaysia
Dr. Jatinder Pal Singh Chawla
India
DR. IRAM BOKHARI
Pakistan
Dr. FARHAT NAZ RAHMAN
Pakistan
Dr. Devendra kumar Gupta
India
Dr. ASHWANI KUMAR DUBEY
India
Dr. Ali Seidi
Iran
Dr. Achmad Choerudin
Indonesia
Dr Ashok Kumar Verma
India
Thi Mong Diep NGUYEN
France
Dr. Muhammad Akram
Pakistan
Dr. Imran Azad
Oman
Dr. Meenakshi Malik
India
Aseel Hadi Hamzah
Iraq
Anam Bhatti
Malaysia
Md. Amir Hossain
Bangladesh
Ahmet İPEKÇİ
Turkey
Mirzadi Gohari
Iran