By Topic

Clustering and refinement of hierarchical concept from categorical databases based on rough sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Been-Chian Chien ; Dept. of Inf. Eng., I-Shou Univ., Kaohsiung, Taiwan ; Su-Yu Liao

Discovering knowledge from large databases is a challenge in many applications. The implicit meanings of knowledge can be repressed by different knowledge representations. A concept hierarchy is a concise and general form of knowledge representation. Hierarchical concept description can organize relationships of data and express knowledge embedded in databases explicitly. We propose a new scheme based on rough sets to cluster and refine the concept hierarchy automatically for a given data set with nominal attributes. The proposed scheme consists of two algorithms: the concept clustering algorithm and the concept refinement algorithm. The experimental results show that the concept hierarchy mined by the proposed scheme contains meaningful concept in comparison with the previous approaches. The analyses of the algorithms also show that the proposed scheme is efficient and scaleable for large databases. It can also be extended to mining meaningful rules from databases.

Published in:

Fuzzy Systems, 2004. Proceedings. 2004 IEEE International Conference on  (Volume:3 )

Date of Conference:

25-29 July 2004