Efficient rough sets based dynamic Agglomerative clustering

Journal Title: International Journal on Computer Science and Engineering - Year 2014, Vol 6, Issue 7

Abstract

There are different types of techiniques are there to extract knowledge from various sources. Critical / rough set has been applied to extract knowledge from various types of databases. Some limitations have been discovered in rough set, such as label inconsistency, the lack of flexibility and excessive dependency on discretization of the initial attributes. To overcome these limitations, a novel agglomerative clustering method using improved rough set is proposed. The idea of using equivalence class was also incorporated to merge and divide subclass. The experimental applications in data extraction and cooperative object localization showed the effectiveness of the presented improved rough set combined with agglomerative clustering.

Authors and Affiliations

Y. TEJASWINI , H VENKATESWARA REDDY

Keywords

Related Articles

A Survey on Recent Security Trends using Quantum Cryptography

Cryptography is the science of keeping private information from unauthorized access of ensuring data integrity and uthentication, and it is the strongest tool for controlling against much kind of security threats. Role...

Invariant Moments based War Scene Classification using ANN and SVM: A Comparative Study

In this paper we are trying to classify a war scene from the natural scene. For this purpose two set of image categories are taken viz., opencountry & war tank. By using Invariant Moments features are extracted from...

Overcoming Testing Challenges in Project Life Cycle using Risk Based Validation Approach

According to James Whittake, Microsoft Testing Expert and Author, “There are a number of trends that testers are going to have to grapple with. The first is that software is getting better. The result of this is that bug...

Design of a new search engine for the information search using image as an input key

It’s a long time we didn’t actually think about this. Whenever we need an image or the information regarding an image to be searched, we have to give a hint or the keyword related to the image. But think of a situation w...

Visual Data Mining in Indian Election System

A good leaders or Government is the basic need to develop country. In India, who is largest democratic country in the world people are not fully involved in the selection process of Leaders. On an average there are 60-65...

Download PDF file
  • EP ID EP136981
  • DOI -
  • Views 77
  • Downloads 0

How To Cite

Y. TEJASWINI, H VENKATESWARA REDDY (2014). Efficient rough sets based dynamic Agglomerative clustering. International Journal on Computer Science and Engineering, 6(7), 271-274. https://europub.co.uk/articles/-A-136981