![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Michihiro Kuramochi Mukund Deshpande , Michihiro Kuramochi, George Karypis : Mining Chemical Compounds. Data Mining in Bioinformatics 2005 : 189-215 Michihiro Kuramochi, George Karypis : Finding Frequent Patterns in a Large Sparse Graph * . Data Min. Knowl. Discov. 11 (3): 243-271 (2005) Mukund Deshpande , Michihiro Kuramochi, Nikil Wale , George Karypis : Frequent Substructure-Based Approaches for Classifying Chemical Compounds. IEEE Trans. Knowl. Data Eng. 17 (8): 1036-1050 (2005) Michihiro Kuramochi, George Karypis : Gene Classification Using Expression Profiles: A Feasibility Study. International Journal on Artificial Intelligence Tools 14 (4): 641-660 (2005) Michihiro Kuramochi, George Karypis : GREW-A Scalable Frequent Subgraph Discovery Algorithm. ICDM 2004 : 439-442 Michihiro Kuramochi, George Karypis : Finding Frequent Patterns in a Large Sparse Graph. SDM 2004 Michihiro Kuramochi, George Karypis : An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans. Knowl. Data Eng. 16 (9): 1038-1051 (2004) Mukund Deshpande , Michihiro Kuramochi, George Karypis : Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. ICDM 2003 : 35-42 Mukund Deshpande , Michihiro Kuramochi, George Karypis : Automated Approaches for Classifying Structures. BIOKDD 2002 : 11-18 Michihiro Kuramochi, George Karypis : Discovering Frequent Geometric Subgraphs. ICDM 2002 : 258-265 Michihiro Kuramochi, George Karypis : Gene Classification using Expression Profiles: A Feasibility Study. BIBE 2001 : 191-200 Michihiro Kuramochi, George Karypis : Frequent Subgraph Discovery. ICDM 2001 : 313-320 1 [ 4 ] [ 5 ] [ 10 ] [ 12 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] 3 [ 10 ] ![]() ©2006 Association for Computing Machinery |