Диссертация (1137259), страница 25
Текст из файла (страница 25)
2009. — Pp. 517–528.136. Zeng Z., Wang J., Zhou L., Karypis G. Coherent closed quasiclique discovery from large dense graph databases // Proc. 12thACM SIGKDD Int. Conf. Knowl. Discov. data Min. - KDD’06. — New York, New York, USA : ACM Press, Aug. 2006. —P. 797.153138. Zhao Q., Bhowmick S. S. Sequential pattern mining: A survey //ITechnical Rep.
CAIS Nayang Technol. Univ. Singapore. —2003. — Pp. 1–26.139. Zhu F., Yan X., Han J., Yu P. gPrune: A Constraint PushingFramework for Graph Pattern Mining // Adv. Knowl. Discov.Data Min. SE - 38. Vol. 4426 / ed. by Z.-H. Zhou, H. Li, Q.Yang. — Springer Berlin Heidelberg, 2007. — Pp. 388–400. —(Lecture Notes in Computer Science).140. Zimmermann A. Objectively evaluating interestingness measuresfor frequent itemset mining // Emerg. Trends Knowl. Discov.Data Mining-PAKDD 2013 Int.
Work. — 2013.154.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
