Art

J-GLOBAL ID：200902268512730676   Reference number：03A0587824

Generalization for Frequent Subgraph Mining.

頻出グラフマイニング手法の一般化に関する研究

Author (3)： INOKUCHI AKIHIRO (日本アイ・ビー・エム 東京基礎研) ,  WASHIO TAKASHI (大阪大 産科研) ,  MOTODA HIROSHI (大阪大 産科研)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 103  Issue： 191(DE2003 32-77)  Page： 103-108  Publication year： Jul. 17, 2003 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *subgraph ,...
Semi thesaurus term： computational complexity ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0587824&from=J-GLOBAL&jstjournalNo=S0532B") }}

JST classification (2)： Basics of graph theory  (IA02020S) ,  Artificial intelligence  (JE08000Z)

Reference (21)：

• ASAI, T. Efficient Substructure Discovery from Large Semi-Structured Data. Proc. of SIAM Int'l. Conf. on Data Mining. 2002, 158-174
• COOK, D. Substructure Discovery Using Minimum Description Length and Background Knowledge. Journal of Artificial Intelligence Research. 1994, 1, 231-255
• DEHASPE, L. Finding frequent substructures in chemical compounds. Proc. of Int'l Conf. on Knowledge Discovery and Data Mining. 1998, 30-36
• DE RAEDT, L. The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding. Proc. of Int'l. Joint Conf. on Artificial Intelligence. 2001, 853-859
• GAREY, M. Computers and intractability : a guide to the theory of NP-completeness. 1979

Terms in the title (4)： グラフマイニング ,  手法 ,  一般化 ,  研究