The layout of a Web page commonly offers a limited variety of elements arranged in a number of ways, for example, in navigation panels, or as advertisements, text content, and images. Presumably, the layout of a Web page will influence the way it is used, and this may or may not match the intentions of its designers. In this paper, we propose a novel graph mining algorithm and apply it to study the commercially important problem of how and what specific patterns and features of layout affect advertising click rates. Our proposed algorithm, MIGDAC (mining graph data for classification), applies graph theory and an interestingness measure to discover interesting subgraphs that can allow one class to be both characterized and easily distinguished from other classes. We first extract the information as a block from the Web pages and transform that information into sets of graphs. MIGDAC then uses an interestingness threshold and measure to extract a set of class-specific patterns from the frequent sub-graphs of each class. We then, calculate the weight of evidence to estimate whether the layout of the page will positively or negatively influence the advertisement click-rate on an unseen Web page. The experiment is performed on a set of real Web pages from a local Web site. MIGDAC performs well, greatly improving the accuracy of traditional frequent graph mining algorithm.
[1]
Wei-Ying Ma,et al.
Detecting web page structure for adaptive viewing on small form factor devices
,
2003,
WWW '03.
[2]
Sourav S. Bhowmick,et al.
Research Issues in Web Data Mining
,
1999,
DaWaK.
[3]
Andrew K. C. Wong,et al.
Statistical Technique for Extracting Classificatory Knowledge from Databases
,
1991,
Knowledge Discovery in Databases.
[4]
George Karypis,et al.
Frequent subgraph discovery
,
2001,
Proceedings 2001 IEEE International Conference on Data Mining.
[5]
Kenichi Kobayashi,et al.
Mining Interesting Patterns Using Estimated Frequencies from Subpatterns and Superpatterns
,
2003,
Discovery Science.
[6]
Ashwin Srinivasan,et al.
Warmr: a data mining tool for chemical data
,
2001,
J. Comput. Aided Mol. Des..
[7]
Takashi Washio,et al.
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
,
2000,
PKDD.