The Basket Analysis derives frequent itemsets and association rules having support and confidence levels greater than their thresholds from massive transaction data. Though some recent research tries to discover wider classes of knowledge on the regularities contained in the data, the regularities in form of the graph structure has not been explored in the field of the Basket Analysis. The work reported in this paper proposes a new method to mine frequent graph structure appearing in the massive amount of transactions. A specific procedure to preprocess graph structured transactions is introduced to enable the application of the Basket Analysis to extract frequently appearing graph patterns. The basic performance of our proposing approach has been evaluated by a set of graph structured transactions generated by an artificial simulation. Moreover, its practicality has been confirmed through the appliaction to discover popular browsing patterns of clients in WWW URL network.
CITATION STYLE
Inokuchi, A., Washio, T., Motoda, H., Kumasawa, K., & Arai, N. (1999). Basket analysis for graph structured data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1574, pp. 421–433). Springer Verlag. https://doi.org/10.1007/3-540-48912-6_56
Mendeley helps you to discover research relevant for your work.