Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Michihiro Kuramochi
@article{DBLP:journals/is/KuramochiK07, author = {Michihiro Kuramochi and George Karypis}, title = {Discovering frequent geometric subgraphs}, journal = {Inf. Syst.}, volume = {32}, number = {8}, pages = {1101--1120}, year = {2007}, url = {https://doi.org/10.1016/j.is.2005.05.005}, doi = {10.1016/J.IS.2005.05.005}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/is/KuramochiK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/datamine/KuramochiK05, author = {Michihiro Kuramochi and George Karypis}, title = {Finding Frequent Patterns in a Large Sparse Graph\({}^{\mbox{*}}\)}, journal = {Data Min. Knowl. Discov.}, volume = {11}, number = {3}, pages = {243--271}, year = {2005}, url = {https://doi.org/10.1007/s10618-005-0003-9}, doi = {10.1007/S10618-005-0003-9}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/datamine/KuramochiK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijait/KuramochiK05, author = {Michihiro Kuramochi and George Karypis}, title = {Gene Classification Using Expression Profiles: {A} Feasibility Study}, journal = {Int. J. Artif. Intell. Tools}, volume = {14}, number = {4}, pages = {641--660}, year = {2005}, url = {https://doi.org/10.1142/S0218213005002302}, doi = {10.1142/S0218213005002302}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijait/KuramochiK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tkde/DeshpandeKWK05, author = {Mukund Deshpande and Michihiro Kuramochi and Nikil Wale and George Karypis}, title = {Frequent Substructure-Based Approaches for Classifying Chemical Compounds}, journal = {{IEEE} Trans. Knowl. Data Eng.}, volume = {17}, number = {8}, pages = {1036--1050}, year = {2005}, url = {https://doi.org/10.1109/TKDE.2005.127}, doi = {10.1109/TKDE.2005.127}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tkde/DeshpandeKWK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/wang2005/DeshpandeKK05, author = {Mukund Deshpande and Michihiro Kuramochi and George Karypis}, editor = {Jason Tsong{-}Li Wang and Mohammed Javeed Zaki and Hannu Toivonen and Dennis E. Shasha}, title = {Mining Chemical Compounds}, booktitle = {Data Mining in Bioinformatics}, pages = {189--215}, publisher = {Springer}, year = {2005}, timestamp = {Thu, 11 Aug 2016 11:10:44 +0200}, biburl = {https://dblp.org/rec/books/sp/wang2005/DeshpandeKK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tkde/KuramochiK04, author = {Michihiro Kuramochi and George Karypis}, title = {An Efficient Algorithm for Discovering Frequent Subgraphs}, journal = {{IEEE} Trans. Knowl. Data Eng.}, volume = {16}, number = {9}, pages = {1038--1051}, year = {2004}, url = {https://doi.org/10.1109/TKDE.2004.33}, doi = {10.1109/TKDE.2004.33}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tkde/KuramochiK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdm/KuramochiK04, author = {Michihiro Kuramochi and George Karypis}, title = {{GREW-A} Scalable Frequent Subgraph Discovery Algorithm}, booktitle = {Proceedings of the 4th {IEEE} International Conference on Data Mining {(ICDM} 2004), 1-4 November 2004, Brighton, {UK}}, pages = {439--442}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/ICDM.2004.10024}, doi = {10.1109/ICDM.2004.10024}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/KuramochiK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sdm/KuramochiK04, author = {Michihiro Kuramochi and George Karypis}, editor = {Michael W. Berry and Umeshwar Dayal and Chandrika Kamath and David B. Skillicorn}, title = {Finding Frequent Patterns in a Large Sparse Graph}, booktitle = {Proceedings of the Fourth {SIAM} International Conference on Data Mining, Lake Buena Vista, Florida, USA, April 22-24, 2004}, pages = {345--356}, publisher = {{SIAM}}, year = {2004}, url = {https://doi.org/10.1137/1.9781611972740.32}, doi = {10.1137/1.9781611972740.32}, timestamp = {Fri, 06 Oct 2023 11:45:43 +0200}, biburl = {https://dblp.org/rec/conf/sdm/KuramochiK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdm/DeshpandeKK03, author = {Mukund Deshpande and Michihiro Kuramochi and George Karypis}, title = {Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds}, booktitle = {Proceedings of the 3rd {IEEE} International Conference on Data Mining {(ICDM} 2003), 19-22 December 2003, Melbourne, Florida, {USA}}, pages = {35--42}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/ICDM.2003.1250900}, doi = {10.1109/ICDM.2003.1250900}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/DeshpandeKK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdm/KuramochiK02, author = {Michihiro Kuramochi and George Karypis}, title = {Discovering Frequent Geometric Subgraphs}, booktitle = {Proceedings of the 2002 {IEEE} International Conference on Data Mining {(ICDM} 2002), 9-12 December 2002, Maebashi City, Japan}, pages = {258--265}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/ICDM.2002.1183911}, doi = {10.1109/ICDM.2002.1183911}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/KuramochiK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/kdd/DeshpandeKK02, author = {Mukund Deshpande and Michihiro Kuramochi and George Karypis}, editor = {Mohammed Javeed Zaki and Jason Tsong{-}Li Wang and Hannu Toivonen}, title = {Automated Approaches for Classifying Structures}, booktitle = {Proceedings of the 2nd {ACM} {SIGKDD} Workshop on Data Mining in Bioinformatics {(BIOKDD} 2002), July 23rd, 2002, Edmonton, Alberta, Canada}, pages = {11--18}, year = {2002}, url = {http://www.cs.rpi.edu/\%7Ezaki/BIOKDD02/03-deshpande.pdf}, timestamp = {Wed, 29 Mar 2017 16:45:25 +0200}, biburl = {https://dblp.org/rec/conf/kdd/DeshpandeKK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bibe/KuramochiK01, author = {Michihiro Kuramochi and George Karypis}, editor = {Nikolaos G. Bourbakis}, title = {Gene Classification using Expression Profiles: {A} Feasibility Study}, booktitle = {2nd {IEEE} International Symposium on Bioinformatics and Bioengineering, Bethesda, Maryland, USA, November 4-5, 2001, Proceedings}, pages = {191--200}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/BIBE.2001.974429}, doi = {10.1109/BIBE.2001.974429}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/bibe/KuramochiK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdm/KuramochiK01, author = {Michihiro Kuramochi and George Karypis}, editor = {Nick Cercone and Tsau Young Lin and Xindong Wu}, title = {Frequent Subgraph Discovery}, booktitle = {Proceedings of the 2001 {IEEE} International Conference on Data Mining, 29 November - 2 December 2001, San Jose, California, {USA}}, pages = {313--320}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/ICDM.2001.989534}, doi = {10.1109/ICDM.2001.989534}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/KuramochiK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.