Using kernels on hierarchical graphs in automatic classification of designs

Authors:
Barbara Strug
Affiliations:
Department of Physics, Astronomy and Applied Computer Science, Jagiellonian University, Krakow, Poland
Venue:
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Year:
2011

Citing 22
Cited 0

Introduction to Solid Modeling

Introduction to Solid Modeling
Geometric and solid modeling: an introduction

Geometric and solid modeling: an introduction
Sweeping of three-dimensional objects

Computer-Aided Design
Syntactical models of distributed cooperative systems

Journal of Experimental & Theoretical Artificial Intelligence
Dynamically controlled cooperating/distributed grammar systems

Information Sciences: an International Journal
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Grammar systems

Handbook of formal languages, vol. 2
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms

Theoretical Computer Science
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data

PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Graphs and Designing

Proceedings of the International Workshop on Graph Transformations in Computer Science
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery
A survey of kernels for structured data

ACM SIGKDD Explorations Newsletter
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Substructure similarity search in graph databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
New ranking algorithms for parsing and tagging: kernels over discrete structures, and the voted perceptron

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Shortest-Path Kernels on Graphs

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Tree kernels for semantic role labeling

Computational Linguistics
Reasoning about designs through frequent patterns mining

Advanced Engineering Informatics
Kernels For Structured Data

Kernels For Structured Data
On reverse feature engineering of syntactic tree kernels

CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the use of kernel methods in automatic classification of hierarchical graphs is presented. The classification is used as a basis for evaluation of designs in a computer aided design system. A kernel for hierarchical graphs based on a combination of tree and graph kernels is proposed. Hierarchical graphs-based representation used in design problems is briefly presented. The proposed approach is tested in experiment on a flat layout design task and preliminary result are also presented.