Categories
- Indexing & Abstracting
- Editorial Board
- Submit Manuscript
- Instruction to Author
- Current Issue
- Past Issues
- Call for papers December 2021
- Ethics and Malpractice
- Conflict of Interest Statement
- Statement of Informed Consent
- Final Proof Correction and Submission
- Publication Ethics
- Peer review process
- Cover image - September 2021
- Quick Response - Contact Us
CALL FOR PAPERS
Author Information
CERTIFICATE
IMPACT FACTOR 2019
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.
Privacy preservation in waste water treatment plant using k-means and birch algorithm
Subject Area:
Physical Sciences and Engineering
Abstract:
K-MEANS is a partitioning clustering algorithm in data mining which is very useful technique to find the nearest clusters in data. K-MEANS is an unsupervised learning, which use for divide the data into K-clusters. BIRCH is a Balanced Iterative reduction and clustering Hierarchies’ algorithm. It is a hierarchical based clustering in which is used to divide a large data in small clusters. To improve the quality to large dataset in which some values are not present we used a combination of K-MEANS and BIRCH algorithm to solve this problem. In this paper, we discussed the data set in which we do not get the exact problem in data set and how we solved it. To solve this type of problem we use represent a combination of K-MENAS and BIRCH algorithm.
PDF file:
Announcement
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
Monthly archive
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- 1 of 5
- ››
Advantages of IJCR
- Rapid Publishing
- Professional publishing practices
- Indexing in leading database
- High level of citation
- High Qualitiy reader base
- High level author suport
Copyright @ 2010 International Journal Of Current Research. All rights reserved
