TITLE

DERIVING CLUSTER KNOWLEDGE USING ROUGH SET THEORY

AUTHOR(S)
Upadhyaya, Shuchita; Arora, Alka; Jain, Rajni
PUB. DATE
August 2008
SOURCE
Journal of Theoretical & Applied Information Technology;2008, Vol. 4 Issue 8, p688
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Clustering algorithms gives general description of the clusters listing number of clusters and member entities in those clusters. It lacks in generating cluster description in the form of pattern. Deriving pattern from clusters along with grouping of data into clusters is important from data mining perspective. In the proposed approach reduct from rough set theory is employed to generate pattern. Reduct is defined as the set of attributes which distinguishes the entities in a homogenous cluster. It is observed that most of the remaining attributes in the cluster has same value for their attribute value pair. Reduct attributes are removed to formulate pattern by concatenating most contributing attributes. Proposed approach is demonstrated using benchmarking mushroom dataset from UCI repository.
ACCESSION #
34487070

 

Related Articles

  • HYBRID ANT-BASED CLUSTERING ALGORITHM WITH CLUSTER ANALYSIS TECHNIQUES. Omar, Wafa'a; Badr, Amr; El-Fattah Hegazy, Abd // Journal of Computer Science;Jun2013, Vol. 9 Issue 6, p780 

    Cluster analysis is a data mining technology designed to derive a good understanding of data to solve clustering problems by extracting useful information from a large volume of mixed data elements. Recently, researchers have aimed to derive clustering algorithms from nature's swarm behaviors....

  • AVOIDING NOISE AND OUTLIERS IN K-MEANS. Jnena, Rami; Timraz, Mohammed; Ashour, Wesam // Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1 

    Applying k-means algorithm on the datasets that include large number of noise and outlier objects, gives unclear clusters results. In this paper we proposed a new technique for avoiding these noise and outliers by applying some preprocessing and post processing steps for the dataset that have to...

  • MULTI-DENSITY DBSCAN USING REPRESENTATIVES: MDBSCAN-UR. Ahmed, Rwand; El-Zaza, Eman; Ashour, Wesam // Computing & Information Systems;Oct2011, Vol. 15 Issue 2, p1 

    DBSCAN is one of the most popular algorithms for cluster analysis. It can discover clusters with arbitrary shape and separate noises. But this algorithm cannot choose its parameter according to distributing of dataset. It simply uses the global uses minimum number of points (MinPts) parameter,...

  • K-Means for Spherical Clusters with Large Variance in Sizes. Fahim, A. M.; Saake, G.; Salem, A. M.; Torkey, F. A.; Ramadan, M. A. // International Journal of Computer Science;2009, Vol. 4 Issue 3, p145 

    Data clustering is an important data exploration technique with many applications in data mining. The k-means algorithm is well known for its efficiency in clustering large data sets. However, this algorithm is suitable for spherical shaped clusters of similar sizes and densities. The quality of...

  • Avoiding Objects with few Neighbors in the K-Means Process and Adding ROCK Links to Its Distance. Alnabriss, Hadi A.; Ashour, Wesam // International Journal of Computer Applications;Aug2011, Vol. 28, p12 

    K-means is considered as one of the most common and powerful algorithms in data clustering, in this paper we're going to present new techniques to solve two problems in the K-means traditional clustering algorithm, the 1st problem is its sensitivity for outliers, in this part we are going to...

  • Role of Rough Sets in Data Analysis. Anitha, K. // Annual International Conference on Optoelectronics, Photonics & ;2016, p155 

    Data Clustering is the process of dividing a data set into groups of similar items. This paper describes the data analysis technique based on Rough sets. The main objective of data analysis using Rough Set theory is it discovers hidden patterns of data from high dimensional data base. Moreover...

  • An Intelligent Mining Framework based on Rough Sets for Clustering Gene Expression Data. Emilyn, J. Jeba; Ramar, K. // Journal of Applied Sciences;9/15/2012, Vol. 12 Issue 18, p1932 

    The main aim of this study is not only to develop a biclustenng algorithm that would successfully identify gene patterns but also to propose an intelligent clustering framework that would improve the cluster quality. Our framework for mining co-regulated genes from gene expression dataset is...

  • An effective web document clustering algorithm based on bisection and merge. Ingyu Lee; Byung-Won On // Artificial Intelligence Review;Jun2011, Vol. 36 Issue 1, p69 

    To cluster web documents, all of which have the same name entities, we attempted to use existing clustering algorithms such as K-means and spectral clustering. Unexpectedly, it turned out that these algorithms are not effective to cluster web documents. According to our intensive investigation,...

  • Combining PSO cluster and nonlinear mapping algorithm to perform clustering performance analysis: take the enterprise financial alarming as example. Pan, Wen-Tsao // Quality & Quantity;Oct2011, Vol. 45 Issue 6, p1291 

    Algorithm by simulating biological intelligence concept with application in the optimization issue is still in the emergent stage. Among them, Particle Swarm Optimization Algorithm is a concept and method that has group intelligence. Using the exploring and development feature of particle swarm,...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics