Enumeration of Maximally Frequent Ordered Tree Patterns with Height-constrained Variables for Trees

SUZUKI Yusuke; MIYAHARA Tetsuhiro; SHOUDAI Takayoshi; UCHIDA Tomoyuki; MATSUMOTO Satoshi; KUBOYAMA Tetsuji

Art

J-GLOBAL ID：202002241168879640 Reference number：20A0321355

Enumeration of Maximally Frequent Ordered Tree Patterns with Height-constrained Variables for Trees

ツリーにおける高さ制約付き変数による最大頻度順序木パターンの列挙

Publisher site {{ this.onShowPLink() }} Copy service {{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=20A0321355&COPY=1") }}
Access JDreamⅢ for advanced search and analysis. {{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=20A0321355&from=J-GLOBAL&jstjournalNo=U0475A") }}

Author (6)： , , , , ,
Material：
Volume： 12 Issue： 3 Page： 78-88 (WEB ONLY) Publication year： Dec. 23, 2019
JST Material Number： U0475A ISSN： 1882-7780 Document type： Article
Article type：原著論文 Country of issue： Japan (JPN) Language： ENGLISH (EN)

, , , , ,
,

System programmings in general

Reference (17)：

Abiteboul, S., Buneman, P. and Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann (2000).
Asai, T., Abe, K., Kawasoe, S., Sakamoto, H., Arimura, H. and Arikawa, S.: Efficient substructure discovery from large semistructured data, IEICE Trans. Inf. Syst., Vol.E87-D, No.12, pp.2754-2763 (2004).
Chehreghani, M.H. and Bruynooghe, M.: Mining rooted ordered trees under subtree homeomorphism, Data Mining and Knowledge Discovery, Vol.30, No.5, pp.1249-1272 (2016).
Doshi, M. and Roy, B.: Enhanced data processing using positive negative association mining on AJAX data, Proc. 2014 International Conference on Circuits, Systems, Communication and Information Technology Applications (CSCITA-2014), pp.386-390 (2014).
Jiang, C., Coenen, F. and Zito, M.: A survey of frequent subgraph mining algorithms, The Knowledge Engineering Review, Vol.28, No.1, pp.75-105 (2013).

ｍore...

, , , ,

Return to Previous Page