DAGON Approach
Object of this exercise:
Given a subject graph and a set of pattern graph in canonical representation (2-input
NAND and INV), implement the second step of DAGON approach. (Both the subject
graph and the pattern graphs are trees.)
Data Structures and Algorithms with
Object-Oriented Design Pattern in C++
國外經(jīng)典C++原版書庫《數(shù)據(jù)結構與算法:面向對象的C++設計模式》/(美)Bruno R.Preiss著 胡廣斌等譯 十分經(jīng)典、難得！
Many of the pattern fi nding algorithms such as decision tree, classifi cation rules and clustering
techniques that are frequently used in data mining have been developed in machine learning
research community. Frequent pattern and association rule mining is one of the few excep-
tions to this tradition. The introduction of this technique boosted data mining research and its
impact is tremendous. The algorithm is quite simple and easy to implement. Experimenting
with Apriori-like algorithm is the fi rst thing that data miners try to do.
