Fast generation of local Hasse graphs for learning from structurally connected instances

Authors:
Wuming Pan
Affiliations:
College of Computer Science, Sichuan University, Chengdu, P.R. China
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 3
Cited 0

Concept Data Analysis: Theory and Applications

Concept Data Analysis: Theory and Applications
Mining Graph Data

Mining Graph Data
Self-organizing maps for learning the edit costs in graph matching

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a variety of graph structures on data. The properties of the local graphs around an instance are studied. A fast approach for generating local graphs and classifying by structurally connected instances is then sketched out.