"Equivalence of Transforming Non-Linear DACG to Linear Concept Tree" by Junping Sun and Wenyi Bi
 

CCE Faculty Articles

Equivalence of Transforming Non-Linear DACG to Linear Concept Tree

Document Type

Article

Publication Title

Proceedings of the Fourth International Conference on Computer and Information Science

ISSN

0-7695-2296-3

Publication Date

7-2005

Abstract

This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation is divided into three steps: normalizing DACG into a linear concept tree, establishing a function on host attribute, and reorganizing the sequence of concept generalization. This study develops alternative approach to discovery knowledge under non-linear concept graph. It overcomes the problems with information loss in rule-based attribute oriented induction and low efficiency in path-id method. Because DACG is a more general concept schema, it is able to extract rich knowledge implied in different directions of non-linear concept scheme.

DOI

10.1109/ICIS.2005.61

This document is currently not available here.

Find in your library

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 1
see details

Share

COinS