earticle

논문검색

Computing and Communications

Automatic Concept Hierarchy Construction from a Distance Matrix

원문정보

Huang-Cheng Kuo

피인용수 : 0(자료제공 : 네이버학술정보)

초록

영어

Concept hierarchies are important in many generalised data mining applications, such as multi-level association rule mining. There are drawbacks in using concept hierarchies constructed by domain experts. Therefore, we need automatic methods. We focus on situations where attributes of objects are useless for such a task. The attributes, such as price and size, are not relevant in the hierarchical structure of items when mining association rules from market basket data. Instead, the similarity between items from the point of view of customers is essential for organising the items. Assuming the availability of a distance matrix, our approach modifies the traditional hierarchical clustering algorithms to build a concept hierarchy. With some decision rules, a concept can be generalised from more than two specific concepts. Furthermore, the objects may be pre-processed, such that objects with high similarities are clustered into a ground concept. We formulate some evaluation criteria for the quality of constructed concept hierarchy.

목차

Abstract
 I. INTRODUCTION
 II. RELATED WORKS
 III. CONCEPT HIERARCHY CONSTRUCTION
 IV. MEASUREMENT METRICS
  A. Intrinsict Quality Measurement
  B. Indirect Quality Measurement
 V. PRE-PROCESSING
 VI. CONCLUSIONS
 REFERENCES
 BIOGRAPHIES

저자정보

  • Huang-Cheng Kuo Department of Computer Science and Information Engineering, National Chiayi University, Chia-Yi City 600, Taiwan

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.