Learning Characteristic Structured Patterns in Rooted Planar Maps
Satoshi Kawamoto, Yusuke Suzuki, Takayoshi Shoudai · 2010
Abstract—Extending the concept of ordered graphs, we propose a new data structure to express rooted planar maps, which is called a planar map pattern. In order to develop an efficient data mining method from a dataset of rooted planar maps, we propose a polynomial time algorithm for finding a minimally generalized planar map pattern, which represents maximal structural features common to rooted planar maps. Moreover, we show that the class of planar map patterns is polynomial time learnable from positive data.