Michihiro Kuramochi

According to our database, Michihiro Kuramochi authored at least 11 papers between 2001 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2007

Discovering frequent geometric subgraphs.

Michihiro Kuramochi, George Karypis

Inf. Syst., 2007

2005

Frequent Substructure-Based Approaches for Classifying Chemical Compounds.

Mukund Deshpande, Michihiro Kuramochi, Nikil Wale, George Karypis

IEEE Trans. Knowl. Data Eng., 2005

Gene Classification Using Expression Profiles: A Feasibility Study.

Michihiro Kuramochi, George Karypis

Int. J. Artif. Intell. Tools, 2005

Finding Frequent Patterns in a Large Sparse Graph^*.

Michihiro Kuramochi, George Karypis

Data Min. Knowl. Discov., 2005

Mining Chemical Compounds.

Mukund Deshpande, Michihiro Kuramochi, George Karypis

Proceedings of the Data Mining in Bioinformatics, 2005

2004

An Efficient Algorithm for Discovering Frequent Subgraphs.

Michihiro Kuramochi, George Karypis

IEEE Trans. Knowl. Data Eng., 2004

Finding Frequent Patterns in a Large Sparse Graph.

Michihiro Kuramochi, George Karypis

Proceedings of the Fourth SIAM International Conference on Data Mining, 2004

GREW-A Scalable Frequent Subgraph Discovery Algorithm.

Michihiro Kuramochi, George Karypis

Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004

2003

Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds.

Mukund Deshpande, Michihiro Kuramochi, George Karypis

Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

2002

Automated Approaches for Classifying Structures.

Mukund Deshpande, Michihiro Kuramochi, George Karypis

Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2002), 2002

2001

Frequent Subgraph Discovery.

Michihiro Kuramochi, George Karypis

Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001