{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:46:57Z","timestamp":1767901617074,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642036439","type":"print"},{"value":"9783642036446","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03644-6_27","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T05:16:51Z","timestamp":1250831811000},"page":"341-355","source":"Crossref","is-referenced-by-count":24,"title":["MapReduce-Based Pattern Finding Algorithm Applied in Motif Detection for Prescription Compatibility Network"],"prefix":"10.1007","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiaohong","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Huajun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xiangyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"5594","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Block of Complex Networks. Science\u00a05594, 824\u2013827 (2002)","journal-title":"Science"},{"key":"27_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"27_CR3","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: ACM OSDI (2004)"},{"key":"27_CR4","first-page":"243","volume-title":"Data Mining and Knowledge Discovery","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. In: Data Mining and Knowledge Discovery, vol.\u00a05810, pp. 243\u2013271. Springer, Heidelberg (2005)"},{"key":"27_CR5","first-page":"721","volume-title":"2002 IEEE International Conference on Data Mining, 2002. ICDM 2002. Proceedings","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: 2002 IEEE International Conference on Data Mining, 2002. ICDM 2002. Proceedings, pp. 721\u2013724. IEEE Press, Maebashi City (2002)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokucbi","year":"2003","unstructured":"Inokucbi, A., Wasbio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning\u00a050(3), 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-36175-8_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Hong","year":"2003","unstructured":"Hong, M., Zhou, H., Wang, W., Shi, B.: An efficient algorithm of frequent connected subgraph extraction. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS, vol.\u00a02637, pp. 40\u201351. Springer, Heidelberg (2003)"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003)","author":"X. Yan","year":"2003","unstructured":"Yan, X., Hart, J.: CloseGraph: Mining closed frequent patterns. In: The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 286\u2013295. ACM, Washington (2003)"},{"key":"27_CR9","first-page":"549","volume-title":"2003 International Conference on Data Mining (ICDM)","author":"J. Huan","year":"2003","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: 2003 International Conference on Data Mining (ICDM), Melbourne, pp. 549\u2013552. IEEE, Florida (2003)"},{"issue":"11","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1109\/TKDE.2006.173","volume":"18","author":"E. Gudes","year":"2006","unstructured":"Gudes, E., Shimony, S.E., Vanetik, N.: Discovering frequent graph patterns using disjoint paths. IEEE Transactions on Knowledge and Data Engineering\u00a018(11), 1441\u20131456 (2006)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00872095","volume":"4","author":"K. Yoshida","year":"1994","unstructured":"Yoshida, K., Motoda, H., Indurkhya, N.: Graph-based induction as a unified learning framework. Journal of Applied Intelligence\u00a04, 297\u2013328 (1994)","journal-title":"Journal of Applied Intelligence"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Cook, J., Holder, L.: Substructure discovery using minimum description length and background knowledge. J. Artificial Intelligence Research, 231\u2013255 (1994)","DOI":"10.1613\/jair.43"},{"key":"27_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11599128_7","volume-title":"Transactions on Computational Systems Biology III","author":"F. Schreiber","year":"2005","unstructured":"Schreiber, F., Schw\u00f6bbermeyer, H.: Frequent Concepts and Pattern Detection for the Analysis of Motifs in Networks. In: Priami, C., Merelli, E., Gonzalez, P., Omicini, A. (eds.) Transactions on Computational Systems Biology III. LNCS (LNBI), vol.\u00a03737, pp. 89\u2013104. Springer, Heidelberg (2005)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Chen, J., Hsu, W., Lee, M.-L., Ng, S.-K.: Nemofinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs. In: KDD, pp. 106\u2013115 (2006)","DOI":"10.1145\/1150402.1150418"},{"key":"27_CR15","series-title":"LNCS (LNAI)","first-page":"445","volume-title":"ICDM 2007","author":"C. Chen","year":"2007","unstructured":"Chen, C., Yan, X., Zhu, F., Han, J.: gApprox: Mining frequent approximate patterns from a massive network. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol.\u00a04597, pp. 445\u2013450. Springer, Heidelberg (2007)"},{"key":"27_CR16","unstructured":"Chu, C., Kim, S.K., Lin, Y., Yu, Y.Y., Bradski, G.: Map-Reduce for Machine Learning on Multicore. NIPS (2006)"},{"key":"27_CR17","unstructured":"Chang, E., Zhu, K., Wang, H., Bai, H., Li, J., Qiu, Z., Cui, H.: PSVM: Parallelizing Support Vector Machines on Distributed Computers. NIPS (2007)"},{"key":"27_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-30116-5_42","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"Z. Wu","year":"2004","unstructured":"Wu, Z., Zhou, X., Liu, B., Chen, J.: Text Mining for Finding Functional Community of Related Genes using TCM Knowledge. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 459\u2013470. Springer, Heidelberg (2004)"},{"key":"27_CR19","first-page":"288","volume":"15","author":"T. Ying","year":"2007","unstructured":"Ying, T., Guo-fu, Y., Gui-bing, L., Jian-ying, C.: Mining Compatibility Rules from Irregular Chinese Traditional Medicine Database by Apriori Agorithm. Journal of Southwest Jiaotong University (English Edition)\u00a015, 288\u2013292 (2007)","journal-title":"Journal of Southwest Jiaotong University (English Edition)"},{"key":"27_CR20","series-title":"LNAI","first-page":"575","volume-title":"PRICAI 2004: Trends in Artificial Intelligence","author":"Z. Xuezhong","year":"2004","unstructured":"Xuezhong, Z., Zhaohui, W.: Distributional Character Clustering for Chinese Text Categorization. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol.\u00a03157, pp. 575\u2013584. Springer, Heidelberg (2004)"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1007\/BF02885958","volume":"44","author":"H. Xiao","year":"1999","unstructured":"Xiao, H., Liang, X., Lu, P., Chan, C.: New method for analysis of Chinese herbal complex prescription and its application. Chinese Science Bulletin\u00a044, 1164\u20131172 (1999)","journal-title":"Chinese Science Bulletin"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.artmed.2006.07.005","volume":"38","author":"Y. Feng","year":"2006","unstructured":"Feng, Y., Wu, Z., Zhou, X., Zhou, Z., Fan, W.: Knowledge discovery in traditional Chinese medicine: State of the art and perspectives. Artificial Intelligence in Medicine.\u00a038(3), 219\u2013236 (2006)","journal-title":"Artificial Intelligence in Medicine."},{"issue":"4","key":"27_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/ptr.1687","volume":"19","author":"Y.-H. Chang","year":"2005","unstructured":"Chang, Y.-H., Lin, H.-J., Li, W.-C.: Clinical evaluation of the traditional Chinese prescription Chi-Ju-Di-Huang-Wan for Dry Eye. Phytotherapy Research\u00a019(4), 349\u2013354 (2005)","journal-title":"Phytotherapy Research"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. Technical Report 02-026, Department of Computer Science, University of Minnesota (2002)","DOI":"10.21236\/ADA439497"},{"key":"27_CR25","volume-title":"Prescription: for the Specialty of Chinese Traditional Medicine","author":"D. Fujing","year":"2006","unstructured":"Fujing, D.: Prescription: for the Specialty of Chinese Traditional Medicine. Shanghai Publishing House of Science and Technology Press, Shanghai (2006)"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03644-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:36:35Z","timestamp":1558481795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03644-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036439","9783642036446"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03644-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}