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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Pan, W. (2008). Fast generation of local hasse graphs for learning from structurally connected instances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5009 LNAI, pp. 548–555). https://doi.org/10.1007/978-3-540-79721-0_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free