Skip to Main Content
ASME Press Select Proceedings

Intelligent Engineering Systems through Artificial Neural Networks, Volume 16

Editor
Cihan H. Dagli
Cihan H. Dagli
Search for other works by this author on:
Anna L. Buczak
Anna L. Buczak
Search for other works by this author on:
David L. Enke
David L. Enke
Search for other works by this author on:
Mark Embrechts
Mark Embrechts
Search for other works by this author on:
Okan Ersoy
Okan Ersoy
Search for other works by this author on:
ISBN-10:
0791802566
No. of Pages:
1000
Publisher:
ASME Press
Publication date:
2006

Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., Euclidean) similarity measure in order to partition the database such that data points in the same partition are more similar than points in different partitions. In this paper, we study clustering algorithms for data with categorical attributes. Instead of using traditional clustering algorithms that use distances between points for clustering which is not an appropriate concept for Boolean and categorical attributes, we propose a novel concept of HAC (Hierarchy of Attributes and Concepts) to measure the similarity/proximity between a pair of data points. We present a robust clustering algorithm HAC that employs hierarchy of concepts and not distances when merging clusters. Our methods naturally extend to non-metric similarity measures that are relevant in situations where a domain expert/similarity table is the only source of knowledge. For data with categorical attributes, our findings indicate that HAC not only generates better quality clusters than traditional algorithms, but it also exhibits good scalability properties.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal