This site uses cookies. More information presents the page The policy for cookies and similar technologies. CLOSE Close the warning message

Łukasz Skonieczny sustained his PhD thesis

On November 30, 2010:  Łukasz Skonieczny sustained his PhD thesis: "Mining of frequent graphs incorporating disconnectedness", supervised by Professor Marzena Kryszkiewicz.

The thesis is centered around methods of frequent graphs mining. It presents a survey of existing methods for frequent graphs discovery, especially algorithms included in the ParMol platform. Most existing methods of frequent graphs discovery are limited to connected graphs only, completely ignoring frequent unconnected graphs. In this thesis, we proposed two new algorithms: UGM and UFC, which discover both connected and unconnected frequent graphs. The significant part of the thesis is dedicated to solving a subgraph isomorphism problem which is one the most important operation in frequent graphs discovery. We described methods of solving the subgraph isomorphism problem by solving the constraints satisfaction problem and proposed optimization of these methods which utilize graph symmetries, especially symmetries coming from multiple connected components.

Last modified: Monday, June 18, 2012 - 11:46:08 AM, Wacław Struk

x x News (6) - by publication date

‹‹ October 2011 ››
Mon Tue Wed Thu Fri Sat Sun
          1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30